Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
General Problem Solver
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Computer program created in 1959}} '''General Problem Solver''' ('''GPS''') is a [[computer program]] created in 1957 by [[Herbert A. Simon]], [[Cliff Shaw|J. C. Shaw]], and [[Allen Newell]] ([[RAND Corporation]]) intended to work as a universal problem [[Solver (computer science)|solver]] machine. In contrast to the former [[Logic Theorist]] project, the '''GPS''' works with [[means–ends analysis]].<ref name="Nilsson2009">{{cite book|author=[[Nils J. Nilsson]]|title=The Quest for Artificial Intelligence|url=https://books.google.com/books?id=nUJdAAAAQBAJ|date=30 October 2009|publisher=Cambridge University Press|isbn=978-1-139-64282-8|pages=121–}}</ref> ==Overview== Any problem that can be expressed as a set of [[well-formed formula]]s (WFFs) or [[Horn clause]]s, and that constitutes a [[directed graph]] with one or more sources (that is, [[axiom|hypothese]]s) and sinks (that is, 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 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 [[Software engine|engine]]). GPS was implemented in the third-order programming language, [[Information Processing Language|IPL]].<ref name="Norvig1992">{{cite book |last = Norvig |first = Peter |authorlink = Peter Norvig|title = Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp |location = [[San Francisco]], [[California]] |publisher = Morgan Kaufmann |year = 1992 |url = https://books.google.com/books?id=QzGuHnDhvZIC |pages = 109–149 |isbn = 978-1-55860-191-8 }}</ref> 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 the 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* search algorithm|A*]] and [[IDA*]]). The user defined objects and operations that could be done on the objects, and GPS generated [[heuristic]]s 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 (cognitive architecture)|Soar]] architecture for [[artificial intelligence]]. ==See also== * [[Logic Theorist]] ==References== {{Reflist}} * Newell, A.; Shaw, J.C.; Simon, H.A. (1959). [http://bitsavers.informatik.uni-stuttgart.de/pdf/rand/ipl/P-1584_Report_On_A_General_Problem-Solving_Program_Feb59.pdf Report on a general problem-solving program. ''Proceedings of the International Conference on Information Processing.''] pp. 256–264. * Newell, A. (1963). [https://stacks.stanford.edu/file/druid:zk239tp3547/zk239tp3547.pdf 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 * {{cite book |last = Noyes |first = James L. |title = Artificial Intelligence with Common Lisp |location = [[Lexington, Massachusetts|Lexington]] |publisher = D. C. Heath |year = 1992 |pages = 343–371 |url = https://books.google.com/books?id=eIbBm7wvTjcC |isbn = 978-0-669-19473-9 }} [[Category:History of artificial intelligence]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Cite book
(
edit
)
Template:Reflist
(
edit
)
Template:Short description
(
edit
)