Unification of concept terms in description logics
Journal of Symbolic Computation
Proof-Theoretic Approach to Description-Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
General E-unification with Eager Variable Elimination and a Nice Cycle Rule
Journal of Automated Reasoning
Undecidability of the unification and admissibility problems for modal and description logics
ACM Transactions on Computational Logic (TOCL)
Unification in the Description Logic $\mathcal{EL}$
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SAT encoding of unification in EL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Subsumption in w.r.t. hybrid TBoxes
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
SAT encoding of unification in ELHR+ w.r.t. cycle-restricted ontologies
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL $\mathcal{EL}$, which is used to define several large biomedical ontologies, unification is NP-complete. A goal-oriented NP unification algorithm for $\mathcal{EL}$ that uses nondeterministic rules to transform a given unification problem into solved form has recently been presented. In this paper, we extend this goal-oriented algorithm in two directions: on the one hand, we add general concept inclusion axioms (GCIs), and on the other hand, we add role hierarchies ($\mathcal{H}$) and transitive roles (R+). For the algorithm to be complete, however, the ontology consisting of the GCIs and role axioms needs to satisfy a certain cycle restriction.