Declarative Debugging of Missing Answers in Constraint Functional-Logic Programming

  • Rafael Caballero
  • Mario Rodríguez Artalejo
  • Rafael del Vado Vírseda
Conference paper

DOI: 10.1007/978-3-540-74610-2_29

Volume 4670 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Caballero R., Rodríguez Artalejo M., del Vado Vírseda R. (2007) Declarative Debugging of Missing Answers in Constraint Functional-Logic Programming. In: Dahl V., Niemelä I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg

Abstract

It is well known that constraint logic and functional-logic programming languages have many advantages, and there is a growing trend to develop and incorporate effective tools to this class of declarative languages. In particular, debugging tools are a practical need for diagnosing the causes of erroneous computations. Recently [1], we have presented a prototype tool for the declarative diagnosis of wrong computed answers in CFLP(\({{\mathcal{D}}}\)), a new generic scheme for lazy Constraint Functional-Logic Programming which can be instantiated by any constraint domain \({{\mathcal{D}}}\) given as parameter [2]. The declarative diagnosis of missing answers is another well-known debugging problem in constraint logic programming [4]. This poster summarizes an approach to this problem in CFLP(\({{\mathcal{D}}}\)). From a programmer’s viewpoint, a tool for diagnosing missing answers can be used to experiment wether the program rules for certain functions are sufficient or not for computing certain expected answers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rafael Caballero
    • 1
  • Mario Rodríguez Artalejo
    • 1
  • Rafael del Vado Vírseda
    • 1
  1. 1.Dep. Sistemas Informáticos y Computación, Univ. Complutense de Madrid