Approximating Constraint Propagation in Datalog

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-136762

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.