Skip to main content

Tools for Search-Tree Visualisation: The APT Tool

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1870)

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.

Keywords

  • Logic Program
  • Logic Programming
  • Prolog Program
  • Constraint Domain
  • Program Clause

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/10722311_10
  • Chapter length: 16 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-40016-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. Apt, K.R., Marchiori, E.: Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing 6(6), 743–765 (1994)

    MATH  CrossRef  Google Scholar 

  3. Baecker, R., DiGiano, C., Marcus, A.: Software Visualization for Debugging. Communications of the ACM 40(4), 44–54 (1997)

    CrossRef  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Byrd, L.: Understanding the Control Flow of Prolog Programs. In: Tärnlund, S.-A. (ed.) Workshop on Logic Programming, Debrecen (1980)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Ducassé, M., Noyé, J.: Logic programming environments: Dynamic program analysis and debugging. Journal of Logic Programming 19(20), 351–384 (1994)

    CrossRef  MathSciNet  Google Scholar 

  12. 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)

    CrossRef  Google Scholar 

  13. 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)

    Google Scholar 

  14. Fabris, M.: CP Debugging Needs. Technical report, ICON s.r.l., ESPRIT LTR Project 22352 DiSCiPl deliverable D.WP1.1.M1.1 (April 1997)

    Google Scholar 

  15. Fernández, J.M.: Declarative debugging for babel. Master’s thesis, School of Computer Science, Technical University of Madrid (October 1994)

    Google Scholar 

  16. Kahn, K.: Drawing on Napkins, Video-game Animation, and Other ways to program Computers. Communications of the ACM 39(8), 49–59 (1996)

    CrossRef  Google Scholar 

  17. 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)

    Google Scholar 

  18. Ousterhout, J.K.: Tcl and the Tk Toolkit. Professional Computing Series. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  19. PrologIA. Visual tools for debugging of Prolog IV programs. Technical Report D.WP3.5.M2.2, ESPRIT LTR Project 22352 DiSCiPl (October 1998)

    Google Scholar 

  20. Schulte, C.: Oz explorer: A visual constraint programming tool. In: Naish, L. (ed.) ICLP 1997. The MIT Press, Cambridge (July 1997)

    Google Scholar 

  21. Swedish Institute of Computer Science, P.O. Box 1263, S-16313 Spanga, Sweden. Sicstus Prolog V3.0 User’s Manual (1995)

    Google Scholar 

  22. Tick, E.: Visualizing Parallel Logic Programming with VISTA. In: International Conference on Fifth Generation Computer Systems, Tokio, ICOT, pp. 934–942 (June 1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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