A Preferential Tableaux Calculus for Circumscriptive ALCO

TitleA Preferential Tableaux Calculus for Circumscriptive ALCO
Publication TypeConference Papers
Year of Publication2009
AuthorsGrimm, S, Hitzler, P
EditorPolleres, A, Swift, T
Conference NameWeb Reasoning and Rule Systems, Third International Conference, RR 2009
Volume5837
Pagination40–54
PublisherSpringer
Conference LocationChantilly, VA, USA
Abstract

Nonmonotonic extensions of description logics (DLs) allow for default and local closed-world reasoning and are an acknowledged desired feature for applications, e.g. in the Semantic Web. A recent approach to such an extension is based on McCarthy’s circumscription, which rests on the principle of minimising the extension of selected predicates to close off dedicated parts of a domain model. While decidability and complexity results have been established in the literature, no practical algorithmisation for circumscriptive DLs has been proposed so far. In this paper, we present a tableaux calculus that can be used as a decision procedure for concept satisfiability with respect to conceptcircumscribed ALCO knowledge bases. The calculus builds on existing tableaux for classical DLs, extended by the notion of a preference clash to detect the non-minimality of constructed models.

URLhttp://dx.doi.org/10.1007/978-3-642-05082-4_4
DOI10.1007/978-3-642-05082-4_4