Approximating Constraint Propagation in Datalog

Autor:	Campagna, Dario, Sarna-Starosta, Beata, Schrijvers, Tom
Rok vydání:	2011
Předmět:	Computer Science - Programming Languages D.1.6 D.3
Druh dokumentu:	Working Paper
Popis:	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. Comment: Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011), Lexington, KY, U.S.A., July 10, 2011
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1112.3787 Zobrazit plný text záznamu View this record from Arxiv