Linear resolution with selection function
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
One reason for focusing on Horn theories, rather than full clausal theories, is SLD-resolution, an inference rule that sacrifices expressibility for efficiency.
“One reason for focusing on Horn theories, rather than full clausal theories, is SLD-resolution (Kowalski & Kuehner, 1971), an inference rule that sacrifices expressibility for efficiency.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Kowalski & Kuehner, 1971
The citation lists haven’t been fetched yet
References 16 · Cited by 259
- Authors
- Kowalski, R., & Kuehner, D.
- Affiliations
- University of Edinburgh (GB)
- ORCID
- Kowalski, Robert
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1971-12
- Volume
- 2
- Issue
- 3-4
- Pages
- 227-260
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W4229861117
- Cited by
- 259
- References
- 16
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 3 · 2023: 11 · 2022: 4 · 2021: 3 · 2020: 2 · 2019: 4 · 2018: 4 · 2017: 6 · 2016: 4 · 2015: 5 · 2014: 7 · 2013: 3 · 2012: 5
- FWCI
- 7.44
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Artificial Intelligence (publishedVersion)
- Funders
- Imperial College London
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Keywords
- linear resolution, selection function, model elimination, theorem proving, first-order logic, heuristic search, classification trees, subgoals, lemmas, refutation
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