DLOG
2003
14 years 28 days ago
2003
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...
DLOG
2003
14 years 28 days ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
DLOG
2001
14 years 28 days ago
2001
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
DLOG
2001
14 years 28 days ago
2001
We combine the description logic ALC with the metric logics defined Entities that are conceived of as abstract points in the realm of ALC are given a spatial extension via an `ext...
DLOG
2001
14 years 28 days ago
2001
daml+oil is a new description logic developed for use within the DAML project and as a submission to the upcoming W3C semantic web ontology working group. It is closely based on t...
DLOG
2001
14 years 28 days ago
2001
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
DLOG
2001
14 years 28 days ago
2001
In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus i...
DLOG
2001
14 years 28 days ago
2001
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized ...
DLOG
2001
14 years 28 days ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
DLOG
2001
14 years 28 days ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...