2004/09/14 by Slim Abdennadher, Abdennadher, Slim, Christophe Rigotti +1
Computer Science · #Advanced Database Systems and Queries #Constraint Satisfaction and Optimization #D.3.2 #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #I.2.2 #Logic in Computer Science (cs.LO) #Programming Languages (cs.PL) #cs.LO #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0409030
to be published in Theory and Practice of Logic Programming, 16 pages, 2 figures
arxiv created 2004/09/14 · openalex publication_date 2004/09/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous works where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.