Abstract
We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.
Lingua originale | Inglese |
---|---|
Numero di articolo | 21 |
Rivista | ACM Transactions on Computational Logic |
Volume | 10 |
Numero di pubblicazione | 3 |
DOI | |
Stato di pubblicazione | Pubblicato - 1 apr 2009 |