The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Making prolog more expressive
Open accessAbstract
Abstract This paper introduces extended programs and extended goals for logic programming. A clause in an extended program can have an arbitrary first-order formula as its body. Similarly, an extended goal can have an arbitrary first-order formula as its body. The main results of the paper are the soundness of the negation as failure rule and SLDNF-resolution for extended programs and goals. We show how the increased expressibility of extended programs and goals can be easily implemented in any PROLOG system which has a sound implementation of the negation as failure rule. We also show how these ideas can be used to implement first-order logic as a query language in a deductive database system. An application to integrity constraints in deductive database systems is also given.
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
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Self-citationA Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Proving termination with multiset orderings
Dershowitz, N., & Manna, Z. (1979) · Communications of the ACM · doi:10.1145/359138.359142 · Cited by 562
Micro-Prolog: Programming in Logic
Clark, K., & McCabe, F. G. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 135
Topor, R. W., Keddis, T., & Wright, D. (1985) · Australian Computer Journal · Cited by 16
Self-citation
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
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
The British Nationality Act as a logic program
Sergot, M. J., Sadri, F., Kowalski, R. A., Kriwaczek, F., Hammond, P., & Cory, H. T. (1986) · Communications of the ACM · doi:10.1145/5689.5920 · Cited by 564
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
Integrity constraint checking in stratified databases
Lloyd, J. W., Sonenberg, E. A., & Topor, R. W. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90009-4 · Cited by 116
Self-citation
Metadata
- Authors
- Lloyd, J. W., & Topor, R. W.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1984-10
- Volume
- 1
- Issue
- 3
- Pages
- 225-240
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W1985819576
- Cited by
- 310
- References
- 7
- FWCI
- 13.45
- 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: Making prolog more expressive. https://app.cochat.ai/papers/10.1016/0743-1066(84)90011-6
- The paper
- Lloyd, J. W., & Topor, R. W. (1984). Making prolog more expressive. The Journal of Logic Programming. https://doi.org/10.1016/0743-1066(84)90011-6
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.