Skip to main content

Qualified Computations in Functional Logic Programming

  • Conference paper
Book cover Logic Programming (ICLP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5649))

Included in the following conference series:

Abstract

Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language for First-Order Functional Logic Programming with Constraints and Qualification. We present a Rewriting Logic which characterizes the intended semantics of programs, and a prototype implementation based on a semantically correct program transformation. Potential applications of the resulting language include flexible information retrieval. As a concrete illustration, we show how to write program rules to compute qualified answers for user queries concerning the books available in a given library.

Research partially supported by projects MERIT–FORMS (TIN2005-09027-C03-03), PROMESAS–CAM(S-0505/TIC/0407) and STAMP (TIN2008-06622-C03-01).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. Journal of the ACM 47(4), 776–822 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arenas, P., Fernández, A.J., Gil, A., López-Fraguas, F.J., Rodríguez-Artalejo, M., Sáenz-Pérez, F.: \(\mathcal{TOY}\), a multiparadigm declarative language. version 2.3.1. Caballero, R., Sánchez, J. (eds.) (2007), http://toy.sourceforge.net

  3. Caballero, R., Rodríguez-Artalejo, M., Romero-Díaz, C.A.: Similarity-based reasoning in qualified logic programming. In: PPDP 2008: Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming, pp. 185–194. ACM, New York (2008)

    Google Scholar 

  4. Caballero, R., Rodríguez-Artalejo, M., Romero-Díaz, C.A.: A generic scheme for qualified constraint functional logic programming. Technical Report SIC-1-09, Universidad Complutense, Departamento de Sistemas Informáticos y Computación, Madrid, Spain (2009), http://gpd.sip.ucm.es/cromdia/works

  5. del Vado Vírseda, R.: Declarative constraint programming with definitional trees. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol. 3717, pp. 184–199. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Guadarrama, S., Muñoz, S., Vaucheret, C.: Fuzzy prolog: A new approach using soft constraint propagation. Fuzzy Sets and Systems 144(1), 127–150 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hanus, M.: Curry: an integrated functional logic language, version 0.8.2. Hanus, M. (ed.) (2006), http://www.informatik.uni-kiel.de/~curry/report.html

  8. López-Fraguas, F.J., Rodríguez-Artalejo, M., del Vado-Virseda, R.: A lazy narrowing calculus for declarative constraint programming. In: Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2004), pp. 43–54. ACM Press, New York (2004)

    Google Scholar 

  9. López-Fraguas, F.J., Rodríguez-Artalejo, M., del Vado-Vírseda, R.: A new generic scheme for functional logic programming with constraints. Journal of Higher-Order and Symbolic Computation 20(1-2), 73–122 (2007)

    Article  MATH  Google Scholar 

  10. Moreno, G., Pascual, V.: Formal properties of needed narrowing with similarity relations. Electronic Notes in Theoretical Computer Science 188, 21–35 (2007)

    Article  MATH  Google Scholar 

  11. Riezler, S.: Quantitative constraint logic programming for weighted grammar applications. In: Retoré, C. (ed.) LACL 1996. LNCS, vol. 1328, pp. 346–365. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Riezler, S.: Probabilistic Constraint Logic Programming. PhD thesis, Neuphilologischen Fakultät del Universität Tübingen (1998)

    Google Scholar 

  13. Rodríguez-Artalejo, M.: Functional and constraint logic programming. In: Comon, H., Marché, C., Treinen, R. (eds.) CCL 1999. LNCS, vol. 2002, pp. 202–270. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Rodríguez-Artalejo, M., Romero-Díaz, C.A.: Quantitative logic programming revisited. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 272–288. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Sessa, M.I.: Approximate reasoning by similarity-based SLD resolution. Theoretical Computer Science 275(1-2), 389–426 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Subrahmanian, V.S.: Uncertainty in logic programming: Some recollections. Association for Logic Programming Newsletter 20(2) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caballero, R., Rodríguez-Artalejo, M., Romero-Díaz, C.A. (2009). Qualified Computations in Functional Logic Programming. In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02846-5_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02845-8

  • Online ISBN: 978-3-642-02846-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics