A Complete and Terminating Execution Model for Constraint Handling Rules

Details A Complete and Terminating Execution Model for Constraint Handling Rules A Complete and Terminating Execution Model for Constraint Handling Rules

2010-07-22

arxiv.org/abs/1007.3829v1

Theory and Practice of Logic Programming, Volume 10, Special Issue 4-6, July 2010, pp 597-610

Computer Science

Logic in Computer Science

15 pages

Scientific paper

10.1017/S147106841000030X

We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.

Affiliated with

Also associated with

No associations

Rating

A Complete and Terminating Execution Model for Constraint Handling Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Complete and Terminating Execution Model for Constraint Handling Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Complete and Terminating Execution Model for Constraint Handling Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611329