Document Type
Conference Proceeding
Publication Date
10-1-2009
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 concept circumscribed 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.
Repository Citation
Grimm, S.,
& Hitzler, P.
(2009). A Preferential Tableaux Calculus for Circumscriptive ALCO. Lecture Notes in Computer Science, 5837, 40-54.
https://corescholar.libraries.wright.edu/cse/91
DOI
10.1007/978-3-642-05082-4_4
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Presented at the Third International Conference on Web Reasoning and Rule Systems, Chantilly, VA, October 25-26, 2009.
Attached is the unpublished, authors' version of this proceeding. The final, publisher's version is available at http://dx.doi.org/10.1007/978-3-642-05082-4_4.