Access Restriction

Author Quinlan, J. R. ♦ Hunt, E. B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1968
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1968-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 15
Issue Number 4
Page Count 22
Starting Page 625
Ending Page 646

Open content in new tab

   Open content in new tab
Source: ACM Digital Library