The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The Semantics of Predicate Logic as a Programming Language
Open accessAbstract
Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 997
Self-citationReview of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
Linear resolution with selection function
Kowalski, R., & Kuehner, D. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90012-9 · Cited by 259
Self-citationA Simplified Format for the Model Elimination Theorem-Proving Procedure
Loveland, D. W. (1969) · Journal of the ACM · doi:10.1145/321526.321527 · Cited by 143
Implementation and applications of Scott's logic for computable functions
Milner, R. (1972) · ACM Conference on Proving Assertions about Programs · doi:10.1145/800235.807067 · Cited by 124
Splitting and reduction heuristics in automatic theorem proving
Bledsoe, W. W. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90004-x · Cited by 103
Properties of Programs and the First-Order Predicate Calculus
Manna, Z. (1969) · Journal of the ACM · doi:10.1145/321510.321516 · Cited by 82
Two Results on Ordering for Resolution with Merging and Linear Format
Reiter, R. (1971) · Journal of the ACM · doi:10.1145/321662.321678 · Cited by 60
Cited by
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
Reiter, R. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_3 · Cited by 990
Logic programs with stable model semantics as a constraint programming paradigm
Niemelä, I. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018930122475 · Cited by 834
Metadata
- Authors
- Van Emden, M. H., & Kowalski, R. A.
- Venue
- Journal of the ACM
- Published
- 1976-10
- Volume
- 23
- Issue
- 4
- Pages
- 733-742
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2108911687
- Cited by
- 1,449
- References
- 9
- FWCI
- 5.48
- 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
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.