13 search results - page 2 / 3 » Complexity Boundaries for Horn Description Logics |
DLOG
2008
13 years 9 months ago
2008
Abstract. Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage th...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
KR
2010
Springer
14 years 4 days ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
RR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can ...
DLOG
2007
13 years 9 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...