QA4: a procedural calculus for intuitive reasoning
Stanford research institute, 1972 - Education - 363 pages
This report presents a language, called QA4, designed to facilitate the construction of problem-solving systems used for robot planning, theorem proving, and automatic program synthesis and verification. QA4 integrates an omega-order logic language with canonical composition, associative retrieval, and pattern matching of expressions; process structure programming; goal-directed searching; and demons. Thus it provides many useful programming aids. More importantly, however, it provides a semantic framework for common sense reasoning about these problem domains. The interpreter for the language is extraordinarily general, and is therefore an adaptable tool for developing the specialized techniques of intuitive, symbolic reasoning used by the intelligent systems.
20 pages matching predicate in this book
Results 1-3 of 20
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
ADDTOLIST ALTPLAN applied argument Artificial Intelligence ASSERT assigned ATTEMPT statement backtracking context backtracking point binding bound variable BOX ROOM BOX1 called checks constructed context mechanism CONTEXT PUSH coordinate Coroutine data base DOOR dynamic context element evaluated example executed EXISTS expres fails failure FALSE fragment variable function global GOAL statement HAVEFUN Imhotep INROOM BOX INROOM ROBOT INROOM TUPLE instantiated internal form interpreter lambda expression LAMBDA TUPLE lightswitch LISP LISP atom LOOPPLAN matches TUPLE MODELVALUE NEXTSTEP NEXTTO node nonterminal node OPENDOOR operator pattern matcher pexp PLAN1 planner preconditions predicate prefix preprocessor problem solver PROG DECLARE program synthesis property list PUSHOUT PUSHTO QA4 expression QA4 language QA4 programs quasi-quote RESUME statement retrieval RETURN statement returns Richard Fikes ROOM2 RPAQQ semaphore SET SET SETQ TUPLE SETVALUE shopping list SHOPPINGLIST step subgoals subroutine syntactic theorem prover TRUE TUPLE 12 TUPLE CONDITIONAL TUPLE GOTO TURNONLIGHT UNEQUAL SET WEDGE