Update sequences based on minimal generalized pstable models
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Pstable semantics for possibilistic logic programs
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
A possibilistic intuitionistic logic
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
| Hi-index | 0.00 |
We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known F O U R bilattice. We will call this semantic GNM-S5 as a reminder of its origin in the logic S5. Finally we show that, for normal programs, our approach is closely related to theWell-Founded-by-Cases Semantics introduced by Schlipf and the WFS+ proposed by Dix. We prove that GNM-S5 has the properties of classicality and extended cut. While WFS+ also supports classicality it fails to satisfy the extended cut principle, an important property available in other semantics such as stable models. Hence, we claim that GNM-S5 is a good candidate for defining a nonmonotonic semantics closer to the direction of classical logic.