Name
Title | ||
|---|---|---|
A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics |
Abstract | ||
|---|---|---|
Least Common Subsumers (LCS) have been pro- posed in Description Logics (DL) to capture the commonalities between two or more concepts. Since its introduction in 1992, LCS have been suc- cessfully employed as a logical tool for a variety of applications, spanning from inductive learning, to bottom-up construction of knowledge bases, infor- mation retrieval, to name a few. The best known algorithm for computing LCS uses structural com- parison on normal forms, and the most expressive DL it is applied to is ALEN . We provide a gen- eral 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. |
Year | Venue | Keywords |
|---|---|---|
2009 | IJCAI | general tableau-based calculus,tableaux-based method,concept variable,information retrieval,complexity issue,concept term,expressive description logic,common subsumers,inductive learning,expressive dl,full negation,description logics,normal form,description logic,bottom up,knowledge base |
Field | DocType | Citations |
Discrete mathematics,Negation,Computer science,Description logic,Theoretical computer science,Generality | Conference | 12 |
PageRank | References | Authors |
0.55 | 20 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesco M. Donini | 1 | 3481 | 452.47 |
| Simona Colucci | 2 | 1047 | 71.96 |
| Tommaso Di Noia | 3 | 1857 | 152.07 |
| Eugenio Di Sciascio | 4 | 1733 | 147.71 |