PLANNER: A Language for Proving Theorems in Robots
Proceedings of the First International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 295-302.
Abstract
PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem solving primitives together with a hierarchical control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Conclusions can be drawn from these various changes in state, Goals can be established and dismissed when they are satisfied. The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient. The use of a general purpose matching language makes the deductive system more powerful.
@inproceedings{ijcai1969p29,
title = {PLANNER: A Language for Proving Theorems in Robots},
author = {Hewitt, Carl},
booktitle = {Proceedings of the First International Joint Conference on
Artificial Intelligence, {IJCAI-69}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Donald E. Walker and David C. Cooper},
pages = {295--302},
year = {1969},
month = {5},
note = {Theorem Proving},
url = {https://ijcai.org/proceedings/1969/29},
}
TY - CPAPER TI - PLANNER: A Language for Proving Theorems in Robots AU - Hewitt, Carl T2 - Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 PB - International Joint Conferences on Artificial Intelligence PY - 1969 SP - 295 EP - 302 UR - https://ijcai.org/proceedings/1969/29 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
