Towards declarative diagnosis of constraint programs over finite domains
<|reference_start|>Towards declarative diagnosis of constraint programs over finite domains: 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.<|reference_end|>
@article{ferrand2003towards,
    title={Towards declarative diagnosis of constraint programs over finite domains},
    author={Gerard Ferrand, Willy Lesaint, Alexandre Tessier},
    journal={arXiv preprint arXiv:cs/0309032},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0309032},
    primaryClass={cs.SE}
}