Well!: An evaluation procedure for all logic programs

  • N. Bidoit
  • P. Legay
Logic And Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)

Abstract

The purpose of this paper is to present Well!, a top-down evaluation procedure for general logic programs. Well! applies to all non floundering logic programs, whether stratifiable, effectively stratifiable or not. Well! extends both SLD-AL resolution and global SLS resolution. Its main feature is its effectiveness (as opposed to global SLS resolution). Well! is sound and (weakly) complete with respect to the well founded semantics. An implementation of Well!, called QSQRWF and derived from QSQR, is outlined.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [ABW86]
    K. R. Apt, H. Blair, and A. Walker, Towards a Theory of Declarative Knowledge, In Proc. of the Workshop on the Foundations of Deductive Databases and Logic Programming, pages 546–628, 1986, also in [Min88a].Google Scholar
  2. [AV88]
    S. Abiteboul and V. Vianu, Procedural and Declarative Database Update Languages, In Symp. on Principles of Database System, pages 240–250, ACM SIGACT-SIGMOD-SIGART, 1988, to appear in J. of Computer and Systen Science.Google Scholar
  3. [BF87]
    N. Bidoit and C. Froidevaux, Minimalism subsumes Default Logic and Circumscription, In Proc. of Conf. on Logic In Computer Science, pages 89–97, IEEE, 1987.Google Scholar
  4. [BF88]
    N. Bidoit and C. Froidevaux, Negation by Default and Unstratifiable Logic Programs, Technical Report 437, LRI, 1988, To appear in a special issue of TCS on Research in Deductive Databases.Google Scholar
  5. [BF90]
    N. Bidoit and C. Froidevaux, WELL!: An Evaluation Procedure for All Logic Programs, Technical Report 0, LRI, 1990, to appear.Google Scholar
  6. [Bid89]
    N. Bidoit, Negation in Rule based Database Languages: a Survey, TCS, 1989, to appear.Google Scholar
  7. [BR86]
    F. Bancilhon and R. Ramakrishnan, An Amateur's Introduction to Recursive Query-Processing Strategies, In Conf. on Management of Data, pages 16–52, ACM SIGMOD, 1986.Google Scholar
  8. [Bry89]
    F. Bry, Logic Programming as Constructivism: A Formalization and its Application to Databases, In Symp. on Principles of Database Systems, ACM, 1989.Google Scholar
  9. [CL70]
    C-L. Chang and R. C-T. Lee, Symbolic Logic and Mathematical Theorem Proving, Academic Press, New York, 1970.Google Scholar
  10. [End72]
    H. B. Enderton, A mathematical Introduction to Logic, Academic Press, New York, 1972.Google Scholar
  11. [FB88]
    M. Fitting and M. Ben-Jacob, Stratified and Three-Valued Logic Programming Semantics, In Proc. of the Int. Conf. on Logic Programming, pages 1055–1069, 1988.Google Scholar
  12. [Fit85]
    M. Fitting, A Kripke-Kleene Semantics for Logic Programs, Logic Programming, 4:295–312, 1985.Google Scholar
  13. [Gal86]
    J. Gallier, Logic For Computer Science — Foundations of Automatic Theorem Proving, Harpers and Row Publishers, New York, 1986.Google Scholar
  14. [GL88]
    M. Gelfond and V. Lifschitz, The Stable Model Semantics For Logic Programs, In Proc. of the Int. Conf. on Logic Programming, pages 1070–1080, 1988.Google Scholar
  15. [GRS88]
    A. Van Gelder, K. R. Ross, and J. S. Schlipf, Unfounded Sets and Well Founded Semantics for General Logic Programs, full paper, 1988.Google Scholar
  16. [KP88]
    P. Kolaitis and C. Papadimitriou, Why Not Negation by Fixpoint, In Proc. of the Symp. on Principles of Database Systems, pages 231–239, ACM-SIGACT-SIGMOD-SIGART, 1988.Google Scholar
  17. [KT88]
    D. Kemp and R. Topor, Completeness of a top-down Query Evaluation Procedure for Stratified Databases, In Proc. of the Int. Conf. on Logic Programming, pages 178–194, 1988.Google Scholar
  18. [Kun88]
    K. Kunen, Some Remarks on the Completed Database, In Proc. of the Int. Conf. on Logic Programming, pages 978–992, 1988.Google Scholar
  19. [Leg89]
    P. Legay, Evaluation de Requete en Datalog avec Negation, Rapport de DEA d'Informatique, LRI, Universite Paris XI, 1989.Google Scholar
  20. [Lif86]
    V. Lifschitz, On the Declarative Semantics of Logic Programs with Negation, In Proc. of the Workshop on the Foundations of Deductive Databases and Logic Programming, pages 420–432, 1986, also in [Min88a].Google Scholar
  21. [Llo87]
    J. W. Lloyd, Foundation of Logic Programming, Springer, Berlin, 1987.Google Scholar
  22. [Prz86]
    T. Przymusinski, On the Semantics of Stratified Deductive Databases, In Proc. of the Workshop on the Foundations of Deductive Databases and Logic Programming, pages 433–443, 1986, also in [Min88a].Google Scholar
  23. [Prz88]
    T. Przymusinski, Perfect Model Semantics, In Proc of the Int. Conf. on Logic Programming, pages 1081–1096, 1988.Google Scholar
  24. [Prz89]
    T. Przymusinski, Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model, In Symp. on Principles of Database System, pages 11–21, ACM SIGACT-SIGMOD-SIGART, 1989.Google Scholar
  25. [Ros89]
    A. Ross, A Procedural Semantics for Well Founded Negation in Logic Programs, In Symp. on Principles of Database Systems, pages 22–33, ACM, 1989.Google Scholar
  26. [SI88]
    H. Seki and H. Itoh, A Query Evaluation Procedure for Stratified Programs under the Extended CWA, In Proc. of the Int. Conf. on Logic Programming, pages 196–211, 1988.Google Scholar
  27. [Van89]
    A. VanGelder, The Alternating Fixpoint of Logic Programs with Negation, In Symp. on Principles of Database Systems, pages 1–10, ACM SIGACT-SIGMOD-SIGART, 1989.Google Scholar
  28. [Vie86]
    L. Vieille, Recursive Axioms in Deductive Databases: the Query-Subquery Approach, In Int. Conf. on Expert Database Systems, pages 179–193, 1986.Google Scholar
  29. [Vie89]
    L. Vieille, Recursive Query Processing: The Power of Logic, TCS, 69:1–53, 1989.Google Scholar
  30. [VRS88]
    A. VanGelder, K. Ross, and J. S. Schlipf, Unfounded Sets and Well-founded Semantics for General Logic Programs, In Symp. on Principles of Database Systems, pages 221–230, ACM SIGACT-SIGMOD-SIGART, 1988.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • N. Bidoit
    • 1
  • P. Legay
    • 1
  1. 1.Laboratoire de Recherche en InformatiqueUniversite Paris XIOrsay CedexFrance

Personalised recommendations