Article thumbnail

A transformational approach for proving properties of the CHR constraint store

By Paolo Pilozzi, Tom Schrijvers and Maurice Bruynooghe


Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR constraint store. In contrast to Logic Programming (LP), there are not many tools available for deriving such information for CHR. Hence, instead of building analyses for CHR from scratch, we define a transformation from CHR to Prolog and reuse existing analysis tools for Prolog. The proposed transformation has been implemented and combined with PolyTypes 1.3, a type analyser for Prolog, resulting in an accurate description of the types of CHR programs. Moreover, the transformation is not limited to type analysis. It can also be used to prove other properties of the constraints showing up in constraint stores, using tools for Prolog.status: publishe

Topics: Constraint handling rules, Program transformation, Logic programming, Program analysis
Publisher: Springer
Year: 2010
DOI identifier: 10.1007/978-3-642-12592-8_3
OAI identifier:
Provided by: Lirias

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.