Tractable Extensions of the Description Logic EL with Numerical Datatypes.
We consider extensions of the lightweight description logic (DL) EL with numerical datatypes such as naturals, integers, rationals and reals equipped with relations such as equality and inequalities. It is well-known that the main reasoning problems for such DLs are decidable in polynomial time provided that the datatypes enjoy the so-called convexity property. Unfortunately many combinations of the numerical relations violate convexity, which makes the usage of these datatypes rather limited...Expand abstract
- Journal of Automated Reasoning
- Publication date:
- Local pid:
- Copyright date: