Semi-automatic generation of CHR solvers from global constraint automata
Arbeitspapier
Authors
Raiser, Frank
Faculties
Fakultät für Ingenieurwissenschaften und InformatikUlm serial
Ulmer Informatik-Berichte
Abstract
Constraint programming often involves global constraints, which have been catalogued in [1] and for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the set of global constraints which can be defined by specific automata described in [2]. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.
Date created
2008
Original publication
Ulmer Informatik-Berichte, Nr. 2008-03, Februar 2008Subject Headings
CHR <Programmiersprache> [GND]Constraint-Programmierung [GND]
Constraint programming (Computer science) [LCSH]
Keywords
Constraints; Global constraintsDewey Decimal Group
DDC 004 / Data processing & computer scienceMetadata
Show full item recordCitation example
Raiser, Frank (2008): Semi-automatic generation of CHR solvers from global constraint automata. Open Access Repositorium der Universität Ulm. http://dx.doi.org/10.18725/OPARU-978