Showing papers in "Artificial Intelligence in 1986"

TL;DR: It is shown that if the network is singly connected (e.g. tree-structured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network.

TL;DR: It is shown that, given a setting in which purposeful dialogues occur, this model of cooperative behavior can account for responses that provide more information that explicitly requested and for appropriate responses to both short sentence fragments and indirect speech acts.

TL;DR: New algorithms for arc and path consistency are presented and it is shown that the arc consistency algorithm is optimal in time complexity and of the same-order space complexity as the earlier algorithms.

TL;DR: This work presents a representation that has proven competent to accurately describe an extensive variety of natural forms, as well as man-made forms, in a succinct and natural manner, and shows that the primitive elements of such descriptions may be recovered in an overconstrained and therefore reliable manner.

TL;DR: GUS (Genial Understander System) as mentioned in this paper is the first of a series of experimental computer systems that are intended to engage a sympathetic and highly cooperative human in an English dialog, directed towards a specific goal within a very restricted domain of discourse.

TL;DR: A set of concerns for interfacing with the ATMS, an interface protocol, and an example of a constraint language based on the protocol are presented, which concludes with a comparison of the AT MS and the view of problem solving it entails with other approaches.

TL;DR: This paper shows how the basic ATMS is extended to handle defaults and disjunctions of assumptions, which are used to encode disjunction of nodes, nonmonotonic justifications, normal defaults, nonnormal defaults, and arbitrary propositional formulas.

TL;DR: This chapter discusses the knowledge-based systems or KBS, the idea is not just to construct systems that exhibit knowledge, but to represent that knowledge somehow in the data structures of the program, and to have the system perform whatever it is doing by manipulating that knowledge explicitly.

TL;DR: This paper explores the relationship between causal ordering and propagation of constraints upon which the methods of qualitative physics are based and criticizes de Kleer and Brown.

TL;DR: The 3D Mosaic system is a vision system that incrementally reconstructs complex 3D scenes from a sequence of images obtained from multiple viewpoints, and the various components of the system are described, including stereo analysis, monocular analysis, and constructing and updating the scene model.

TL;DR: This work addresses primarily certainty and employs censored production rules as an underlying representational and computational mechanism for handling trade-offs between the precision of inferences and the computational efficiency of deriving them.

TL;DR: The proposed method might offer a plausible cognitive model of classification processes as well as an engineering solution to the problems of automatic classification generation.

TL;DR: This paper concentrates on the practical aspects of a program transformation system being developed and describes the present performance of the system and outlines the techniques and heuristics used.

TL;DR: The fractal surface model [Pentland 83] provides a formalism that is competent to describe such natural 3-D surfaces and is able to predict human perceptual judgments of smoothness versus roughness — thus allowing the reliable application of shape estimation techniques that assume smoothness.

TL;DR: A program which uses aggregation to perform causal simulation in the domain of molecular genetics and a detailed analysis of aggregation indicates the requirements and limitations of the technique as well as problems for future research.

TL;DR: PECOS as discussed by the authors is a system for implementing abstract algorithms, including simple symbolic programming, sorting, graph theory, and even simple number theory, using a set of about four hundred detailed rules.

TL;DR: This paper applies the assumption that beliefs are sentences of first-order logic stored in an agent's head to the standard logical problems about belief, and uses it to describe the connections between belief and planning.

TL;DR: Etherington, Mercer and Reiter showed that circumscription cannot lead to inconsistency for universal formulas, and this result is extended in three directions: to formulas of a more general syntactic form, to circumscription with some predicate symbols allowed to vary, and to prioritized circumscription.

TL;DR: The source of the structural equations in the causal ordering approach is discussed, and the claim that there are inherent differences between the “engineer's” and the "economist's" approach to the study of system behavior is challenged.

TL;DR: It is shown that DB∗ is consistent iff DB is consistent and if P is the set of all predicates from DB and DB does not contain functional symbols, thenDB∗ coincides with Minker's GCWA.

TL;DR: It is shown how knowledge of the properties of the relations involved and knowledge about the contents of the system's database can be used to prove that portions of a search space will not contribute any new answers.

TL;DR: In this paper, the authors present a framework for using analysis and searching knowledge to guide program synthesis in a stepwise refinement paradigm, and a particular implementation of the framework, called libra, is described.

TL;DR: In this paper, the authors investigate the model theory of the notion of circumscription, and find completeness theorems that provide a partial converse to a result of McCarthy, and they show that the circumscriptive theoremiques are precisely the truths of the minimal models, in the case of various classes of theories, and for various versions of circumcription.

TL;DR: Glymour as mentioned in this paper showed that under the conditions assumed by Pednault et al., at most one of the items of evidence can alter the probability of any given hypothesis; thus, although updating is possible, multiple updating for any of the hypotheses is precluded.

TL;DR: A simple language for examples for examples of how an algorithm behaves on particular input are considered as possible means of describing the algorithm and an algorithm for the synthesis of a procedure from a set of such example computations is described.

TL;DR: This program uses a series of processing stages which progressively transform an English input into a form usable by the computer simulation of paranoia, and performs aspects of traditional parsing which greatly facilitate the overall language recognition process.

TL;DR: A heuristic search strategy via islands is suggested to significantly decrease the number of nodes expanded to ensure a suboptimal cost path (which may be optimal) and in extreme cases falls back to A∗.

TL;DR: It was found that a one-page description of two common sorting algorithms or of some common approximation problems was sufficient for the computer to understand and analyze a wide variety of programs and identify and describe almost all errors.

TL;DR: A general framework is provided, within which various conventional procedures including alpha-beta and SSS∗ can be naturally generalized to the informed model, which permits the usage of heuristic information pertaining to nonterminal nodes.

TL;DR: In this article, a computer program for modelling a child between the ages of 1 and 2 years is described, which is based on observations of the knowledge this child had at age 1, the comprehension abilities he had at 2, and the language experiences he had between these ages.