441 search results - page 26 / 89 » Automated Benchmarking of Description Logic Reasoners |
101
Voted
DLOG
2007
15 years 4 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...
131
Voted
RR
2010
Springer
15 years 9 days ago
2010
Springer
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...
DLOG
2003
15 years 3 months ago
2003
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 ...
120
click to vote
DLOG
2010
14 years 12 months ago
2010
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...
123
Voted
DLOG
2011
14 years 5 months ago
2011
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...