Advertisement

Proving Failure in Functional Logic Programs

  • Francisco J. López-Fraguas
  • Jaime Sánchez-Hernández
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1861)

Abstract

How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-deterministic function. We present a proof calculus, CRWLF, which is able to deduce negative information from CRWL-programs. In particular, CRWLF is able to prove ‘finite’ failure of reduction within CRWL.

Keywords

Logic Program Logic Programming Operational Semantic Negative Information Intended Meaning 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K.R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19&20:9–71, 1994.CrossRefMathSciNetGoogle Scholar
  2. [2]
    D. Bert and R. Echahed. Abstraction of conditional term rewriting systems. In Proc. ILPS’95, pages 162–176. MIT Press, 1995.Google Scholar
  3. [3]
    J.C. González-Moreno, T. Hortalá-González, F.J. López-Fraguas, and M. Rodríguez-Artalejo. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming, 40(1):47–87, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583–628, 1994.CrossRefMathSciNetGoogle Scholar
  5. [5]
    M. Hanus (ed.). Curry: An integrated functional logic language, February 2000. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry/report.html.
  6. [6]
    G. Jäger and R.F. Stärk. A proof-theoretic framework for logic programming. In S.R. Buss (ed.), Handbook of Proof Theory, pages 639–682. Elsevier, 1998.Google Scholar
  7. [7]
    F.J. López-Fraguas and J. Sánchez-Hernández. Disequalities may help to narrow. In Proc. APPIA-GULP-PRODE’99, pages 89–104, 1999.Google Scholar
  8. [8]
    F.J. López-Fraguas and J. Sánchez-Hernández. A multiparadigm declarative system. In Proc. RTA’99, Springer LNCS 1631, pages 244–247, 1999.Google Scholar
  9. [9]
    F.J. López-Fraguas and J. Sánchez-Hernández. Proving failure in functional logic programs (extended version). Tech. Rep. SIP 00/100-00, UCM Madrid, 2000.Google Scholar
  10. [10]
    J.J. Moreno-Navarro. Default rules: An extension of constructive negation for narrowing-based languages. In Proc. ICLP’95, pages 535–549. MIT Press, 1994.Google Scholar
  11. [11]
    J.J. Moreno-Navarro. Extending constructive negation for partial functions in lazy functional-logic languages. In Proc. ELP’96, pages 213–227. Springer LNAI 1050, 1996.Google Scholar
  12. [12]
    P.J. Stuckey. Constructive negation for constraint logic programming. In Proc. LICS’91, pages 328–339, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Francisco J. López-Fraguas
    • 1
  • Jaime Sánchez-Hernández
    • 1
  1. 1.Dep. Sistemas Informáticos y ProgramaciónUniv. Complutense de MadridSpain

Personalised recommendations