13 search results - page 2 / 3 » On the Decidability of Containment of Recursive Datalog Quer... |
ICDT
1995
ACM
13 years 8 months 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...
SEMWEB
2009
Springer
13 years 11 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...
SEBD
2001
13 years 6 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
DBPL
2007
Springer
13 years 8 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
IDEAS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...