367 search results - page 12 / 74 » A Rewriting Logic Sampler |
DLOG
2003
13 years 9 months 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...
AAAI
2006
13 years 9 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
DLOG
2010
13 years 6 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 . ...
ENTCS
2007
13 years 8 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...