zbMATH — the first resource for mathematics

Search tree debugging. (English) Zbl 0942.68551
Fages, François (ed.), JFPLC’99. 8ème journées francophones de programmation logique et programmation par contraintes, Lyon, France, Juin 2-4, 1999. Paris: Hermes Science Publications. 265-280 (1999).
Summary: This paper describes a visual tool for debugging and analysis of the search trees generated by finite domain constraint programs. The tool allows to navigate in the search tree in a flexible way and gives, for any node of the search tree, a clear view of the current state of the program execution. The tool provides graphical representations of the form of the search tree, of constraints and variables of the program and of the propagation steps performed after each decision in the tree. The debugger is used via a set of meta-predicates which annotate the search routine given by the user, which allows great flexibility in adapting the program to the needs of different users. The tool is now part of the CHIP constraint programming environment and covers important aspects both of correctness and performance debugging.
For the entire collection see [Zbl 0930.00067].

68P10 Searching and sorting