The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Algorithm = logic + control
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Self-citationAlgorithms+Data Structures = Programs
(2024) · Data Structures and Algorithms in Java · doi:10.1017/9781009260350.002 · Cited by 953
A Basis for a Mathematical Theory of Computation )
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72018-4 · Cited by 692
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 670
Self-citationFloyd, R. W. (1967) · Journal of the ACM · doi:10.1145/321420.321422 · Cited by 368
Linear Resolution with Selection Function
Kowalski, R., & Kuehner, D. (1983) · Automation of Reasoning · doi:10.1007/978-3-642-81955-1_32 · Cited by 316
Self-citation
Cited by
Algorithms, Governance, and Governmentality: On Governing Academic Writing
Introna, L. D. (2016) · Science, Technology, & Human Values · doi:10.1177/0162243915587360 · Cited by 339
The early years of logic programming
Kowalski, R. A. (1988) · Communications of the ACM · doi:10.1145/35043.35046 · Cited by 176
Self-citationAlgorithmic Authority: The Case of Bitcoin
Lustig, C., & Nardi, B. (2015) · 2015 48th Hawaii International Conference on System Sciences · doi:10.1109/hicss.2015.95 · Cited by 166
Chasing Frankenstein's Monster: Information Literacy in the Black Box Society
Lloyd, A. (2019) · Journal of Documentation · doi:10.1108/jd-02-2019-0035 · Cited by 41
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Metadata
- Authors
- Kowalski, R.
- Venue
- Communications of the ACM
- Published
- 1979-07
- Volume
- 22
- Issue
- 7
- Pages
- 424-436
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2011306767
- Cited by
- 600
- References
- 22
- FWCI
- 15.68
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithm = logic + control. https://app.cochat.ai/papers/10.1145/359131.359136
- The paper
- Kowalski, R. (1979). Algorithm = logic + control. Communications of the ACM. https://doi.org/10.1145/359131.359136
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.