Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts. Since its introduction in 1992, LCS have been successfully employed as a logical tool for a variety of applications, spanning from inductive learning, to bottom-up construction of knowledge bases, information retrieval, to name a few. The best known algorithm for computing LCS uses structural comparison on normal forms, and the most expressive DL it is applied to is ALEN. We provide a general tableau-based calculus for computing LCS, via substitutions on concept terms containing concept variables. We show the applicability of our method to an expressive DL (but without disjunction and full negation), discuss complexity issues, and show the generality of our proposal.
|Titolo:||A Tableaux-based method for computing least common subsumers for expressive description logics|
|Data di pubblicazione:||2009|
|Nome del convegno:||21st International Joint Conference on Artificial Intelligence, IJCAI-09|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|