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...

ver descrição completa

Detalhes bibliográficos
Principais autores: Magka, D, Kazakov, Y, Horrocks, I
Formato: Conference item
Publicado em: Springer 2010

Registros relacionados