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...
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries ...
Sophisticated uncertainty representation and reasoning are necessary for the alignment and integration of Web data from different sources. For this purpose the extension of the Des...
Nikos Simou, Theofilos P. Mailis, Giorgos Stoilos,...
Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...