1285 search results - page 55 / 257 » Description Logic Reasoner: System Description |
104
click to vote
DLOG
2008
15 years 3 months ago
2008
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
121
click to vote
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...
121
click to vote
DLOG
2006
15 years 2 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
103
Voted
AUSAI
1999
Springer
15 years 5 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
126
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...