Showing papers in "Artificial Intelligence in 1991"

TL;DR: Brooks et al. as discussed by the authors decompose an intelligent system into independent and parallel activity producers which all interface directly to the world through perception and action, rather than interface to each other particularly much.

TL;DR: It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.

TL;DR: It is shown that deciding coherence and subsumption of such descriptions are PSPACE-complete problems that can be decided with linear space.

TL;DR: The semantics of revising knowledge bases represented by sets of propositional sentences is analyzed from a model-theoretic point of view and all revision schemes that satisfy the Gardenfors rationality postulates are characterized.

TL;DR: The search control heuristics employed within the O-Plan planner involve the use of condition typing, time and resource constraints and domain constraints to allow knowledge about an application domain to be used to prune the search for a solution.

TL;DR: The utility of compositional modeling is illustrated by outlining the organization of a large-scale, multi-grain,Multi-perspective model the authors have built for engineering thermodynamics, and showing how the model composition algorithm can be used to automatically select the appropriate knowledge to answer questions in a tutorial setting.

TL;DR: This paper focuses on one type of abduction in which the best explanation is the most plausible combination of hypotheses that explains all the data, and presents several computational complexity results demonstrating that thistype of abduction is intractable (NP-hard) in general.

TL;DR: In this article, the authors discuss foundations for distributed artificial intelligence (DAI), with a particular critical analysis of Hewitt's Open Information Systems Semantics (OISS), and present a brief overview of current DAI research including motivations and concepts, and discusses some of the basic problems in DAI.

TL;DR: A general framework for qualitative spatial reasoning is described and how it can be used to understand complex mechanical systems, such as clocks, and it is claimed that shape and connectivity are the central features of qualitative spatial representations for kinematics.

TL;DR: In this article, the three major findings and hypotheses of AI to date are discussed. But they do not discuss the future directions for the main enterprise of AI research, and they focus on the current state of the art.

TL;DR: This note points out the close relationships existing between recent proposals in the theory of belief revision made by Gardenfors based on the notion of epistemic entrenchment, and possibility theory applied to automated reasoning under uncertainty.

TL;DR: The main idea is to reproduce the physicist's ability to evaluate the influence of different phenomena according to their relative order of magnitude and to use this information to distinguish among radically different ways in which a physical system may behave.

TL;DR: OIS Semantics characterizes the role of Negotiation as a powerful method for increasing understanding of large-scale OIS projects and characterizing the scope and limits of Deduction for operational and representational activities in OIS.

TL;DR: In this paper, randomly coded messages, Shafer's canonical examples for Dempster-Shafer theory, are employed to clarify these requirements and to evaluate Dempsters' rule.

TL;DR: In this paper, the complexity of reasoning with a number of limited default logics is investigated, and a fast algorithm for skeptical reasoning with binary defaults is presented, and sources of complexity are discussed.

TL;DR: In this paper, a general approach to the study of metareasoning is presented, not in the sense of explicating the semantics of explicitly specified meta-level control policies, but in the meaning of providing a basis for selecting and justifying computational actions.

TL;DR: What special benefits accrue to concept-using creatures are considered, because concepts are either necessary for certain types of perception, learning, and control, or they make those processes computationally simpler.

TL;DR: This article takes a step towards providing an analysis of the Soar architecture as a basis for general intelligence with a description of Soar cast in terms of the theoretical idea of multiple levels of description.

TL;DR: It is argued that logical soundness, completeness, and worst-case complexity are inadequate measures for evaluating the utility of representation services, and that this evaluation should employ the broader notions of utility and rationality found in decision theory.

TL;DR: Some challenging problems for artificial intelligence are confronted and what is being done in an attempt to solve them are described.

TL;DR: This work strengthens the applicability condition for defaults and makes the reasons for believing something an explicit part of the derived formulas, and the resulting new logic turns out to be semi-monotonic.

TL;DR: The concept of schema and the Schema Theorem are interpreted from a new perspective, which allows GAs to be regarded as a constrained random walk, and offers a view which is amenable to generalization.

TL;DR: This paper presents a new solution to the Yale shooting problem based on the idea that since the abnormality predicate takes a situational argument, it is important for the meanings of the situations to be held constant across the various models being compared.

TL;DR: A Revised Polytree Algorithm is developed with the same complexity as the undirected methods, but within the directed framework of the Poly Tree Algorithm, which obtains the corresponding significant improvement in speed, but also a much simpler form for combination.

TL;DR: A kinematic analysis algorithm for mechanisms built of rigid parts, such as door locks, gearboxes, and transmissions, is presented and it is shown that the feasible class covers most mechanisms by surveying 2500 mechanisms from an engineering encyclopedia.

TL;DR: Two practical methods for computing preimages for a robot having a two-dimensional Euclidean configuration space are described and a combination of these two methods which yields the most powerful practical method devised so far for Computing preimages is proposed.

TL;DR: An implemented program for troubleshooting complex digital circuits is described, using a representation that makes explicit their behavior at a high level of temporal abstraction, their physical and functional organization, and the common ways that their components fail.

TL;DR: This paper introduces new, qualitative methods that automatically select and switch models during analysis in physical domains as graphs of models, where the nodes of the graph are models and the edges are the assumptions that have to be changed in going from one model to the other.