2003/09/17 by Gerard Ferrand, Gérard Ferrand, Ferrand, Gerard +4
Computer Science · #AI-based Problem Solving and Planning #Constraint Satisfaction and Optimization #D.2.5 #FOS: Computer and information sciences #Semantic Web and Ontologies #Software Engineering (cs.SE) #cs.SE
paper · pdf · doi:10.48550/arxiv.cs/0309032
In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth International Workshop on Automated Debugging (AADEBUG 2003), September 2003, Ghent. cs.SE/0309027
arxiv created 2003/09/17 · openalex publication_date 2003/09/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.