Soundness and completeness versus lifting property

  • Jan A. Plaza
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1138)


We give new formulations of the property of soundness and completeness of a resolution system and of the lifting lemma, and we discuss their relationship.

The discussion points out why certain resolution systems are not complete, and that there is a simple method for showing that a resolution system is “absolutely incomplete” — that there is no notion of program completion and no logic which could give soundness and completeness. The method is demonstrated on the case of basic variants of the SLDNF-resolution. The same approach can be used to analyze other resolution systems.


soundness and completeness lifting lemma program completion SLDNF-resolution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AB94]
    K. R. Apt and R. N. Bol, Logic Programming And Negation: A Survey, Journal of Logic Programming Vol.19/20, pp. 9–71, 1994.CrossRefGoogle Scholar
  2. [Chan88]
    D. Chan, Constructive Negation Based on Completed Database, in [LPconf88], pp. 111–125.Google Scholar
  3. [Chan89]
    D. Chan, An extension of constructive negation and its application in corouting, in [LPconfNA89], pp. 477–493.Google Scholar
  4. [Clark78]
    K. L. Clark, Negation as Failure, in Logic and Databases, edited by H. Gallaire and J. Minker, Plenum Press, New York, 1978, pp. 193–322.Google Scholar
  5. [Clark79]
    K. L. Clark, Predicate Logic as a Computational Formalism, Research Report DOC 79/59, Dept. of Computing, Imperial College, 1979.Google Scholar
  6. [Doets94]
    K. Doets, From Logic to Logic Programming MIT Press, 1994.Google Scholar
  7. [DM91]
    W. Drabent and M.Martelli, Strict Completion of Logic Programs, New Generation Computing 9, pp. 69–79, 1991.Google Scholar
  8. [Drabent95]
    What is Failure? An Approach to Constructive Negation, Acta Informatica, to appear.Google Scholar
  9. [Kunen87]
    K. Kunen, Answer Sets and Negation as Failure, in [LPconf87].Google Scholar
  10. [Kunen89]
    K. Kunen, Signed Data Dependencies in Logic Programs, Journal of Logic Programming, 1989, vol. 7, no. 3, pp.231–247.CrossRefGoogle Scholar
  11. [Lloyd87]
    J. W. Lloyd, Foundations of Logic Programming, Second extended edition, Springer Verlag, 1987.Google Scholar
  12. [LPconf87]
    J-L. Lassez (ed.), Logic Programming, Proceedings of the Fourth International Conference, MIT Press, 1987.Google Scholar
  13. [LPconf88]
    R. A. Kowalski and K. A. Bowen (eds.), Logic Programming, Proceedings of the Fifth International Conference and Symposium, MIT Press, 1988.Google Scholar
  14. [LPconfNA89]
    E. L. Lusk and R. A. Overbeek (eds.), Logic Programming, Proceedings of the North American Conference 1989, MIT Press, 1989.Google Scholar
  15. [O'Keefe90]
    R. A. O'Keefe, The Craft of Prolog, MIT Press, 1990.Google Scholar
  16. [Plaza90]
    J. A. Plaza, Fully Declarative Programming with Logic — Mathematical Foundations Ph.D. Dissertation, City University of New York, July 1990.Google Scholar
  17. [Plaza91]
    J. A. Plaza, Completeness for propositional logic programs with negation, in: Methodologies for Intelligent Systems, 6th International Symposium, edited by Z. W. Ras and M. Zemankova, Springer Verlag, LNAI 542, 1991, pp. 600–609.Google Scholar
  18. [Plaza92f]
    J. A. Plaza, Fully Declarative Logic Programming, in Programming Language Implementation and Logic Programming, 4th International Symposium, edited by M. Bruynooghe and M. Wirsing, Springer Verlag, LNCS 631, 1992, pp. 415–427.Google Scholar
  19. [Plaza92o]
    J. A. Plaza, Operators on Lattices of omega-Herbrand Interpretations, in: A. Nerode and M. Taitslin (eds.) Logical Foundations of Computer Science — Tver '92, Second International Symposium, Tver, Russia, July 1992, Proceedings, Springer Verlag, LNCS 620, 1992 pp. 358–369.Google Scholar
  20. [Przymusiński89]
    T. C. Przymusiński, On Constructive Negation in Logic Programming, in [LPconfNA89], addendum.Google Scholar
  21. [Robinson65]
    J. A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM 12, 1965, pp. 23–41.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jan A. Plaza
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of MiamiCoral GablesUSA

Personalised recommendations