34 search results - page 1 / 7 » Optimal Rewritings in Definitorially Complete Description Lo... |
82
Voted
DLOG
2010
14 years 8 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
88
Voted
DLOG
2003
15 years 7 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...
86
Voted
CADE
2001
Springer
15 years 11 months ago
2001
Springer
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 s...
84
Voted
ICLP
1997
Springer
15 years 3 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
DLOG
2001
15 years 7 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 ...