Computer Science – Programming Languages
Scientific paper
2011-12-16
Computer Science
Programming Languages
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 201
Scientific paper
We present a technique exploiting Datalog with aggregates to improve the performance of programs with arithmetic (in)equalities. Our approach employs a source-to-source program transformation which approximates the propagation technique from Constraint Programming. The experimental evaluation of the approach shows good run time speed-ups on a range of non-recursive as well as recursive programs. Furthermore, our technique improves upon the previously reported in the literature constraint magic set transformation approach.
Campagna Dario
Sarna-Starosta Beata
Schrijvers Tom
No associations
LandOfFree
Approximating Constraint Propagation in Datalog does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximating Constraint Propagation in Datalog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Constraint Propagation in Datalog will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-136762