%0 Conference Paper %B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %D 2009 %T A Preferential Tableaux Calculus for Circumscriptive ALCO %A Stephan Grimm %A Pascal Hitzler %E Axel Polleres %E Terrance Swift %X

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.

%B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %I Springer %C Chantilly, VA, USA %V 5837 %P 40–54 %G eng %U http://dx.doi.org/10.1007/978-3-642-05082-4_4 %R 10.1007/978-3-642-05082-4_4