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 prov...
| Главные авторы: | , , |
|---|---|
| Формат: | Conference item |
| Опубликовано: |
Springer
2010
|