11740 search results - page 32 / 2348 » More Problems in Rewriting |
ICDT
2005
ACM
14 years 2 months ago
2005
ACM
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
AMW
2010
13 years 10 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
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 . ...
DLOG
2008
13 years 11 months ago
2008
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
PVLDB
2008
13 years 7 months ago
2008
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...