The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Negation in logic programming
Open accessAbstract
Abstract We define a semantics for negation as failure in logic programming. Our semantics may be viewed as a cross between the approaches of Clark [5] and Fitting [7]. As does [7], our semantics corresponds well with real PROLOG in the standard examples used in the literature to illustrate problems with [5]. Also, PROLOG and the common variants of it are sound but not complete for our semantics. Unlike [7], our semantics is constructive, in that the set of supported queries is recursively enumerable. Thus, a complete interpreter exists in theory, although we point out that there are serious difficulties in building one that works well in practice.
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
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Reiter, R. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_3 · Cited by 990
On Notation for Ordinal Numbers
Kleene, S. C. (1938) · Journal of Symbolic Logic · doi:10.2307/2267778 · Cited by 758
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 600
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
A kripke-kleene semantics for logic programs*
Fitting, M. (1985) · The Journal of Logic Programming · doi:10.1016/s0743-1066(85)80005-4 · Cited by 534
Lloyd, J. W., & Topor, R. W. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90011-6 · Cited by 310
Shepherdson, J. C. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90023-2 · Cited by 127
Shepherdson, J. C. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90018-4 · Cited by 78
Cited by
Dung, P. M. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00041-x · Cited by 4,270
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
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
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
Metadata
- Authors
- Kunen, K.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1987-12
- Volume
- 4
- Issue
- 4
- Pages
- 289-308
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2010104109
- Cited by
- 439
- References
- 11
- FWCI
- 14.22
- 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: Negation in logic programming. https://app.cochat.ai/papers/10.1016/0743-1066(87)90007-0
- The paper
- Kunen, K. (1987). Negation in logic programming. The Journal of Logic Programming. https://doi.org/10.1016/0743-1066(87)90007-0
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.