Automatic Generation of CHR Constraint Solvers

Simple item page
dc.creatorAbdennadher, Slim
dc.creatorRigotti, Christophe
dc.date2004-09-14
dc.date.accessioned2026-07-07T03:21:47Z
dc.date.available2026-07-07T03:21:47Z
dc.descriptionIn 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.
dc.descriptionto be published in Theory and Practice of Logic Programming, 16 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0409030
dc.identifierhttp://arxiv.org/abs/cs/0409030
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32335
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.3.2; I.2.2
dc.titleAutomatic Generation of CHR Constraint Solvers
dc.typetext

Files

Collections

arXiv