A Formal Deductive Problem-Solving System

Authors:
J. R. Quinlan;E. B. Hunt
Affiliations:
University of Washington, Computer Science Group, Seattle, Washington;University of Washington, Computer Science Group, Seattle, Washington
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 6
Cited 7

Some studies in machine learning using the game of checkers

Computers & thought
GPS, a program that simulates human thought

Computers & thought
Steps toward artificial intelligence

Computers & thought
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)

Self-improvement in problem-solving

ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
The Unit Proof and the Input Proof in Theorem Proving

Journal of the ACM (JACM)
Annotated reasoning

Annals of Mathematics and Artificial Intelligence
Heuristic search vs. exhaustive search

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
A task-independent experience-gathering scheme for a problem-solver

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Predicting the length of solutions to problems

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Generalized means-ends analysis and artificial intelligence

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.