Approximate Coherence-Based Reasoning - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Applied Non-Classical Logics Year : 2002

Approximate Coherence-Based Reasoning

Frédéric Koriche


It has long been recognized that the concept of inconsistency is a central part of com-monsense reasoning. In this issue, a number of authors have explored the idea of reasoning with maximal consistent subsets of an inconsistent stratified knowledge base. This paradigm, often called "coherent-based reasoning", has resulted in some interesting proposals for para-consistent reasoning, non-monotonic reasoning, and argumentation systems. Unfortunately, coherent-based reasoning is computationally very expensive. This paper harnesses the approach of approximate entailment by Schaerf and Cadoli [SCH 95] to develop the concept of "approximate coherent-based reasoning". To this end, we begin to present a multi-modal propo-sitional logic that incorporates two dual families of modalities: 2S and 3S defined for each subset S of the set of atomic propositions. The resource parameter S indicates what atoms are taken into account when evaluating formulas. Next, we define resource-bounded consolidation operations that limit and control the generation of maximal consistent subsets of a stratified knowledge base. Then, we present counterparts to existential, universal, and argumentative inference that are prominent in coherence-based approaches. By virtue of modalities 2S and 3S, these inferences are approximated from below and from above, in an incremental fashion. Based on these features, we show that an anytime view of coherent-based reasoning is tenable.
Fichier principal
Vignette du fichier
b73922c73dd6e4fc0f110ba7fcb70afc7582.pdf (153.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00268549 , version 1 (04-10-2019)



Frédéric Koriche. Approximate Coherence-Based Reasoning. Journal of Applied Non-Classical Logics, 2002, 12 (2), pp.239-258. ⟨10.3166/jancl.12.239-258⟩. ⟨lirmm-00268549⟩
78 View
110 Download



Gmail Facebook X LinkedIn More