Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggoun, A., Beldiceanu, N.: Time Stamp Techniques for the Trailed Data in Constraint Logic Programming Systems. In: Actes du Seminaire 1990 - Programmation en Logique, Tregastel, France (May 1990)
Aggoun, A., Beldiceanu, N.: Extending CHIP in Order to Solve Complex Scheduling Problems. Journal of Mathematical and Computer Modelling 17(7), 57–73 (1993)
Beldiceanu, N., Bourreau, E., Chan, P., Rivreau, D.: Partial Search Strategy in CHIP. In: 2nd International Conference on Meta-heuristics, Sophia-Antipolis, France (July 1997)
Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. Journal of Mathematical and Computer Modelling 20(12), 97–123 (1994)
Bueno, F., Deransart, P., Drabent, W., Ferrand, G., Hermenegildo, M., Małuszyǹski, J., Puebla, G.: On the Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs. In: Proceedings of the Third International Workshop on Automated Debugging-AADEBUG 1997, Linköping, Sweden, pp. 155–170 (May 1997)
Carro, M., Gomez, L., Hermenegildo, M.: Some Paradigms for Visualizing Parallel Execution of Logic Programs. In: Proc. ICLP 1993, Budapest, Hungary. The MIT Press, Cambridge (1993)
COSYTEC. CHIP++ Version 5.2. Documentation, Vol. 6. Orsay (1998)
Fabris, M., et al.: CP Debugging Needs and Tools. In: Proceedings of the Third International Workshop on Automated Debugging-AADEBUG 1997, Linköping, Sweden, pp. 103–122 (May 1997)
Held, M., Karp, R.: The Travelling Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming 1, 6–25 (1971)
Jones, C.V.: Visualization and Optimization. Kluwer Academic Publishers, Norwell (1996)
Meier, M.: Debugging Constraint Programs. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 204–221. Springer, Heidelberg (1995)
Schulte, C.: Oz Explorer: A Visual Constraint Programming Tool. In: Proceedings of the Fourteenth International Conference On Logic Programming, Leuven, Belgium, pp. 286–300. The MIT Press, Cambridge (1997)
Simonis, H.: Application Development with the CHIP System. In: Proc. Contessa Workshop, Friedrichshafen, Germany. LNCS, Springer, Heidelberg (1995)
Simonis, H.: The CHIP System and its Applications. In: Proc. Principles and Practice of Constraint Programming, Cassis, France (September 1995)
Simonis, H.: A Problem Classification Scheme for Finite Domain Constraint Solving. In: Proc. workshop on constraint applications, CP 1996, Boston (August 1996)
Wallace, M.: Survey: Practical Applications of Constraint Programming. Constraints 1(1-2), 139–168 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Simonis, H., Aggoun, A. (2000). Search-Tree Visualisation. In: Deransart, P., Hermenegildo, M.V., Małuszynski, J. (eds) Analysis and Visualization Tools for Constraint Programming. Lecture Notes in Computer Science, vol 1870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722311_8
Download citation
DOI: https://doi.org/10.1007/10722311_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41137-6
Online ISBN: 978-3-540-40016-5
eBook Packages: Springer Book Archive