Abstract
This chapter describes an approach to performance debugging of constraint programs by means of the visualisation of selected parts of the computation space. The computation space is represented by choice-trees, a notion which is commonly used to describe the search in constraint solvers. We propose a language for selecting the information to be visualised and present an algorithm to construct the corresponding view (it is a pruned choice-tree) in a form which is unique and which preserves the relative positions of the selected nodes and arcs. The originality of the approach lies in its genericity (different views may be displayed simultaneously to analyse the same computation space) and the way to specify the views, in particular, using properties of the program at hand. This allows to define new views of one execution without updating the program at hand nor re-executing it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cosytec. CHIP user Manual, beta release (September 1998)
Diaz, D.: GNU-Prolog user Manual, http://pauillac.inria.fr/diaz/gnuprolog/
The DiSCiPl Consortium. Esprit LTR (Task 4.2) Project Nb 22532 Debugging Systems for Constraint Programming (October 1997-June 1999), http://discipl.inria.fr
Deransart, P. (ed.): The DiSCiPl Consortium, CP Debugging: Tools. D.WP1.1.M1.1-2 (July 1997), http://discipl.inria.fr/deliverables1.html
Deransart, P., Ed-Dbali, A., Cervoni, L.: Prolog: The Standard, Reference Manual. Springer, Heidelberg (1996)
Deransart, P., Małuszyński, J.: A Grammatical View of Logic Programming. The MIT Press, Cambridge (1993)
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: Kamkar, M. (ed.) Proceedings of the AADEBUG’97 (The Third International Workshop on Automated Debugging), Linköping University, pp. 155–169 (1997)
Carlson, B., Carlsson, M., Diaz, D.: Entailment of Finite Domain Constraint, ftp://ftp.inria.fr/INRIA/Projects/loco/publications/entail.ps
Meier, M.: Debugging Constraint Programs. In: Proceedings of Principles and Practice of Constraint Programming (CP 1995), Cassis, pp. 204–221 (1995)
Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming 19/20, 503–581 (1994)
PrologIA. Prolog IV Manual, Tutorial, Basic Concepts (1997)
Fages, F.: Programmation Logique par Contraintes. Ellipses, X-Ecole Polytechnique, France (1996)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Schulte, C.: Oz Explorer: A Visual Constraint Programming Tool. In: Proceedings of the Fourteenth International Conference on Logic Programming (ICLP 1997), Leuven, pp. 286–300. The MIT Press, Cambridge (1997)
Schulte, C.: Programming Constraint Inference Engine. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 519–534. Springer, Heidelberg (1997)
Marriott, K., Stuckey, P.: Programming with constraints, an introduction. The MIT Press, Cambridge (1998)
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
Aillaud, C., Deransart, P. (2000). Towards a Language for CLP Choice-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_9
Download citation
DOI: https://doi.org/10.1007/10722311_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41137-6
Online ISBN: 978-3-540-40016-5
eBook Packages: Springer Book Archive