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


Access Document


Files:

Authors


Publisher:
Springer
Host title:
In Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010)
Publication date:
2010-01-01
UUID:
uuid:382bd7c6-8940-4b7c-a1ff-8f9385a62fe7
Local pid:
cs:3635
Deposit date:
2015-03-31

Terms of use


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