84 search results - page 4 / 17 » Decidable Containment of Recursive Queries |
PODS
1997
ACM
14 years 2 months 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...
SEMWEB
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
This paper considers a tree-rewriting framework for modeling documents evolving through service calls. We focus on the automatic verification of properties of documents that may c...
TLCA
1997
Springer
14 years 1 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
PODS
1992
ACM
14 years 1 months 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...