From ordering-based nonmonotonic reasoning to conditional logics
✍ Scribed by Luis Fariñas del Cerro; Andreas Herzig; Jérôme Lang
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 1001 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
✦ Synopsis
Farifias del Cerro, L., A. Herzig and J. Lang, From ordering-based nonmonotonic reasoning to conditional logics, Artificial Intelligence 66 (1994) 375-393.
As G~irdenfors and Makinson have recently shown, a nonmonotonic inference relation can be generated from a total pre-ordering on the set of formulas, or equivalently from an uncertainty valuation. We build here on these results; we include the pre-ordering in the language by introducing a conditional operator, and we extend the generation of a nonmonotonic inference relation by allowing the use of incompletely specified pre-orderings. This allows effective procedures for computing nonmonotonic inferences by translating nonmonotonic reasoning into deduction in a conditional logic.
📜 SIMILAR VOLUMES
Experience-based reasoning ~EBR! is a reasoning paradigm that has been used in almost every human activity such as business, military missions, and teaching activities since early human history. However, EBR has not been seriously studied from either a logical or mathematical viewpoint, although cas
The development of deontic logic has opened new possibilities for the mathematical analysis of norms. This article tackles the description of large families of deontic systems that attempt to formalize such-and-such idea of juridical notions like obligation. It also introduces a modal logic based on
## Abstract A back and forth condition on interpretations for those second‐order languages without functional variables whose non‐logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be eq
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form "φ → ψ", which informally read as "generally, if φ then ψ". Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for con