Skip to main content

Declarative debugging in constraint logic programming

  • Conference paper
  • First Online:
Concurrency and Parallelism, Programming, Networking, and Security (ASIAN 1996)

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

Included in the following conference series:

Abstract

This paper is motivated by the declarative insufficiency diagnosis of constraint logic programs, but focuses only on theoretical viewpoints. Constraint logic program semantics is redefined in terms of proof trees using a cover relation. We give a theoretical framework where declarative diagnosis method can be studied thanks to the inductive nature of the semantics. We define the notions of symptoms and errors and prove that if there exists a symptom then there exists an error.

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. P. Aczel. An Introduction to Inductive Definitions, chapter 7, pages 739–782. In J. Barwise, editor, Handbook of Mathematical Logic. North-Holland Publishing Company, 1977.

    Google Scholar 

  2. A. Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69–90, 1990.

    Article  Google Scholar 

  3. M. Comini, G. Levi, and G. Vitiello. Abstract Debugging of Logic Programs. In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation and Metaprogramming, volume 883 of Lecture Notes in Computer Science, pages 440–450. Springer-Verlag, 1994.

    Google Scholar 

  4. P. Deransart and J. Maluszyński. A Grammatical View of Logic Programming. MIT Press, 1993.

    Google Scholar 

  5. W. Drabent, S. Nadjm-Tehrani, and J. Małuszyński. Algorithmic Debugging with Assertions. In H. Abramson and M. H. Rogers, editors, Meta-Programming in Logic Programming, pages 501–522. MIT Press, 1989.

    Google Scholar 

  6. G. Ferrand. Error Diagnosis in Logic Programming: an adaptation of E. Y. Shapiro's method. Journal of Logic Programming, 4:177–198, 1987.

    Article  Google Scholar 

  7. G. Ferrand. The Notions of Symptom and Error in Declarative Diagnosis of Logic Programs. In P. A. Fritzson, editor, Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science, pages 40–57. Springer-Verlag, 1993.

    Google Scholar 

  8. M. Gabbrielli and G. Levi. Modeling answer constraints in Constraint Logic Programs. In V. A. Saraswat and K. Ueda, editors, International Conference on Logic Programming, pages 238–252. MIT Press, 1991.

    Google Scholar 

  9. R. Giacobazzi, S. K. Debray, and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. Journal of Logic Programming, 25(3):191–248, 1995.

    Article  Google Scholar 

  10. N. C. Heintze, J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. Yap. The CLP(\(\mathcal{R}\)) Programmer's Manual Version 1.2. IBM Thomas J. Watson Research Center, 1992.

    Google Scholar 

  11. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In 14th ACM Symposium on Principles of Programming Languages, pages 111–119. ACM, 1987.

    Google Scholar 

  12. J. Jaffar and M. J. Maher. Constraint Logic Programming: a survey. Journal of Logic Programming, 19–20:503–581, 1994.

    Article  Google Scholar 

  13. F. Le Berre and A. Tessier. Declarative Incorrectness Diagnosis in Constraint Logic Programming. In P. Lucio, M. Martelli, and M. Navarro, editors, Joint Conference on Declarative Programming, pages 379–391, 1996.

    Google Scholar 

  14. J. W. Lloyd. Declarative Error Diagnosis. New Generation Computing, 5(2):133–154„ 1987.

    Google Scholar 

  15. M. J. Maher. A Logic Programming view of CLP. In Warren, editor, International Conference on Logic Programming, pages 737–753. MIT Press, 1993.

    Google Scholar 

  16. L. Naish. A declarative debugging scheme. Technical Report 95/1, Department of Computer Science, University of Melbourne, 1995.

    Google Scholar 

  17. V. A. Saraswat. The Category of Constraint Systems is Cartesian-Closed. In Logic In Computer Science. IEEE Press, 1992.

    Google Scholar 

  18. E. Y. Shapiro. Algorithmic Program Debugging. ACM Distinguished Dissertation MIT Press, 1982.

    Google Scholar 

  19. P. Van Hentenryck. Constraint Logic Programming. Knowledge Engineering Review, 6(3):151–194, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tessier, A. (1996). Declarative debugging in constraint logic programming. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027780

Download citation

  • DOI: https://doi.org/10.1007/BFb0027780

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics