A Theory for the Complete Mechanization of a GPS-Type Problem Solver

Banerji, Ranan B.; Ernst, George W.

A Theory for the Complete Mechanization of a GPS-Type Problem Solver

Download BibTeX Cite

Proceedings of the Fifth International Joint Conference on Artificial Intelligence. Problem-solving and Search. Pages 450-455.

Abstract

The data structure that drives the Ge~eral 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.

Ranan B. Banerji, and George W. Ernst. 1977. A Theory for the Complete Mechanization of a GPS-Type Problem Solver. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77. IJCAI, 450–455. https://ijcai.org/proceedings/1977/101

@inproceedings{ijcai1977p101,
  title     = {A Theory for the Complete Mechanization of a GPS-Type Problem Solver},
  author    = {Banerji, Ranan B. and Ernst, George W.},
  booktitle = {Proceedings of the Fifth International Joint Conference on
               Artificial Intelligence, {IJCAI-77}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Raj Reddy},
  pages     = {450--455},
  year      = {1977},
  note      = {Problem-solving and Search},
  url       = {https://ijcai.org/proceedings/1977/101},
}

TY  - CPAPER
TI  - A Theory for the Complete Mechanization of a GPS-Type Problem Solver
AU  - Banerji, Ranan B.
AU  - Ernst, George W.
T2  - Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1977
SP  - 450
EP  - 455
UR  - https://ijcai.org/proceedings/1977/101
ER  -