The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Horn clause queries and generalizations
Open accessOverview
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
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
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
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
Relational queries computable in polynomial time
Immerman, N. (1986) · Information and Control · doi:10.1016/s0019-9958(86)80029-8 · Cited by 643
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
Structure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
Self-citationElementary Induction on Abstract Structures
(1974) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)x7092-2 · Cited by 492
Coelho, H., Cotta, J. C., & Pereira, L. M. (1982) · Medical Entomology and Zoology · Cited by 29
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
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
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
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
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
Metadata
- Authors
- Chandra, A. K., & Harel, D.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1985-04
- Volume
- 2
- Issue
- 1
- Pages
- 1-15
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W1998162300
- Cited by
- 309
- References
- 9
- FWCI
- 17.91
- 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: Horn clause queries and generalizations. https://app.cochat.ai/papers/10.1016/0743-1066(85)90002-0
- The paper
- Chandra, A. K., & Harel, D. (1985). Horn clause queries and generalizations. The Journal of Logic Programming. https://doi.org/10.1016/0743-1066(85)90002-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.