<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stephan Grimm</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Axel Polleres</style></author><author><style face="normal" font="default" size="100%">Terrance Swift</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Preferential Tableaux Calculus for Circumscriptive ALCO</style></title><secondary-title><style face="normal" font="default" size="100%">Web Reasoning and Rule Systems, Third International Conference, RR 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-05082-4_4</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Chantilly, VA, USA</style></pub-location><volume><style face="normal" font="default" size="100%">5837</style></volume><pages><style face="normal" font="default" size="100%">40–54</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>