Towards declarative diagnosis of constraint programs over finite domains

Details Towards declarative diagnosis of constraint programs over finite domains Towards declarative diagnosis of constraint programs over finite domains

2003-09-17

arxiv.org/abs/cs/0309032v1

Computer Science

Software Engineering

In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth International Workshop on Automated Debugging (AADEBUG 2003), Se

Scientific paper

The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive definitions which express the removals of values as consequences of other value removals. Explanations may be considered as the essence of constraint programming. They are a declarative view of the computation trace. The diagnosis consists in locating an error in an explanation rooted by a symptom.

Affiliated with

Also associated with

No associations

Rating

Towards declarative diagnosis of constraint programs over finite domains 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 declarative diagnosis of constraint programs over finite domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards declarative diagnosis of constraint programs over finite domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137370