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
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
The Object-Oriented Database System Manifesto
Atkinson, M., DeWitt, D., Maier, D., Bancilhon, F., Dittrich, K., & Zdonik, S. (1990) · Deductive and Object-Oriented Databases · doi:10.1016/b978-0-444-88433-6.50020-4 · Cited by 606
Contributions to the Theory of Logic Programming
Apt, K. R., & van Emden, M. H. (1982) · Journal of the ACM · doi:10.1145/322326.322339 · Cited by 585
Self-citationAbstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
Uniform proofs as a foundation for logic programming
Miller, D., Nadathur, G., Pfenning, F., & Scedrov, A. (1991) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(91)90068-w · Cited by 571
On the Declarative Semantics of Deductive Databases and Logic Programs
Przymusinski, T. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50009-9 · Cited by 548
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
Logic programming and knowledge representation
Baral, C., & Gelfond, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90025-6 · Cited by 431
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
Cousot, P., & Cousot, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/3-540-55844-6_142 · Cited by 423
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
Logic programming and negation: A survey
Apt, K. R., & Bol, R. N. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90024-8 · Cited by 412
On indefinite databases and the closed world assumption
Minker, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0000066 · Cited by 381
OLD resolution with tabulation
Tamaki, H., & Sato, T. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16492-8_66 · Cited by 374
Implementation of logical query languages for databases
Ullman, J. D. (1985) · ACM Transactions on Database Systems · doi:10.1145/3979.3980 · Cited by 373
The alternating fixpoint of logic programs with negation
Van Gelder, A. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73722 · Cited by 369
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
Stephens, R. (1997) · Acta Informatica · doi:10.1007/s002360050095 · Cited by 322
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
Stable semantics for disjunctive programs
Przymusinski, T. C. (1991) · New Generation Computing · doi:10.1007/bf03037171 · Cited by 303
Pereira, F. C. N., & Warren, D. H. D. (1983) · Proceedings of the 21st annual meeting on Association for Computational Linguistics - · doi:10.3115/981311.981338 · Cited by 290
The early years of logic programming
Kowalski, R. A. (1988) · Communications of the ACM · doi:10.1145/35043.35046 · Cited by 176
Self-citationColmerauer, A., & Roussel, P. (1993) · The second ACM SIGPLAN conference on History of programming languages · doi:10.1145/154766.155362 · Cited by 108
Evans, R., Hernández-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103438 · Cited by 58
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
“Together with Maarten van Emden, he went on to define the modern semantics of Horn-clause programming (van Emden and Kowalski 1976).”
BackgroundProving termination properties of prolog programs: A semantic approach
Baudinet, M. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90045-5 · Cited by 35
Learning Relational Representations with Auto-encoding Logic Programs
Dumancic, S., Guns, T., Meert, W., & Blockeel, H. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/842 · Cited by 27
Autonomous Electric Vehicle Battery Disassembly Based on NeuroSymbolic Computing
Zhang, H., Yang, H., Wang, H., Wang, Z., Zhang, S., & Chen, M. (2023) · Lecture Notes in Networks and Systems · doi:10.1007/978-3-031-16078-3_30 · Cited by 23
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.