Showing papers in "Artificial Intelligence in 1984"

TL;DR: In this article, a formalism for reasoning about actions is proposed that is based on a temporal logic, which allows a much wider range of actions to be described than with previous approaches such as the situation calculus.

TL;DR: This paper describes the basic concepts of qualitative process theory, several different kinds of reasoning that can be performed with them, and discusses its implications for causal reasoning.

TL;DR: A fairly encompassing account of qualitative physics, which introduces causality as an ontological commitment for explaining how devices behave, and presents algorithms for determining the behavior of a composite device from the generic behavior of its components.

TL;DR: In this paper, the authors describe a system that reasons from first principles, i.e., using knowledge of structure and behavior, to deal with situations that are novel in the sense that their outward manifestations may not have been encountered previously.

TL;DR: Dart differs from previous approaches to diagnosis taken in the design-automation community in that it is more general and in many cases more efficient, and allows it to be applied to a wide class of devices ranging from digital logic to nuclear reactors.

TL;DR: This paper presents a qualitative-reasoning method for predicting the behavior of mechanisms characterized by continuous, time-varying parameters that can detect a previously unsuspected landmark point at which the system is in stable equilibrium.

TL;DR: A domain-independent planning program that supports both automatic and interactive generation of hierarchical, partially ordered plans is described, and an improved formalism makes extensive use of constraints and resources to represent domains and actions more powerfully.

TL;DR: A new approach to knowledge representation where knowledge bases are characterized not in terms of the structures they use to represent knowledge, but functionally, in Terms of what they can be asked or told about some domain, which cleanly separates functionality from implementation structure.

TL;DR: In this article, the problem of motion measurement is formulated as the computation of an instantaneous two-dimensional velocity field, and a smoothness constraint of the velocity field is formulated based on the physical assumption that surfaces are generally smooth.

TL;DR: A polymorphic type scheme for Prolog is described which makes static type checking possible and it is observed that the type resolution problem for a Prolog program is another Prolog (meta)program.

TL;DR: Recent insights in the AM program spawn questions about "where the meaning really resides" in the concepts discovered by AM, leading to an appreciation of the crucial and unique role of representation in theory formation, a role involving the relationship between Form and Content.

TL;DR: A theory of commonsense understanding of the behavior of electronic circuits, based on the intuitive qualitative reasoning electrical engineers use when they analyze circuits, which describes important quantitative aspects of circuit functioning.

TL;DR: This volume brings together current work on qualitative reasoning, and presents knowledge bases for a number of very different domains, from heat flow, to transistors, to digital computation.

TL;DR: Temporal qualitative analysis as discussed by the authors is a technique for analyzing the qualitative large signal behavior of MOS circuits that straddle the line between the digital and analog domains, and is based on the following four components: First, a qualitative representation is composed of a set of open regions separated by boundaries.

TL;DR: A partial solution to the problem of constructing a fuzzy map is presented, an algorithm that assimilates a fact first by imposing constraints on the fuzzy coordinates of the objects involved, then by rearranging or growing the tree of frames of reference.

TL;DR: Verify as mentioned in this paper is a prolog program that attempts to prove the correctness of a digital design by showing that the behavior inferred from the interconnection of its parts and their behaviors is equivalent to the specified behavior.

TL;DR: An aigoritlitr1 to obtaitl local surface orierltatiorr frofti the apparetlt surface-pattertl distortion in an image is described and a spherical projection to model perspctiue imaging is proposed.

TL;DR: An abstract computational system for extended person-machine interface that incorporates many of the rules used by individuals in everyday interactions and function in place of explicit meta-communication about the structure of an ongoing exchange.

TL;DR: It is proved to never expand more nodes than B or A∗ and to expand a much smaller number of them in some cases and a proof that no overall optimal algorithm exists if the cost of an algorithm is measured by the total number of node expansions.

TL;DR: The problem of building a stable base for further research in artificial intelligence is illustrated by referring to Lenat's am program, in which the techniques employed are somewhat obscure in spite of the impressive performance.

TL;DR: This paper presents a formulation of B&B general enough to include previous formulations as special cases, and shows how two well-known AI search procedures are special cases of this general formulation.

TL;DR: In this article, a new approach is given to detect the surface orientation and motion from the texture on the surface by making use of a mathematical principle called "stereology", which can be used to detect surface motions relative to the viewer by computing features of its texture at one time and a short time later.

TL;DR: The most primitive case is selecting between two independent alternatives, and the value of the control knowledge that makes the decision is determined.

TL;DR: A comprehensive treatment of the use of an automated reasoning program to answer certain previously open questions from equivalential calculus with sufficient detail both to permit the work to be duplicated and to enable one to consider other applications of the techniques.

TL;DR: This paper shows how the libraries are compiled, how CHUNKER works, and discusses the plans for extending it to play the whole domain of king and pawn endings.

TL;DR: This method, which is basically a constraint refinement search, provides for a much more complete analysis of carbon-13 nuclear magnetic resonance spectra of complex organic molecules than any approach currently utilized.