PLANNER makes reasoning procedures programmable

A problem-solving language connected assertions and goals with procedures that controlled inference.

Carl Hewitt

AI topics

Explore related entries. Larger tags appear on more entries.

The contribution

PLANNER organized reasoning around patterns, goals, and procedures selected when relevant conditions were met. Its language supported adding or withdrawing assertions and breaking goals into subgoals. Hewitt made the control of deduction part of the programming language, linking knowledge representation with the procedures that use that knowledge.

What this does not establish

This paper presents a language and problem-solving approach. Its title is not evidence of a general-purpose autonomous robot; successful reasoning still depends on suitable knowledge and procedures.

Why this date?

1969 dates the original IJCAI paper. SHRDLU reference 27 cites it separately from a revised PLANNER memorandum in reference 28.

This entry follows the linked publication. Read the source and date conventions.

The original work

PLANNER: A Language for Proving Theorems in Robots

Authors: Carl Hewitt
Publication: IJCAI-69, 295-301
Source type: Conference paper

Original IJCAI paper (PDF)

The links above support the description and dating of this entry. Full text may be open or publisher-restricted.

Cited By

Atlas entries whose reference lists cite this work or the publication version noted below.

Procedures as a Representation for Data in a Computer Program for Understanding Natural Language (1971)
Reference 27 cites the 1969 conference paper; the later memorandum is a separate reference. Check the reference list.

Citations

Works in the Atlas cited by this entry.

The Use of Theorem-Proving Techniques in Question-Answering Systems (1968)
Listed in the source bibliography. Check the reference list.

Bibliography coverage: Reference section indexed. Open the source.

Reference text retains scan, spelling, line-break and column-order artifacts. Matching does not rely on publication year alone.

Read the indexed bibliography

Bibliography (PDF pages 7)

1 Black, F. A Deductive Question Answering System, doctoral d i s s e r t a t i o n , Harvard. 2 Green, C. C. and Raphael, B. The Use of Theorem-proving Techniques in Question-answering Systems. Proceedings of 23rd N a t i o n a l Conf. ACM. 3 Guzman, A. and Mcintosh, H. V . , Convert, Communications of ACM, Aug. 1966. 4 H e w i t t , C. , PLANNER: A Language for* Proving Theorems, A. I. memo 137, J u l y 1967. 5 McCarthy, J . ; Abrahams, P. W.; Edwards D. J . ; H a r t , T. P.; and L e v i n , Michael I. L i s p 1.5 Programmers Manual. 6 McCarthy, J. and Hayes, P., Some P h i l o s o p h i c a l Problems from the Standpoint of A r t i f i c i a l I n t e l l i g e n c e . Stanford A. I. Memo 73. 7 Newell, A . , Shaw, J. C., and Simon, H. A . , 1959. Report on a General Problem-solving Program, Proceedings of the International Conference on I n f o r m a t i o n Processing, P a r i s : UNESCO House. 8 Slagle, J. Experiments w i t h a Deductive Quest i o n - a n s w e r i n g Program, Communications of ACM December 1965.

Download the bibliography index · Download Atlas citation links

These links cover verified matches within the Atlas. They are not total scholarly citation counts. A citation alone does not establish that the later system implements the same method.

AI topics

The contribution

What this does not establish

Why this date?

Comments