Unification in commutative theories
Journal of Symbolic Computation
Unification of concept terms in description logics
Journal of Symbolic Computation
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Undecidability of the unification and admissibility problems for modal and description logics
ACM Transactions on Computational Logic (TOCL)
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
Non-standard inferences in description logics
Non-standard inferences in description logics
SAT encoding of unification in EL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Unification in the description logic EL without the top concept
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Using ontology databases for scalable query answering, inconsistency detection, and data integration
Journal of Intelligent Information Systems
Decidability of unification in EL without top constructor
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
SAT encoding of unification in ELHR+ w.r.t. cycle-restricted ontologies
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
UEL: unification solver for the description logic EL - system description
IJCAR'12 Proceedings of the 6th international joint conference on Automated 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
The logical diversity of explanations in OWL ontologies
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
The Description Logic $\mathcal{EL}$ has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, $\mathcal{EL}$ is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. The main result of this paper is that unification in $\mathcal{EL}$ is decidable. More precisely, $\mathcal{EL}$-unification is NP-complete, and thus has the same complexity as $\mathcal{EL}$-matching. We also show that, w.r.t. the unification type, $\mathcal{EL}$ is less well-behaved: it is of type zero, which in particular implies that there are unification problems that have no finite complete set of unifiers.