2011/12/16 by Dario Campagna, Campagna, Dario, Beata Sarna-Starosta +3
Computer Science · #Constraint Satisfaction and Optimization #D.1.6 #D.3 #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.PL
paper · pdf · doi:10.48550/arxiv.1112.3787
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011), Lexington, KY, U.S.A., July 10, 2011
arxiv created 2011/12/16 · openalex publication_date 2011/12/16 · arxiv updated 2011/12/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.