Automatic Generation of CHR Constraint Solvers

TL;DR

This paper introduces a framework that automatically generates CHR constraint solvers from logical specifications, leveraging tabled resolution to produce expressive, recursive, and splitting rules suitable for direct use as solvers.

Contribution

It presents a novel approach that enables automatic generation of more expressive CHR rules, including recursive and splitting rules, from logical constraint specifications.

Findings

Allows automatic generation of expressive CHR solvers

Utilizes tabled resolution to verify rule validity

Produces rules suitable for direct implementation as solvers

Abstract

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.