Hostname: page-component-7dd5485656-7jgsp Total loading time: 0 Render date: 2025-10-30T12:59:57.141Z Has data issue: false hasContentIssue false
  • English
  • Français

Automatic generation of CHR constraint solvers

Published online by Cambridge University Press:  01 July 2005

SLIM ABDENNADHER  and
CHRISTOPHE RIGOTTI
SLIM ABDENNADHER
Affiliation:
Computer Science Department, German University in Cairo, Egypt (e-mail: slim.abdennadher@guc.edu.eg)
CHRISTOPHE RIGOTTI
Affiliation:
LIRIS Laboratory, INSA Lyon, France (e-mail: Christophe.Rigotti@insa-lyon.fr)
Get access Rights & Permissions [Opens in a new window]

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 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.

Keywords

Rule-based constraint solverautomatic solver generationtabled resolutionconstraint logic programming

Information

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 4-5 , July 2005 , pp. 403 - 418
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable