Conference item icon

Conference item

Tractable Extensions of the Description Logic EL with Numerical Datatypes

Abstract:

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

Actions


Authors


URN:
uuid:0aa522bb-c9c2-42df-8770-09701ceee8b0
Local pid:
cs:3607

Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP