The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
On the Declarative Semantics of Deductive Databases and Logic Programs
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
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
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
Applications of circumscription to formalizing common-sense knowledge
McCarthy, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90032-9 · Cited by 1,114
Reiter, R. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_3 · Cited by 990
Foundations of Deductive Databases and Logic Programming
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07699-2 · Cited by 974
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
Towards a Logical Reconstruction of Relational Database Theory
Reiter, R. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_8 · Cited by 585
Proving termination with multiset orderings
Dershowitz, N., & Manna, Z. (1979) · Communications of the ACM · doi:10.1145/359138.359142 · Cited by 562
On Indefinite Data Bases and the Closed World Assumption
Minker, J. (1982) · Medical Entomology and Zoology · Cited by 406
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
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
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
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
- Przymusinski, T. C.
- Venue
- Foundations of Deductive Databases and Logic Programming
- Publisher
- Elsevier
- Published
- 1988
- Pages
- 193-216
- OpenAlex
- W1494051470
- Cited by
- 548
- References
- 20
- FWCI
- 27.90
- Type
- book chapter
- Language
- en
- Open access
- closed
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: On the Declarative Semantics of Deductive Databases and Logic Programs. https://app.cochat.ai/papers/10.1016/b978-0-934613-40-8.50009-9
- The paper
- Przymusinski, T. C. (1988). On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. https://doi.org/10.1016/b978-0-934613-40-8.50009-9
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.
