CoChat
Sign Up
Cited by 1,151Logic, Reasoning, and KnowledgeAdvanced Algebra and LogicLogic, programming, and type systems

Towards a Theory of Declarative Knowledge

Open access
Apt, Krzysztof R., Blair, Howard A., Walker, Adrian·1988·Foundations of Deductive Databases and Logic Programming
DOI 10.1016/b978-0-934613-40-8.50006-3
Open this paper in CoChat — free accountOpen PDF

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/b978-0-934613-40-8.50006-3

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Both standard SLDNF and stratified negation [34] would instead apply the closure uniformly at both levels.

    “Both standard SLDNF and stratified negation [34] would instead apply the closure uniformly at both levels.”

    From PrologMCP: A Standardized Prolog Tool Interface for LLM Agents (2026) · cites this paper as [34]

    The Stratified Programs section (page unavailable) says that relations in earlier strata have fixed meanings before later strata may negate them, supporting the citation’s identification of stratified negation. The passages do not establish that closure is applied uniformly at the citing sentence’s ‘both levels,’ or make that comparison for standard SLDNF. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 30

  1. Aquilano, C., Barbuti, R., Bocchetti, P., and Martelli, M. (1986] Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions, Journal of Automated Reasoning 2, 155-170.
  2. Apt, K. R. and Emden, M. H. van [1982] Contributions to the Theory of Logic Programming, JACM 29(3):841-862.
  3. Apt, K. R. and Pugin, J. M. [1987] Maintenance of Stratified Databases Viewed as a Belief Revision System, in Proc. of the 6th ACM Symposium on Principles of Database Systems, San Diego, CA, 136-145.
  4. Bidoit, N. and Hull, R. (1986] Positivism Versus Minimalism in Deductive Databases, Proc. of the 5th ACM S/GACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, MA, 123-132.
  5. Barbuti, R. and Martelli, M. (1986] Completeness of the SLDNF-Resolution for a Class of Logic Programs, Proc. of the 3rd International Conference on Logic Programming, Lecture Notes in Computer Science, No. 227, Springer-Verlag, Berlin, 600-613.
  6. Brough, D. and Walker, A. (1984] Some Practical Properties of Logic Program- ming Interpreters, Proc. of the Japan FGCS84 Conference, 149-156.
  7. Clark, K. L. [1978] Negation as Failure, in Logic and Databases (H. Gallaire and J. Mink:er, Eds.), Plenum Press, New York, 293-322.
  8. Chandra, A. and Harel, D. [1985] Horn Clause Queries and Generalizations, The Journal of Logic Programming 2(1):1-5.
  9. Emden, M. H. van [1986] Quantitative Deduction and Its Fixpoint Theory, Journal of Logic Programming 3(1):37-54.
  10. Emden, M. H. van and Kowalski, R. A. [1976] The Semantics of Predicate Logic as a Programming Language, JACM 23(4):733-742.
  11. Gabbay, D. [1985] Theoretical Foundations for Non-monotonic Reasoning in Ex- pert Systems, in Logics and Models of Concurrent Systems (K. R. Apt, Ed.), Springer-Verlag, 439-458.
  12. Gallier, J. and Raatz, S. [1988] A Graph-based Interpreter for General Hom Clauses, Journal of Logic Programming.
  13. Lifschitz, V. [1988] On the Declarative Semantics of Logic Programs with Nega- tion, in Foundations of Deductive Databases and logic Programming (J. Minker, Ed.), Morgan Kaufmann, Publishers, Los Altos, CA, 177-192.
  14. Lloyd, J. W. [1984] Foundations of logic Programming, Springer-Verlag.
  15. Lloyd, J. W. and Topor, R. W. [1985] A Basis for Deductive Database Systems II, Journal of Logic Programming, 3(1):55-67.
  16. McCarthy, J. (1980] Circumscription-A Form of Nonmonotonic Reasoning, Artificial Intelligence 13(1):295-323.
  17. Minker, J. [1982] On Indefinite Databases and the Closed World Assumption, Proc. of the 6th Conference on Automated Deduction (D. W. Loveland, Ed.), Lec- ture Notes in Computer Science 138, Springer-Verlag, Berlin, 292-308.
  18. Naqvi, S. A. [1986] A Logic for Negation in Database Systems, in Proc. of the Workshop on Foundations of Deductive Databases and logic Programming, Washington, DC, 378-387
  19. Proc. of the AAAl Workshop on Non-monotonic Reasoning (1984].
  20. Przymusinski, T. [ 1988) On the Semantics of Stratified Deductive Databases, in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 193-216.
  21. Reiter, R. (1978] On Closed World Data Bases, in Logic and Databases (H. Gal- laire and J. Minker, Eds.), Plenum Press, New York, 55-76.
  22. Rogers, H. Jr. (1967] Theory of Recursive Functions and Effective Computability, McGraw-Hill.
  23. Sebelik, J. and Stepanek, P. [1982] Hom Clause Programs for Recursive Func- tions, in logic Programming (K. Clark and S.-A. Tiirnlund, Eds.), Academic Press, 325-340.
  24. Shepherdson, J. C. [1984] Negation as Failure: A Comparison of Clark's Com- pleted Data Base and Reiter's Closed World Assumption, Journal of Logic Programming 1(1):51-81.
  25. Shepherdson, J. C. [1985] Negation as Failure II, Journal of Logic Programming 2(2): 185 -202.
  26. Shepherdson, J. C. [1988] Negation in Logic Programming, in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 19-88.
  27. Topor, R. and Sonenberg, E. A. [1988] On Domain Independent Databases, in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 217-240.
  28. Van Gelder, A. [1988] Negation as Failure Using Tight Derivations for General Logic Programs, in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 149-176.
  29. Walker, A. [1986a] Syllog: An Approach to Prolog for Non-programmers, in Logic Programming and Its Applications (M. VanCaneghem and D.H.D. Warren, Eds.), Ablex, 32-49.
  30. Walker, A. [1986b] A Knowledge Systems: Principles and Practice, IBM Journal Res. Develop 30(1):2-13.

Cited by

Sorted by citations

Authors
Apt, K. R., Blair, H. A., & Walker, A.
Affiliations
  • Centrum Wiskunde & Informatica (NL)
  • Syracuse University (US)
  • IBM Research - Thomas J. Watson Research Center (US)
ORCID
Apt, Krzysztof R.
Venue
Foundations of Deductive Databases and Logic Programming
Publisher
Elsevier
Published
1988
Pages
89-148
DOI
10.1016/b978-0-934613-40-8.50006-3
OpenAlex
W2111353076
Cited by
1,151
References
1
Citations by year
2026: 5 · 2025: 7 · 2024: 9 · 2023: 25 · 2022: 11 · 2021: 11 · 2020: 16 · 2019: 14 · 2018: 12 · 2017: 15 · 2016: 17 · 2015: 25 · 2014: 25 · 2013: 19 · 2012: 25
FWCI
71.10
Type
book chapter
Language
en
Open access
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Locations
  • Elsevier eBooks (publishedVersion)
  • Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands (submittedVersion)
  • Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
Keywords
declarative semantics, Standard Model, fixed point theory, consistency, model theory

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