Explaining Subsumption in Description Logics
نویسندگان
چکیده
This paper explores the explanation of subsumption reasoning in Description Logics that are implemented using normalization methods, focusing on the perspective of knowledge en gineers. The notion of explanation is specified using a proof-theoretic framework for present ing the inferences supported in these systems. The problem of overly long explanations is ad dressed by decomposing them into smaller, in dependent steps, using the notions of "atomic description" and "atomic justification". Imple mentation aspects are explored by considering the design space and some desiderata for expla nation modules. This approach has been imple mented for the CLASSIC knowledge representa tion system.
منابع مشابه
Explaining ALC Subsumption
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities were not available for expressive DLs, whose reasoning is an un-natural refutation-based tableau. We offer a solution based on a sequent calculus that is closely related to the tableau implementation, exploiting its op...
متن کاملExplaining Subsumption by Optimal Interpolation
We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of their syntactic and semantic properties. More precisely, the set of explanations for a subsumption P N is the set of optimal interpolants for P and N . We provide definitions for optimal interpolation and an algorithm ...
متن کاملApproximate Subsumption for Complex Description Logics
We present a non-standard interpretation for concept expressions in ALCQ that defines approximate notions of subsumption based on approximating a subset of the concept and role names. We present the non-standard semantics, and the corresponding notion of approximate subsumption, discuss its formal properties and show that is can be computed by syntactic manipulations of concept expressions.
متن کاملSemantic Preferential Subsumption
We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for propositional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations
متن کاملComparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence between description logics and propositional modal logic most of these techniques carry over into propositional modal logic satisfiability checking. Some of the techniques are extremely effective on various test suite...
متن کامل