Advertisement

Completeness of the SLDNF-resolution for a class of logic programs

  • R. Barbuti
  • M. Martelli
Session 6b: Theory And Negation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

Abstract

The paper gives a completeness result of SLDNF-resolution for a large class of logic programs. The characteristics of this class (structured programs) are mostly related to the possibility to decide always if a ground atom is or not a logical consequence of a program (i.e. they are related with total functions). Another characteristic of structured programs is that they allow to compute only ground substitutions. Most of the known completeness results (for example those for hierarchical programs) are special cases of this result. The class of structured programs is large enough to allow to write general programs with recursive definitions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K.R., Blair, H. and Walker, A. Towards a Theory of Declarative Knowledge. IBM Internal Report, Yorktown Heights, (1985).Google Scholar
  2. 2.
    Aquilano, C., Barbuti, R., Bocchetti, P. and Martelli M. Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions. To appear in the Journal of Automated Reasoning.Google Scholar
  3. 3.
    Asirelli, P., Barbuti, R. and Levi, G. Types and Declarative Static Type Checking in Logic Programming. Proc. Programming '84, Primorsko, Bulgary, (1984).Google Scholar
  4. 4.
    Asirelli, P., De Santis, M. and Martelli M. Integrity Constraints in Logic Databases. Journal of Logic Programming 2, 3 (1985) 221–232.Google Scholar
  5. 5.
    Barbuti, R. and Martelli, M. Programming in a Generally Functional Style to Design Logic Data Bases. Internal Report of CASE Center, Syracuse University, (1986).Google Scholar
  6. 6.
    Barbuti,R. and Martelli,M. Completeness of SLDNF-resolution for Structured Programs. (1985), Submitted for publicaton.Google Scholar
  7. 7.
    Chandra, A.K. and Harel D. Horn Clause Queries and Generalizations. Journal of Logic Programming 2, 1 (1985) 1–15.Google Scholar
  8. 8.
    Clark, K.L. Negation as Failure. in Logic and Data Bases, (Gallaire, H. and Minker, J. Eds), Plenum, New York, (1978) 293–322Google Scholar
  9. 9.
    Jaffar, J., Lassez, J-L. and Lloyd, J.W. Completeness of the Negation-as-Failure Rule. Proc. 8th IJCAI, Karlsruhe, (1983) 500–506.Google Scholar
  10. 10.
    Lloyd, J.W. Foundations of Logic Programming. Springer-Verlag, Symbolic Computation Series, (1984).Google Scholar
  11. 11.
    Lloyd, J.W. and Topor, R.W. A Basis for Deductive Data Base Systems. Journal of Logic Programming 2, 2, (1985) 93–109.Google Scholar
  12. 12.
    Lloyd, J.W. and Topor, R.W. A Basis for Deductive Data Base Systems II. Techn. Rep. 85/6, Dept. of Comp. Science, Univ. of Melbourne, (1985).Google Scholar
  13. 13.
    Mycroft, A. and O'Keefe, R. A Polymorphic Type System for PROLOG. Proc. Logic Programming Workshop, Portugal, (1983) 107–122.Google Scholar
  14. 14.
    Reiter, R. On Closed World Data Bases. in Logic and Data Bases, (Gallaire, H. and Minker, J. Eds), Plenum, New York, (1978) 55–76.Google Scholar
  15. 15.
    Shepherdson, J.C. Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. Journal of Logic Programming 1, 1, (1984) 51–79.Google Scholar
  16. 16.
    Shepherdson, J.C. Negation as Failure II Journal of Logic Programming 2, 3, (1985) 185–202.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • R. Barbuti
    • 1
  • M. Martelli
    • 2
    • 3
  1. 1.Dipartimento di InformaticaUniversita' di PisaPisaItaly
  2. 2.CNUCE C.N.R.PisaItaly
  3. 3.CASE Center Syracuse UniversitySyracuseUSA

Personalised recommendations