Abstract
We present tableau calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for preferential and cumulative logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish their complexity.
Lingua originale | Inglese |
---|---|
pagine (da-a) | 666-681 |
Numero di pagine | 16 |
Rivista | Lecture Notes in Computer Science |
Volume | 3835 LNAI |
DOI | |
Stato di pubblicazione | Pubblicato - 2005 |
Evento | 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2005 - Montego Bay, Jamaica Durata: 2 dic 2005 → 6 dic 2005 |