Skip to main content

Debugging constraint programs

  • Constraint Logic Programming
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP '95 (CP 1995)

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

Abstract

Constraint programming (CP) is in its substance non-algorithmic programming, not last because it is often being applied to problems for which no efficient algorithms exist. A not immediately obvious consequence of this fact is that debugging CP programs is principally different from debugging algorithmic programs, including imperative, functional or Prolog programs. It is also more difficult. Moreover, it is frequently necessary to apply performance debugging to CP programs, which are correct but too slow to be feasible. The whole area of CP debugging is still lacking both methodology and tools to support users in improving their programs.

In this paper, we present a paradigm for tracing constraint programs and the design and implementation of Grace, a graphical environment for tracing CLP(FD) programs on top of ECL'PSe.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michael Dahmen. A Debugger for Constraints in Prolog. Technical Report ECRC-91-11, ECRC, 1991.

    Google Scholar 

  2. M. Ducassé. Opium+, a meta-debugger for Prolog. In Proceedings of the European Conference on Artificial Intelligence, Munich, August 1988.

    Google Scholar 

  3. ECLiPSe. URL http://www.ecrc.de/eclipse/eclipse.html, 1995.

    Google Scholar 

  4. ECLiPSe 3.5 User Manual, 1995. URL http://www.ecrc.de/eclipse/html/umsroot/umsroot.html.

    Google Scholar 

  5. ECLiPSe 3.5 Extensions User Manual, 1995. URL http://www.ecrc.de/eclipse/html/extroot/extroot.html.

    Google Scholar 

  6. Micha Meier. ProTcl, the Prolog interface to the Tcl/Tk toolkit. URL http://www.ecrc.de/eclipse/html/protcl.html.

    Google Scholar 

  7. Micha Meier. Visualizing and solving finite algebra problems. In Workshop on Finite Algebras, ECRC, Munich, March 1994.

    Google Scholar 

  8. Micha Meier, Abderrahmane Aggoun, David Chan, Pierre Dufresne, Reinhard Enders, Dominique Henry de Villeneuve, Alexander Herold, Philip Kay, Bruno Perez, Emmanuel van Rossum, and Joachim Schimpf. SEPIA — an extendible Prolog system. In Proceedings of the 11th World Computer Congress IFIP'89, pages 1127–1132, San Francisco, August 1989.

    Google Scholar 

  9. Micha Meier and Joachim Schimpf. Control in ECLiPSe. Technical Report ECRC-95-07, ECRC, February 1995. URL http://www.ecrc.de/eclipse/html/reports.html.

    Google Scholar 

  10. John K. Ousterhout. Tcl and the Tk Toolkit. Addison-Wesley, 1994.

    Google Scholar 

  11. Michael Sanella. Analyzing and debugging hierarchies of multi-way local propagation constraints. In Proceedings of the 1994 Workshop on Principles and Practice of Constraint Programming, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ugo Montanari Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meier, M. (1995). Debugging constraint programs. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-60299-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60299-6

  • Online ISBN: 978-3-540-44788-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics