Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result
A given Datalog program is bounded if its depth of recursion is independent of the input database. D...
We study infinite but finitely representable databases based on constraints, motivated by new databa...
Given a recursive (datalog) query, the nonrecursive incremental evaluation approach uses nonrecursiv...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
AbstractA given Datalog program is bounded if its depth of recursion is independent of the input dat...
AbstractDatalog is a powerful query language for relational databases [10]. We consider the problems...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
The property of boundedness in Datalog formalizes whether a set of rules can be equivalently express...
AbstractIn this paper, we study the expressive power and the complexity of first-order logic with ar...
Bounded treewidth and monadic second-order (MSO) logic have proved to be key concepts in establishin...
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a dat...
A database query q is called additive if q(A U B) = q(A) U q(B) for domain-disjoint input databases ...
International audienceComputational and model-theoretic properties of logical languages constitute a...
A given Datalog program is bounded if its depth of recursion is independent of the input database. D...
We study infinite but finitely representable databases based on constraints, motivated by new databa...
Given a recursive (datalog) query, the nonrecursive incremental evaluation approach uses nonrecursiv...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
AbstractA given Datalog program is bounded if its depth of recursion is independent of the input dat...
AbstractDatalog is a powerful query language for relational databases [10]. We consider the problems...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
The property of boundedness in Datalog formalizes whether a set of rules can be equivalently express...
AbstractIn this paper, we study the expressive power and the complexity of first-order logic with ar...
Bounded treewidth and monadic second-order (MSO) logic have proved to be key concepts in establishin...
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a dat...
A database query q is called additive if q(A U B) = q(A) U q(B) for domain-disjoint input databases ...
International audienceComputational and model-theoretic properties of logical languages constitute a...
A given Datalog program is bounded if its depth of recursion is independent of the input database. D...
We study infinite but finitely representable databases based on constraints, motivated by new databa...
Given a recursive (datalog) query, the nonrecursive incremental evaluation approach uses nonrecursiv...
DOI
Add to ORKG