Skip to main content

A Computational Model for Functional Logic Deductive Databases

  • Conference paper
  • First Online:
Logic Programming (ICLP 2001)

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

Included in the following conference series:

Abstract

This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as ‘finite failure’ of reduction, we will define Herbrand algebras and models for this semantics and a fix point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original program; in fact, it will carry out a goal-directed lazy evaluation.

The authors have been partially supported by the Spanish CICYT (project TIC 98-0445-C03-02 TREND)

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. J. M. Almendros-Jiménez and A. Becerra-Terón. A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs. In Proc. FLOPS’01, LNCS 2024, pages 153–169.

    Google Scholar 

  2. J. M. Almendros-Jiménez, A. Becerra-Terón, and J. Sánchez-Hernández. A Computational Model for Functional Logic Deductive Databases, available in http://www.ual.es/~jalmen. Technical report, Universidad de Almerí, 2001.

  3. K. R. Apt. Logic programming. In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 10, pages 493–574. MIT Press, 1990.

    MathSciNet  Google Scholar 

  4. K. R. Apt and R. N. Bol. Logic Programming and Negation: A Survey. JLP, 19,20:9–71, 1994.

    Article  MathSciNet  Google Scholar 

  5. C. Beeri and R. Ramakrishnan. On the Power of Magic. JLP, 10(3,4):255–299, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  6. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. ICLP/SLP’88, pages 1070–1080. MIT Press.

    Google Scholar 

  7. J. C. González-Moreno, M. T. Hortalá-González, F. López-Fraguas, and M. Rodríguez-Artalejo. An Approach to Declarative Programming Based on a Rewriting Logic. JLP, 1(40):47–87, 1999.

    Article  Google Scholar 

  8. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. JLP, 19,20:583–628, 1994.

    Article  MathSciNet  Google Scholar 

  9. M. Hanus. Curry, An Integrated Functional Logic Language, Version 0.7.1. Technical report, University of Kiel, Germany, June 2000.

    Google Scholar 

  10. D. B. Kemp, D. Srivastava, and P. J. Stuckey. Bottom-up Evaluation and Query Optimization of Well-Founded Models. TCS, 146(1,2):145–184, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Loogen, F. J. López-Fraguas, and M. Rodríguez-Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing. In Proc. PLILP’93, LNCS 714, pages 184–200.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. F. J. López-Fraguas and J. Sánchez-Hernández. TOY: A Multiparadigm Declarative System. In Proc. RTA’99, LNCS 1631, pages 244–247.

    Google Scholar 

  14. F. J. López-Fraguas and J. Sánchez-Hernández. Proving Failure in Functional Logic Programs. In Proc. CL’00, LNCS 1861, pages 179–193.

    Google Scholar 

  15. R. Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. JLP, 11(3,4):189–216, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  16. R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadir. The CORAL Deductive Database System. VLDB, 3(2):161–210, 1994.

    Article  Google Scholar 

  17. R. Ramakrishnan and J. Ullman. A Survey of Deductive Database Systems. JLP, 23(2):125–149, 1995.

    Article  MathSciNet  Google Scholar 

  18. K. Ross. Modular Stratification and Magic Sets for Datalog Programs with Negation. ACM, 41(6):1216–1266, 1994.

    Article  MATH  Google Scholar 

  19. J. D. Ullman. Bottom-up Beats Top-down for Datalog. In Procs. PODS’89, pages 140–149. ACM Press.

    Google Scholar 

  20. J. Vaghani, K. Ramamohanarao, D. B. Kemp, Z. Somogyi, P. J. Stuckey, T. S. Leask, and J. Harland. The Aditi Deductive Database System. VLDB, 3(2):245–288, 1994.

    Article  Google Scholar 

  21. A. van Gelder, K. Ross, and J. Schlipf. The Well-Founded Semantics for General Logic Programs. ACM, 38(3):620–650, 1991.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Almendros-Jiménez, J.M., Becerra-Terón, A., Sánchez-Hernández, J. (2001). A Computational Model for Functional Logic Deductive Databases. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45635-X_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42935-7

  • Online ISBN: 978-3-540-45635-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics