The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On indefinite databases and the closed world assumption
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
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
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
McDermott, D., & Doyle, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90012-0 · Cited by 904
Automated Theorem Proving: A Logical Basis
Loveland, D. W. (1978) · Medical Entomology and Zoology · Cited by 667
Gallaire, H., & Minker, J. (1978) · Medical Entomology and Zoology · Cited by 559
Self-citationProlegomena to a theory of mechanized formal reasoning
Weyhrauch, R. W. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90015-6 · Cited by 429
Hewitt, C. E. (1972) · Defense Technical Information Center (DTIC) · Cited by 316
Linear Resolution with Selection Function
Kowalski, R., & Kuehner, D. (1983) · Automation of Reasoning · doi:10.1007/978-3-642-81955-1_32 · Cited by 316
Linear resolution with selection function
Kowalski, R., & Kuehner, D. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90012-9 · Cited by 259
Mechanical Theorem-Proving by Model Elimination
Loveland, D. W. (1968) · Journal of the ACM · doi:10.1145/321450.321456 · Cited by 193
Deductive Question-Answering on Relational Data Bases
Reiter, R. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_6 · Cited by 161
Kowalski, R. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_4 · Cited by 122
Two Results on Ordering for Resolution with Merging and Linear Format
Reiter, R. (1971) · Journal of the ACM · doi:10.1145/321662.321678 · Cited by 60
Addendum: Circumscription and other non-monotonic formalisms
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90016-8 · Cited by 42
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
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
Self-citationOn the Declarative Semantics of Deductive Databases and Logic Programs
Przymusinski, T. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50009-9 · Cited by 548
Metadata
- Authors
- Minker, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer-Verlag
- Published
- 2005-10-05
- Pages
- 292-308
- OpenAlex
- W1524811847
- Cited by
- 381
- References
- 17
- FWCI
- 10.02
- Type
- conference paper
- 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
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.
