Application of Theorem Proving to Problem Solving
Proceedings of the First International Joint Conference on Artificial Intelligence. Heuristic Problem Solving. Pages 219-240.
Abstract
This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to sample problems including the "Monkey and Bananas" puzzle and the "Tower of Hanoi" puzzle. The paper exhibits solutions to these problems obtained by QA3, a computer program based on these theorem-proving methods . In addition , the paper shows how QA3 can write simple computer programs and can solve practical problems for a simple robot.
@inproceedings{ijcai1969p22,
title = {Application of Theorem Proving to Problem Solving},
author = {Green, C. Cordell},
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 = {219--240},
year = {1969},
month = {5},
note = {Heuristic Problem Solving},
url = {https://ijcai.org/proceedings/1969/22},
}
TY - CPAPER TI - Application of Theorem Proving to Problem Solving AU - Green, C. Cordell T2 - Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 PB - International Joint Conferences on Artificial Intelligence PY - 1969 SP - 219 EP - 240 UR - https://ijcai.org/proceedings/1969/22 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
