. Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)-order, or Datalog :;! Z , programs on generalized databases because they can express any Turingcomputable function [23]. This paper introduces a restriction of Datalog :;! Z that can express only computable queries. The restricted language has a high expressive power and a non-elementary data complexity. 1 Introduction Constraint logic programming [14, 15, 27, 12, 10, 9] has a great potential for being adapted for database use. A successful adaptation of constraint logic programming has to meet usual database requirements. In the constraint query languages framework...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
AbstractIn this paper we introduce a generalization of Datalog that operates on periodicity constrai...
We argue that database query languages can be used to spec-if’y constraint satisfaction problems. We...
: We provide a generalization of Datalog based on generalizing databases by adding integer order con...
In the database framework of Kanellakis et al. it was argued that constraint query languages should ...
AbstractWe provide a generalization of Datalog based on generalizing databases by adding integer ord...
AbstractWe investigate the relationship between programming with constraints and database query lang...
Motivated by applications in declarative data analysis, we study DatalogZ-an extension of Datalog wi...
We investigate the relationship between programming with constraints and database query languages. W...
AbstractWe present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show t...
The development of deductive databases was aimed at providing a declarative, potentially complete qu...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
. Constraint databases generalize relational databases by finitely representable infinite relations....
-Recently in the database field, deductive databases and object oriented databases are two major are...
LP is a common formalism for the field of databases and CSP, both at the theoretical level and the i...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
AbstractIn this paper we introduce a generalization of Datalog that operates on periodicity constrai...
We argue that database query languages can be used to spec-if’y constraint satisfaction problems. We...
: We provide a generalization of Datalog based on generalizing databases by adding integer order con...
In the database framework of Kanellakis et al. it was argued that constraint query languages should ...
AbstractWe provide a generalization of Datalog based on generalizing databases by adding integer ord...
AbstractWe investigate the relationship between programming with constraints and database query lang...
Motivated by applications in declarative data analysis, we study DatalogZ-an extension of Datalog wi...
We investigate the relationship between programming with constraints and database query languages. W...
AbstractWe present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show t...
The development of deductive databases was aimed at providing a declarative, potentially complete qu...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
. Constraint databases generalize relational databases by finitely representable infinite relations....
-Recently in the database field, deductive databases and object oriented databases are two major are...
LP is a common formalism for the field of databases and CSP, both at the theoretical level and the i...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
AbstractIn this paper we introduce a generalization of Datalog that operates on periodicity constrai...
We argue that database query languages can be used to spec-if’y constraint satisfaction problems. We...