GPS stands for _______________.
GPS stands for _______________.
The correct option is A Generalized Problem Solver
GPS stands for Generalized Problem Solver.
General Problem Solver or G.P.S. is a computer
program created in 1959 by Herbert A. Simon, J. C. Shaw, and Allen Newell
intended to work as a universal problem solver machine. Any problem that can be
expressed as a set of well-formed formulas (WFFs) or Horn clauses, and that
constitute a directed graph with one or more sources (viz., axioms) and sinks
(viz., desired conclusions), can be solved, in principle, by GPS. Proofs in the
predicate logic and Euclidean geometry problem spaces are prime examples of the
domain the applicability of GPS.
It was based on Simon and Newell's theoretical work
on logic machines. GPS was the first computer program which 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.
While GPS solved simple problems such as the Towers
of Hanoi that could be sufficiently formalized, it could not solve any
real-world problems because search was easily lost in the combinatorial
explosion. Put another way, the number of "walks" through the
inferential digraph became computationally untenable. (In practice, even a
straightforward state space search such as the Towers of Hanoi can become
computationally infeasible, albeit judicious prunings of the state space can be
achieved by such elementary AI techniques as A* and IDA*).
GPS stands for Generalized Problem Solver.
General Problem Solver or G.P.S. is a computer program created in 1959 by Herbert A. Simon, J. C. Shaw, and Allen Newell intended to work as a universal problem solver machine. Any problem that can be expressed as a set of well-formed formulas (WFFs) or Horn clauses, and that constitute a directed graph with one or more sources (viz., axioms) and sinks (viz., desired conclusions), can be solved, in principle, by GPS. Proofs in the predicate logic and Euclidean geometry problem spaces are prime examples of the domain the applicability of GPS.
It was based on Simon and Newell's theoretical work on logic machines. GPS was the first computer program which 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.
While GPS solved simple problems such as the Towers of Hanoi that could be sufficiently formalized, it could not solve any real-world problems because search was easily lost in the combinatorial explosion. Put another way, the number of "walks" through the inferential digraph became computationally untenable. (In practice, even a straightforward state space search such as the Towers of Hanoi can become computationally infeasible, albeit judicious prunings of the state space can be achieved by such elementary AI techniques as A* and IDA*).
