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.
A uniform tableaux method for nonmonotonic modal logics / Donini, FRANCESCO MARIA; Massacci, Fabio; Nardi, Daniele; Rosati, Riccardo. - STAMPA. - 1126:(1996), pp. 87-103. (Intervento presentato al convegno European Workshop on Logics in Artificial Intelligence (JELIA 96) tenutosi a EVORA, PORTUGAL nel SEP 30-OCT 03, 1996) [10.1007/3-540-61630-6_6].
A uniform tableaux method for nonmonotonic modal logics
DONINI, FRANCESCO MARIA;MASSACCI, Fabio;NARDI, Daniele;ROSATI, Riccardo
1996
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
