A Transformational Approach for Proving Properties of the CHR Constraint Store

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

• Type: Conference
• Year: 2009
• Where: LOPSTR
• Authors: Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
• Keywords: Artificial Intelligence, CHR Constraint Store, Constraint Handling Rules, LOPSTR 2009, Programs Requires Information