A Formal Deductive Problem-Solving System
J. R. Quinlan, Earl B. Hunt · Journal of the ACM · 1968
A formalism is defined in which solutions to theorem-proving and similar problems take the form of a sequence of transformations of states into other states. The data used to solve a problem then consists of a set of rewriting rules which defines the allowable transformations. A method for selecting “useful” transformations, i.e. those which will most probably lead to a solution, is developed. Two problem-solving processes based on the above are defined; one, called the FORTRAN Deductive System (FDS) is shown to be more powerful than the other. A class of problems to which FDS will always find solutions is constructed. Examples of solutions found by a computer implementation of FDS are given and, in some cases, are compared with human performance. Finally, FDS is compared with some of the better-known problem-solving systems.
Cited by 32 works. doi:10.1145/321479.321487 Open-access PDF
Authors
References
- A Machine-Oriented Logic Based on the Resolution Principle
- The unit preference strategy in theorem proving
- GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT
- Automatic Theorem Proving With Renamable and Semantic Resolution
- The Concept of Demodulation in Theorem Proving
- Some issues of representation in a general problem solver
- Programming and utilization of digital computers