Algorithm = logic + control
- 1 July 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 22 (7) , 424-436
- https://doi.org/10.1145/359131.359136
Abstract
The notion that computation = controlled deduction was first proposed by Pay Hayes [19] and more recently by Bibel [2] and Vaughn-Pratt [31]. A similar thesis that database systems should be regarded as consisting of a relational component, which defines the logic of the data, and a control component, which stores and retrieves it, has been successfully argued by Codd [10]. Hewitt's argument [20] for the programming language PLANNER, though generally regarded as an argument against logic, can also be regarded as an argument for the thesis that algorithms be regarded as consisting of both logic and control components. In this paper we shall explore some of the useful consequences of that thesis.Keywords
This publication has 11 references indexed in Scilit:
- Logic and semantic networksCommunications of the ACM, 1979
- Prolog - the language and its implementation compared with LispPublished by Association for Computing Machinery (ACM) ,1977
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- A man-machine theorem-proving systemArtificial Intelligence, 1974
- Linear resolution with selection functionArtificial Intelligence, 1972
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- A Simplified Format for the Model Elimination Theorem-Proving ProcedureJournal of the ACM, 1969
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- Grundsätzliches zur Beschreibung Diskreter ProzessePublished by Springer Nature ,1967