Thumbnail
Access Restriction
Open

Author Rigotti, Christophe
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Automatic Generation ♦ Chr Constraint Solver Slim Abdennadher ♦ Chr Solver ♦ Different Method ♦ Expressive Rule ♦ Previous Work ♦ Tabled Resolution ♦ Constraint Solver ♦ Constraint Logic Programming ♦ Logical Specification
Abstract accepted for publication 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 work (Apt and Monfroy 1999; Ringeissen and Monfroy 2000; Abdennadher and Rigotti 2000; Abdennadher and Rigotti 2001a), 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.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study