Complexity of unification problems with associative-commutative operators
Journal of Automated Reasoning
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Unification of concept terms in description logics
Journal of Symbolic Computation
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Unification in the Description Logic $\mathcal{EL}$
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
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
Unification in the description logic EL without the top concept
CADE'11 Proceedings of the 23rd international conference on Automated deduction
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
| Hi-index | 0.00 |
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have shown that unification in EL is NP-complete, and thus of a complexity that is considerably lower than in other Description Logics of comparably restricted expressive power. In this paper, we introduce a new NP-algorithm for solving unification problems in EL, which is based on a reduction to satisfiability in propositional logic (SAT). The advantage of this new algorithm is, on the one hand, that it allows us to employ highly optimized state-of-the-art SAT solvers when implementing an EL-unification algorithm. On the other hand, this reduction provides us with a proof of the fact that EL-unification is in NP that is much simpler than the one given in our previous paper on EL-unification.