The production system is a theoretical model of computation relevant to the artificial intelligence field allowing for problem solving procedures such as hierarchical tree search. In this work we explore some of the connections between artificial intelligence and quantum computation by presenting a model for a quantum production system. Our approach focuses on initially developing a model for a reversible production system which is a simple mapping of Bennett's reversible Turing machine. We then expand on this result in order to accommodate for the requirements of quantum computation. We present the details of how our proposition can be used alongside Grover's algorithm in order to yield a speedup comparatively to its classical counterpart. We discuss the requirements associated with such a speedup and how it compares against a similar quantum hierarchical search approach.

Instead they have commonly assigned structure to a domain using statistical techniques such as Bayes' Theorem

TEntEsuis is a program designed to provide assistance on the task of building knowledge-based results and motivations for its actions.

Human programmers seem to know a lot about programming. This suggests a way to try to build here was designed to shed some light on questions like these.

The next project was Joel Moses's program SIN. See Moses, Symbolic Integration: The Stormy Decade, 14 Comm.

Also to appear in Proceedings NIE--LRDC Conference on Thinking and Learning Skills, Lawrence Erlbaum Associates.

A. YONEZAWA and C. HEWITT 41 REPRESENTATIONS FOR ABSTRACT REASONING 4 A maximal method for set variables in automatic theorem-proving W. W. BLEDSOE

A new predicate calculus deduction system based on production rules is proposed. The system combines several developments in Artificial Intelligence and Automatic Theorem Proving research including the use of domain-specific inference rules and separate mechanisms for forward and backward reasoning. It has a clean separation between the data base, the production rules, and the control system. Goals and subgoals are maintained in an AND/OR tree structure. We introduce here a structure that is the dual of the AND/OR tree to represent assertions. The production rules modify these structures until they "connect" in a fashion that proves the goal theorem. Unlike some previous systems that used production rules, ours is not limited to rules in Horn Clause form. Unlike previous PLANNER-like systems, ours can handle the full range of predicate calculus expressions including those with quantified variables, disjunctions, and negations.

A program called "AM" is described which carries on simple mathematics research, defining and studying new concepts under the guidance of a large body of heuristic rules. The 250 heuristics communicate via an agenda mechanism, a global priority queue of small tasks for the program to perform, and reasons why each task is plausible (for example, "Find generalizations of'primes', because'primes' turned out to be so useful a concept"). Each concept is represented as an active, structured knowledge module. One hundred very incomplete modules are initially supplied, each one corresponding to an elementary set-theoretic concept (for example, union). This provides a definite but immense space which AM begins to explore.

J. Do RAN 433 22 Chromosome classification and segmentation as exercises in knowing what to expect.