DLOG
2003
14 years 28 days ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
DLOG
2003
14 years 28 days ago
2003
This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are difficult to optimize be...
DLOG
2003
14 years 28 days ago
2003
DLOG
2003
14 years 28 days ago
2003
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics a...
DLOG
2003
14 years 28 days ago
2003
Ontologies are more than an elaborate approach to the definition and classification of information. They play a vital role in various web-oriented applications that makes a corr...
DLOG
2003
14 years 28 days ago
2003
This chapter covers extensions of the basic description logics introduced in Chapter 2 by very expressive constructs that require advanced reasoning techniques. In particular, we ...
DLOG
2003
14 years 28 days ago
2003
The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook. More information and explanations...
DLOG
2003
14 years 28 days ago
2003
In a previous paper we have investigated subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, an...
DLOG
2003
14 years 28 days ago
2003
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
DLOG
2003
14 years 28 days ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...