{"type":"ScholarlyArticle","title":"Reasoning under inconsistency: the forgotten connective","authors":[{"name":"Sébastien Konieczny","slug":"sebastien-konieczny","given":"Sébastien","family":"Konieczny","affiliation":""},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":""}],"abstract":"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/80","pdf":"https://ijcai.org/proceedings/2005/0080.pdf","markdown":"https://ijcai.org/proceedings/2005/80.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/80","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":80,"pages":{"first":484,"last":488},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}