Showing papers in "Artificial Intelligence in 1982"

TL;DR: The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a largeCollection of objects that finds all the objects that match each pattern.

TL;DR: In this article, a theory of the nature of knowledge and representation is proposed, namely that there is another computer system level immediately above the symbol (or program) level, and the principle of rationality plays a central role.

TL;DR: The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem.

TL;DR: R1 is a program that configures VAX-11/780 computer systems and uses Match as its principal problem solving method; it has sufficient knowledge of the configuration domain and of the peculiarities of the various configuration constraints that at each step in the configuration process, it simply recognizes what to do.

TL;DR: $&% ' () * + " , .*/ 0 .

TL;DR: The assumptions of this organization are relaxed, one at a time, in case study of ten more sophisticated organizational prescriptions, which give techniques for dealing with unreliable data and time-varying data.

TL;DR: In this article, a method for recovering the three-dimensional structure of moving rigid and jointed objects from several single camera views is presented, based on the fixed axis assumption: all movement consists of translations and rotations about an axis that is fixed in direction for short periods of time.

TL;DR: CO-OP is a natural language database query system that provides conversationally cooperative responses to natural language requests for data retrieval and operates with a typical CODASYL database management system.

TL;DR: A theory of how it is possible to learn by precedents and exercises is presented and an implemented system that exploits the theory is described that holds that causal relations identify the regularities that can be exploited from past experience.

TL;DR: The proof procedure is shown to be complete and uses NC-resolution to derive a logic program from its specification, and to 'execute' a program specification in its original form.

TL;DR: The existence of pathology is demonstrated in a real game (Pearl's Game) using a real evaluation function and the similarities and differences between this game and a related nonpathological game are used as grounds for speculation on why pathology occurs in some games and not in others.

TL;DR: A theoretical model is developed that predicts at least order of k12 speedup with k processors andMeasurements of the algorithm's performance on the Arachne distributed operating system are presented.

TL;DR: Rules for semantic interpretation are given which include the determination of scoping of modifiers (with quantifier scoping as a special case) and the notions of slots and slot-filling play an important role, based on previous work by the author.

TL;DR: It is shown that the separate representation of control provides a basis for a theory of efficiency transformations on production systems, and allows for more effective means of directing search.

TL;DR: Two algorithms for finding the optimal interpretation of an unknown utterance in a continuous speech understanding system are described, guaranteeing that the first complete interpretation found will be the best scoring interpretation possible.

TL;DR: Some new approaches to mechanical theorem proving in the first-order predicate calculus are presented based on a natural deduction system which can be used to show that a set of clauses is inconsistent.

TL;DR: Learning is defined to be the computation done by a student when there is a transfer of information to him from a teacher as well as the possibility of making notes that are useful in deciding if conclusion makes sense.

TL;DR: Three algorithms for testing the complementarity of a matrix (representing a propositional formula) are developed in stages and it is shown that they can be simulated by at least one of these algorithms which provides a hierarchy among several ATP- methods.

TL;DR: The methods used to constrain the search are described, including one in which PARADISE uses an indirect strategy to prove that one move is best without finding the winning line (a first for a chess program).

TL;DR: The mathematical results in this paper suggest that biasing may instead be due to the errors made by the evaluation function.

TL;DR: Cognitive psychology and artificial intelligence are in many respects indistinguishable (a claim I argued in Pylyshyn (1979), so it requires more than a little gall and pretention to set out to comment on some papers that AI people may find useful.