Machine Learning - Special issue on COLT '94
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
An introduction to description logics
The description logic handbook
The description logic handbook
Explaining reasoning in description logics
Explaining reasoning in description logics
Computing least common subsumers in description logics with existential restrictions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Matching in hybrid terminologies
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A goal-oriented algorithm for unification in ELHR+ w.r.t. cycle-restricted ontologies
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In the area of Description Logic (DL) based knowledge representation, two desirable features of DL systems have as yet been incompatible: firstly, the support of general TBoxes containing general concept inclusion (GCI) axioms, and secondly, non-standard inference services facilitating knowledge engineering tasks, such as build-up and maintenance of terminologies (TBoxes). In order to make non-standard inferences available without sacrificing the convenience of GCIs, the present paper proposes hybrid TBoxes consisting of a pair of a general TBox $\mathcal{F}$ interpreted by descriptive semantics, and a (possibly) cyclic TBox $\mathcal{T}$ interpreted by fixpoint semantics. $\mathcal{F}$ serves as a foundation of $\mathcal{T}$ in the sense that the GCIs in $\mathcal{F}$ define relationships between concepts used as atomic concept names in the definitions in $\mathcal{T}$. Our main technical result is a polynomial time subsumption algorithm for hybrid $\mathcal{EL}$-TBoxes based on a polynomial reduction to subsumption w.r.t. cyclic $\mathcal{EL}$-TBoxes with fixpoint semantics. By virtue of this reduction, all non-standard inferences already available for cyclic $\mathcal{EL}$-TBoxes become available for hybrid ones.