The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
What does a conditional knowledge base entail?
Abstract
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type if … then … , represents the explicit defeasible knowledge an agent has about the way the world generally behaves. We look for a plausible definition of the set of all conditional assertions entailed by a conditional knowledge base. In a previous paper, Kraus and the authors defined and studied preferential consequence relations. They noticed that not all preferential relations could be considered as reasonable inference procedures. This paper studies a more restricted class of consequence relations, rational relations. It is argued that any reasonable nonmonotonic inference procedure should define a rational relation. It is shown that the rational relations are exactly those that may be represented by a ranked preferential model, or by a (nonstandard) probabilistic model. The rational closure of a conditional knowledge base is defined and shown to provide an attractive answer to the question of the title. Global properties of this closure operation are proved: it is a cumulative operation. It is also computationally tractable. This paper assumes the underlying language is propositional.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Nonmonotonic reasoning, preferential models and cumulative logics
Kraus, S., Lehmann, D., & Magidor, M. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90101-5 · Cited by 1,660
Self-citationSemantical considerations on nonmonotonic logic
Moore, R. C. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90042-6 · Cited by 1,122
McDermott, D., & Doyle, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90012-0 · Cited by 904
General theory of cumulative inference
Makinson, D. (1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-50701-9_16 · Cited by 296
Foundations: Essays in philosophy, logic, mathematics, and economics
Ramsey, F. P., & Mellor, D. H. (1978) · Medical Entomology and Zoology · Cited by 285
Handbook of Philosophical Logic
(1983) · Springer eBooks · doi:10.1007/978-94-009-7066-3 · Cited by 268
Ifs. Conditionals, Belief, Decision, Chance, and Time
Harper, W., STALNAKER, R. C., & Pearce, G. (1981) · Medical Entomology and Zoology · Cited by 233
A semantic analysis of conditional logic1
STALNAKER, R. C., & THOMASON, R. H. (1970) · Theoria · doi:10.1111/j.1755-2567.1970.tb00408.x · Cited by 221
Ginsberg, M. L. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90067-6 · Cited by 218
I.—THE CONTRARY-TO-FACT CONDITIONAL1
CHISHOLM, R. M. (1946) · Mind · doi:10.1093/mind/lv.219.289 · Cited by 205
An approach to default reasoning based on a first-order conditional logic: Revised report
Delgrande, J. P. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90079-3 · Cited by 181
A first-order conditional logic for prototypical properties
Delgrande, J. P. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90053-1 · Cited by 180
An inquiry into computer understanding
Cheeseman, P. C. (1988) · Computational Intelligence · doi:10.1111/j.1467-8640.1988.tb00091.x · Cited by 163
Nonstandard Measure Theory and its Applications
Cutland, N. J. (1983) · Bulletin of the London Mathematical Society · doi:10.1112/blms/15.6.529 · Cited by 150
What does a conditional knowledge base entail?Preprint
Lehmann, D. J., & Magidor, M. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0202022 · Cited by 103
Self-citationImpediments to universal preference-based default theories
Doyle, J., & Wellman, M. P. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90007-7 · Cited by 89
A Sketch of Some Recent Developments in the Theory of Conditionals
Harper, W. (1980) · Springer eBooks · doi:10.1007/978-94-009-9117-0_1 · Cited by 51
Preferential logics: the predicate calculus case
Lehmann, D. J., & Magidor, M. (1990) · Theoretical Aspects of Rationality and Knowledge · Cited by 26
Self-citationIn defense of An inquiry into computer understanding
Cheeseman, P. (1988) · Computational Intelligence · doi:10.1111/j.1467-8640.1988.tb00115.x · Cited by 8
Cited by
ZCS: A Zeroth Level Classifier System
Wilson, S. W. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.1.1 · Cited by 505
Qualitative probabilities for default reasoning, belief revision, and causal modeling
Goldszmidt, M., & Pearl, J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00090-9 · Cited by 321
Dubois, D., Fargier, H., & Prade, H. (1996) · Applied Intelligence · doi:10.1007/bf00132735 · Cited by 287
Metadata
- Authors
- Lehmann, D., & Magidor, M.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1992-05
- Volume
- 55
- Issue
- 1
- Pages
- 1-60
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2167907160
- Cited by
- 829
- References
- 22
- FWCI
- 25.93
- Type
- journal article
- 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.