Towards a Generic Trace for Rule Based Constraint Reasoning

Details Towards a Generic Trace for Rule Based Constraint Reasoning Towards a Generic Trace for Rule Based Constraint Reasoning

2012-04-24

arxiv.org/abs/1204.5280v1

N° RR-7939 (2012)

Computer Science

Programming Languages

Scientific paper

CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information. In this report, we propose a new trace for CHR which contains enough information to analyze any aspects of \CHRv\ execution at some useful abstract level, common to several implementations. %a large family of rule based solvers. This approach is based on the idea of generic trace. Such a trace is formally defined as an extension of the $\omega_r^\lor$ semantics of CHR. We show that it can be derived form the SWI Prolog CHR trace.

Affiliated with

Also associated with

No associations

Rating

Towards a Generic Trace for Rule Based Constraint Reasoning 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 Towards a Generic Trace for Rule Based Constraint Reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards a Generic Trace for Rule Based Constraint Reasoning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519224