General Problem Solver
General Problem Solver (GPS) is a
solver machine. In contrast to the former Logic Theorist project, the GPS works with means–ends analysis.[1]
Overview
Any problem that can be expressed as a set of
predicate logic and Euclidean geometry problem spaces are prime examples of the domain of applicability of GPS. It was based on Simon and Newell's theoretical work on logic machines. GPS was the first computer program that separated its knowledge of problems (rules represented as input data) from its strategy of how to solve problems (a generic solver engine). GPS was implemented in the third-order programming language, IPL.[2]
While GPS solved simple problems such as the
IDA*
).
The user defined objects and operations that could be done on the objects, and GPS generated heuristics by means–ends analysis in order to solve problems. It focused on the available operations, finding what inputs were acceptable and what outputs were generated. It then created subgoals to get closer and closer to the goal.
The GPS paradigm eventually evolved into the Soar architecture for artificial intelligence.
See also
References
- ISBN 978-1-139-64282-8.
- ISBN 978-1-55860-191-8.
- Newell, A.; Shaw, J.C.; Simon, H.A. (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing. pp. 256–264.
- Newell, A. (1963). A Guide to the General Problem-Solver Program GPS-2-2. RAND Corporation, Santa Monica, California. Technical Report No. RM-3337-PR.
- Ernst, G.W. and Newell, A. (1969). GPS: a case study in generality and problem solving. Academic Press. (Revised version of Ernst's 1966 dissertation, Carnegie Institute of Technology.)
- Newell, A., and Simon, H. A. (1972) Human problem solving Englewood Cliffs, NJ: Prentice-Hall
- Noyes, James L. (1992). Artificial Intelligence with Common Lisp. ISBN 978-0-669-19473-9.