13 search results - page 1 / 3 » Complexity Boundaries for Horn Description Logics |
AAAI
2007
13 years 7 months ago
2007
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
FUIN
2010
13 years 2 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
KR
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
ECAI
2010
Springer
13 years 3 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...