LP is a common formalism for the field of databases and CSP, both at the theoretical level and the implementation level in the form of Datalog and CLP. In the past, close correspondences have been made between both fields at the theoretical level. Yet correspondence at the implementation level has been much less explored. In this article we work towards relating them at the implementation level. Concretely, we show how to derive the efficient Leapfrog Triejoin execution algorithm of Datalog from a generic CP execution scheme.status: publishe
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
Supporting aggregates in recursive logic rules represents a very important problem for Datalog. To s...
We extend Datalog, a logic programming language for rule-based systems, by respectively integrating ...
Abstract. LP is a common formalism for the field of databases and CSP, both at the theoretical level...
This paper introduces an alternative operational model for constraint logic programs. First, a trans...
We present a technique exploiting Datalog with aggregates to improve the performance of programs wi...
Abstract. Datalog systems evaluate joins over arithmetic (in)equalities as a naive generate-and-test...
The increasing available parallelism of computers demands new programming languages that make parall...
This article gives an overview of my research activities since October 2012. It discusses various ar...
Datalog systems evaluate joins over arithmetic (in)equalities as a naive generate-and-test of Cartes...
Abstract. We present a technique exploiting Datalog with aggregates to improve the performance of pr...
. Guaranteeing termination of programs on all valid inputs is important for database applications. T...
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guara...
The optimized compilation of Constraint Logic Programming (CLP) languages can give rise to impressiv...
This paper describes a method for transforming any given set of Datalog rules into an e#cient specia...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
Supporting aggregates in recursive logic rules represents a very important problem for Datalog. To s...
We extend Datalog, a logic programming language for rule-based systems, by respectively integrating ...
Abstract. LP is a common formalism for the field of databases and CSP, both at the theoretical level...
This paper introduces an alternative operational model for constraint logic programs. First, a trans...
We present a technique exploiting Datalog with aggregates to improve the performance of programs wi...
Abstract. Datalog systems evaluate joins over arithmetic (in)equalities as a naive generate-and-test...
The increasing available parallelism of computers demands new programming languages that make parall...
This article gives an overview of my research activities since October 2012. It discusses various ar...
Datalog systems evaluate joins over arithmetic (in)equalities as a naive generate-and-test of Cartes...
Abstract. We present a technique exploiting Datalog with aggregates to improve the performance of pr...
. Guaranteeing termination of programs on all valid inputs is important for database applications. T...
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guara...
The optimized compilation of Constraint Logic Programming (CLP) languages can give rise to impressiv...
This paper describes a method for transforming any given set of Datalog rules into an e#cient specia...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
Supporting aggregates in recursive logic rules represents a very important problem for Datalog. To s...
We extend Datalog, a logic programming language for rule-based systems, by respectively integrating ...