TY - GEN
T1 - A nonmonotonic extension of KLM preferential logic P
AU - Giordano, Laura
AU - Gliozzi, Valentina
AU - Olivetti, Nicola
AU - Pozzato, Gian Luca
N1 - Funding Information:
Acknowledgements. The work has been supported by Project “MIUR PRIN08 LoDeN: Logiche Descrittive Nonmonotone: Complessità e implementazioni”.
PY - 2010
Y1 - 2010
N2 - In this paper, we propose the logic P min , which is a nonmonotonic extension of Preferential logic P defined by Kraus, Lehmann and Magidor (KLM). In order to perform nonmonotonic inferences, we define a "minimal model" semantics. Given a modal interpretation of a minimal A-world as A ∧ □¬A, the intuition is that preferred, or minimal models are those that minimize the number of worlds where ¬□¬A holds, that is of A-worlds which are not minimal. We also present a tableau calculus for deciding entailment in P min .
AB - In this paper, we propose the logic P min , which is a nonmonotonic extension of Preferential logic P defined by Kraus, Lehmann and Magidor (KLM). In order to perform nonmonotonic inferences, we define a "minimal model" semantics. Given a modal interpretation of a minimal A-world as A ∧ □¬A, the intuition is that preferred, or minimal models are those that minimize the number of worlds where ¬□¬A holds, that is of A-worlds which are not minimal. We also present a tableau calculus for deciding entailment in P min .
UR - http://www.scopus.com/inward/record.url?scp=85037526385&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-16242-8_23
DO - 10.1007/978-3-642-16242-8_23
M3 - Conference contribution
AN - SCOPUS:85037526385
SN - 364216241X
SN - 9783642162411
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 317
EP - 332
BT - Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Proceedings
PB - Springer Verlag
ER -