Abstract
The control part of the execution of a constraint logic program can be conceptually shown as a search-tree, where nodes correspond to calls, and whose branches represent conjunctions and disjunctions. This tree represents the search space traversed by the program, and has also a direct relationship with the amount of work performed by the program. The nodes of the tree can be used to display information regarding the state and origin of instantiation of the variables involved in each call. This depiction can also be used for the enumeration process. These are the features implemented in APT, a tool which runs constraint logic programs while depicting a (modified) searchtree, keeping at the same time information about the state of the variables at every moment in the execution. This information can be used to replay the execution at will, both forwards and backwards in time. These views can be abstracted when the size of the execution requires it. The search-tree view is used as a framework onto which constraint-level visualisations (such as those presented in the following chapter) can be attached.
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
Aggoun, A., Simonis, H.: Search Tree Visualization. Technical Report D.WP1.1.M1.1-2, COSYTEC (June 1997). In the ESPRIT LTR Project 22352 DiSCiPl
Apt, K.R., Marchiori, E.: Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing 6(6), 743–765 (1994)
Baecker, R., DiGiano, C., Marcus, A.: Software Visualization for Debugging. Communications of the ACM 40(4), 44–54 (1997)
Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., López, P., Puebla, G.: The Ciao Prolog System. Reference Manual. The Ciao System Documentation Series–TR CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM) (August 1997)
Bueno, F., Deransart, P., Drabent, W., Ferrand, G., Hermenegildo, M., Małuszyński, J., Puebla, G.: Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs. In: Proc. of the 3rd. Int’l Workshop on Automated Debugging–AADEBUG 1997, Linköping, Sweden, pp. 155–170. U. of Linköping Press (May 1997)
Byrd, L.: Understanding the Control Flow of Prolog Programs. In: Tärnlund, S.-A. (ed.) Workshop on Logic Programming, Debrecen (1980)
Carro, M., Gómez, L., Hermenegildo, M.: Some Paradigms for Visualizing Parallel Execution of Logic Programs. In: 1993 International Conference on Logic Programming, pp. 184–201. The MIT Press, Cambridge (1993)
Carro, M., Hermenegildo, M.: Some Design Issues in the Visualization of Constraint Program Execution. In: AGP 1998 Joint Conference on Declarative Programming, pp. 71–86 (July 1998)
Diaz, D., Codognet, P.: A minimal extension of the WAM for clp(FD). In: Warren, D.S. (ed.) Proceedings of the Tenth International Conference on Logic Programming, Budapest, Hungary, pp. 774–790. The MIT Press, Cambridge (1993)
Drabent, W., Nadjm-Tehrani, S., Małuszyński, J.: Algorithmic debugging with assertions. In: Abramson, H., Rogers, M.H. (eds.) Meta-programming in Logic Programming, pp. 501–522. The MIT Press, Cambridge (1989)
Ducassé, M., Noyé, J.: Logic programming environments: Dynamic program analysis and debugging. Journal of Logic Programming 19(20), 351–384 (1994)
Ducassé, M.: A General Query Mechanism Based on Prolog. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 400–414. Springer, Heidelberg (1992)
Eisenstadt, M., Brayshaw, M.: The Transparent Prolog Machine (TPM): An Execution Model and Graphical Debugger for Logic Programming. Journal of Logic Programming 5(4) (1988)
Fabris, M.: CP Debugging Needs. Technical report, ICON s.r.l., ESPRIT LTR Project 22352 DiSCiPl deliverable D.WP1.1.M1.1 (April 1997)
Fernández, J.M.: Declarative debugging for babel. Master’s thesis, School of Computer Science, Technical University of Madrid (October 1994)
Kahn, K.: Drawing on Napkins, Video-game Animation, and Other ways to program Computers. Communications of the ACM 39(8), 49–59 (1996)
López Luengo, A.: Apt: Implementing a graphical visualizer of the execution of logic programs. Master’s thesis, Technical University of Madrid, School of Computer Science, E-28660, Boadilla del Monte, Madrid, Spain (October 1997)
Ousterhout, J.K.: Tcl and the Tk Toolkit. Professional Computing Series. Addison-Wesley, Reading (1994)
PrologIA. Visual tools for debugging of Prolog IV programs. Technical Report D.WP3.5.M2.2, ESPRIT LTR Project 22352 DiSCiPl (October 1998)
Schulte, C.: Oz explorer: A visual constraint programming tool. In: Naish, L. (ed.) ICLP 1997. The MIT Press, Cambridge (July 1997)
Swedish Institute of Computer Science, P.O. Box 1263, S-16313 Spanga, Sweden. Sicstus Prolog V3.0 User’s Manual (1995)
Tick, E.: Visualizing Parallel Logic Programming with VISTA. In: International Conference on Fifth Generation Computer Systems, Tokio, ICOT, pp. 934–942 (June 1992)
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
Carro, M., Hermenegildo, M. (2000). Tools for Search-Tree Visualisation: The APT Tool. 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_10
Download citation
DOI: https://doi.org/10.1007/10722311_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41137-6
Online ISBN: 978-3-540-40016-5
eBook Packages: Springer Book Archive