Results 1  10
of
2,380
Linearizability on Datalog Programs
"... We study the problem of transforming database queries into a special class of database logic programs (Datalog programs), namely linear Datalog programs, whose clauses have at most one intentional atom in their bodies. In particular we investigate linearisability of (database queries corresponding t ..."
Abstract
 Add to MetaCart
We study the problem of transforming database queries into a special class of database logic programs (Datalog programs), namely linear Datalog programs, whose clauses have at most one intentional atom in their bodies. In particular we investigate linearisability of (database queries corresponding
Linearisability on Datalog Programs?
"... Linear Datalog programs are programs whose clauses haveatmostoneintensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically nonlinear) which turn out to express no more than the queries expressed by linear Datalog programs. In particular, we investigate lineari ..."
Abstract
 Add to MetaCart
Linear Datalog programs are programs whose clauses haveatmostoneintensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically nonlinear) which turn out to express no more than the queries expressed by linear Datalog programs. In particular, we investigate
On the equivalence of recursive and nonrecursive Datalog programs
 In Proc. of the 11th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS’92
, 1992
"... vardi Abstract: 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 equivalent to unions of conjunctive queries, we study also the problem of determining whether a given recursiv ..."
Abstract

Cited by 81 (5 self)
 Add to MetaCart
vardi Abstract: 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 equivalent to unions of conjunctive queries, we study also the problem of determining whether a given
Refinement of Datalog Programs
, 1996
"... . Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalogprogramsand demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality). Such oper ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
. Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalogprogramsand demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality
Datalog Programs and Their Stable Models
"... Abstract. This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach
Undecidable Boundedness Problems for Datalog Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1995
"... A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was first demonstrated by Gaifman et al. We introduce new techniques for p ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was first demonstrated by Gaifman et al. We introduce new techniques
Reducing SHIQ − Description Logic to Disjunctive Datalog Programs
, 2004
"... As applications of description logics proliferate, efficient reasoning with large ABoxes (sets of individuals with descriptions) becomes ever more important. Motivated by the prospects of reusing optimization techniques from deductive databases, in this paper, we present a novel approach to checking ..."
Abstract

Cited by 143 (20 self)
 Add to MetaCart
resolutionbased decision procedure, and (iii) the saturated set of clauses is translated into a disjunctive datalog program. Thus, query answering can be performed using the resulting program, while applying all existing optimization techniques, such as joinorder optimizations or magic sets. Equally
OPTIMIZING DATALOG PROGRAMS (Extended Abstract)
"... Dstalog programs, 1 e, Prolog programs without function symbols, are considered It 1s assumed that a varrable appearing in the head of a rule must also appear m the body of the rule The input of a program 1s a set of ground atoms (which are given m addition to the program’s rules) and, therefore, ca ..."
Abstract
 Add to MetaCart
cqulvalent if they produce the \run( ~ rc+ult for all possible assignments of nntlcll rclatlons to all the predicates (1 e, both extensional and mtentlonal) The eqmvalence problem for Datalog programs 1s known to be undecidable It 1s shown that uniform equivalence IS decidable, and an slgorlthm 1s given
Rewriting ontological queries into small nonrecursive datalog programs
"... 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 evaluated against D modulo a Tbox Σ formulated in DLLite or Linear Datalog ±. It is wellknown that (Σ, q) can be rewritten into an ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
into an equivalent nonrecursive Datalog program P that can be directly evaluated over D. However, for Linear Datalog ± or for DLLite versions that allow for role inclusion, the rewriting methods described so far result in a nonrecursive Datalog program P of size exponential in the joint size of Σ and q. This gives
Testing Strong Equivalence of Datalog Programs Implementation and Examples
"... In this work strong equivalence of disjunctive first order datalog programs under the stable model semantic is considered. The problem is reduced to the unsatisfiability problem of BernaysSchönfinkel formulas. An implementation is ..."
Abstract
 Add to MetaCart
In this work strong equivalence of disjunctive first order datalog programs under the stable model semantic is considered. The problem is reduced to the unsatisfiability problem of BernaysSchönfinkel formulas. An implementation is
Results 1  10
of
2,380