A Theory for the Complete Mechanization of a GPS-Type Problem Solver
Abstract
The data structure that drives the General Problem Solver is the Connection Table. This paper describes the theoretical basis for the automatic construction of this table by computer programs. The programs for this purpose have been developed at the Case Western Reserve University. They basically isolate certain attributes of the problem states which are invariant under certain moves and then put those attributes together to triangularize the Connection Table.
Cite
Text
Banerji and Ernst. "A Theory for the Complete Mechanization of a GPS-Type Problem Solver." International Joint Conference on Artificial Intelligence, 1977.Markdown
[Banerji and Ernst. "A Theory for the Complete Mechanization of a GPS-Type Problem Solver." International Joint Conference on Artificial Intelligence, 1977.](https://mlanthology.org/ijcai/1977/banerji1977ijcai-theory/)BibTeX
@inproceedings{banerji1977ijcai-theory,
title = {{A Theory for the Complete Mechanization of a GPS-Type Problem Solver}},
author = {Banerji, Ranan B. and Ernst, George W.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1977},
pages = {450-456},
url = {https://mlanthology.org/ijcai/1977/banerji1977ijcai-theory/}
}