Advertisement
Published in:
2008 | OriginalPaper | Chapter
Recovering Consistency by Forgetting Inconsistency
Authors : Sylvie Coste-Marquis, Pierre Marquis
Published in: Logics in Artificial Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper, we introduce and study a new paraconsistent inference relation ⊧
c
in the setting of 3-valued paraconsistent logics. Using inconsistency forgetting as a key mechanism for recovering consistency, it guarantees that the deductive closure
$Cn_{\models_c}(\Sigma)$
of any belief base
Σ
is classically consistent and classically closed. This strong feature, not shared by previous inference relations in the same setting, allows to interpret an inconsistent belief base as a set of classical worlds (hence to reason classically from them).