Unification in the Description Logic EL

Details Unification in the Description Logic EL Unification in the Description Logic EL

2010-06-11

arxiv.org/abs/1006.2289v2

LMCS 6 (3:17) 2010

Computer Science

Artificial Intelligence

31pages

Scientific paper

10.2168/LMCS-6(3:17)2010

The Description Logic 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, 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 EL is decidable. More precisely, EL-unification is NP-complete, and thus has the same complexity as EL-matching. We also show that, w.r.t. the unification type, 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.

Affiliated with

Also associated with

No associations

Rating

Unification in the Description Logic EL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unification in the Description Logic EL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unification in the Description Logic EL will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77531