Reasoning under inconsistency: The forgotten connective


Conference Paper

In many frameworks for reasoning under inconsistency, it is implicitly assumed that the formulae from the belief base are connected using a weak form of conjunction. When it is consistent, a belief base B = (θ1 , . . . , θn}, where the θi are propositional formulae, is logically equivalent to the base {θ1 ∧ . . . ∧ θn}. However, when it is not consistent, both bases typically lead to different conclusions. This illustrates the fact that the comma used in base B has to be considered as an additional, genuine connective, and not as a simple conjunction. In this work we define and investigate a propositional framework with such a "comma connective". We give it a semantics and show how it generalizes several approaches for reasoning from inconsistent beliefs.

Duke Authors

Cited Authors

  • Konieczny, S; Lang, J; Marquis, P

Published Date

  • December 1, 2005

Published In

Start / End Page

  • 484 - 489

International Standard Serial Number (ISSN)

  • 1045-0823

Citation Source

  • Scopus