A theory for the complete mechanization of a GPS-type problem solver

  • Authors:
  • R. B. Banerji;C. W. Ernst

  • Affiliations:
  • Temple University, Philadelphia, PA;Case Western Reserve University, Cleveland, OH

  • Venue:
  • IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

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.