Search-Tree Visualisation
Search-Tree Visualisation
复制标题
搜索树可视化
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
A. Aggoun
中科院分区：
文献类型：
--
作者：
Helmut Simonis;A. Aggoun
本章介绍了用于调试和分析有限域约束程序生成的搜索树的视觉工具。该工具允许以灵活的方式在搜索树中导航，并为搜索树的任何节点提供对程序执行的当前状态的清晰视图。该工具提供了搜索树的形式的图形表示，程序的约束和变量以及在树中每个决策后执行的传播步骤的图形表示。调试器是通过一组元预言材料使用的，该元预言会注释用户给出的搜索例程，这可以极大地灵活地将程序适应不同用户的需求。该工具现在是芯片约束编程环境的一部分，涵盖了正确性和性能调试的重要方面。
This chapter 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.