9 search results - page 1 / 2 » On the Equivalence of Recursive and Nonrecursive Datalog Pro... |
PODS
1992
ACM
14 years 18 days ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
ICDT
1995
ACM
14 years 2 days ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
DLOG
2011
13 years 1 days ago
2011
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
PODS
1997
ACM
14 years 22 days ago
1997
ACM
We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Prev...