© Springer-Verlag Berlin Heidelberg 1996.We present a semantic tableaux calculus for propositional nonmonotonic modal logics, based on possible-worlds characterisations for nonmonotonic modal logics. This method is parametric with respect to both the modal logic and the preference semantics, since it handles in a uniform way the entailment problem for a wide class of nonmonotonic modal logics: McDermott and Doyle's logics and ground logics. It also achieves the computational complexity lower bounds.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Workshop||6th European Workshop on Logics in Artificial Intelligence, JELIA 1996|
|Period||30/09/96 → 3/10/96|