In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Abstract. Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and r...
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
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...
The problem of inconsistency handling in ontologies has recently been attracting a lot of attention. When inconsistency occurs in an ontology, there are mainly two ways to deal wit...