Skip to main content
SpringerLink
Log in

Fully declarative logic programming

  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1992)

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

Abstract

In this paper we present a theoretical basis for implementation of a fully declarative logic programming language which allows use of quantifiers and negation in the statement bodies. We formulate SLPG — a resolution system extending SLD-resolution, but alternative to SLDNF. SLPG computes over an open universe of terms. It is complete for the full class of positive programs (with statements A ← B where B involves ⊤, ⊥, ∧, ∀, ∀, ∃, =), and also for a class of programs involving negative information in the form of guards (i.e. inequations between terms.) By augmenting SLPG with a mechanism of constructive negation we obtain SLPGCN-resolution which is complete for broader classes of programs involving negation ∣ (without assuming any notion of stratification.)

This research has been partly supported from the NSF grant CCR-8702307

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, H. A. Blair and A. Walker, Towards a Theory of Declarative Knowledge, in [Minker '88], pp. 89–148.

    Google Scholar 

  2. K.R. Apt and M.H. van Emden, Contributions to the Theory of Logic Programming, Journal of the ACM Vol. 29, No. 3, July 1982, pp. 841–862.

    Google Scholar 

  3. D. Chan, Constructive Negation Based on the Completed Database, in [Kowalski and Bowen '88], vol. 1, pp. 111–125.

    Google Scholar 

  4. K.L. Clark, Negation as Failure, in [Gallaire and Minker 78], pp. 193–322.

    Google Scholar 

  5. K.L. Clark, Predicate Logic as a Computational Formalism, Research Report DOC 79/59, Dept. of Computing, Imperial College, London, 1979.

    Google Scholar 

  6. H. Comon, Unification et Disunification: Theorie et Applications, Doctoral Dissertation, I.N.P. de Grenoble, France, 1988.

    Google Scholar 

  7. M. Fitting, First-order Logic and Automated Theorem Proving, Springer Verlag, New York 1990.

    Google Scholar 

  8. H. Gallaire and J. Minker (eds.), Logic and Databases, Plenum Press, New York, 1978.

    Google Scholar 

  9. J. Jaffar, J.-L. Lassez and J.W. Lloyd, Completeness of the Negation as Failure Rule, IJCAI-83, Karlsruhe, 1983, pp. 500–506.

    Google Scholar 

  10. R.A. Kowalski, Predicate Logic as a Programming Language, Information Processing '74, Stockholm, North Holland, 1974, pp. 569–574.

    Google Scholar 

  11. R. A. Kowalski, Algorithm = Logic + Control, Communications of the ACM 22, 7, July 1979, pp. 424–436.

    Google Scholar 

  12. R.A. Kowalski and K.A. Bowen (eds.), Logic Programming, Proceedings of the Fifth International Conference and Symposium, MIT Press, 1988.

    Google Scholar 

  13. K. Kunen, Negation in Logic Programming, Journal of Logic Programming 1987, No. 4, pp. 289–308.

    Google Scholar 

  14. G. Levi and M. Martelli (eds.), Logic Programming, Proceedings of the Sixth International Conference, MIT Press, 1989.

    Google Scholar 

  15. V. Lifschitz, On the Declarative Semantics of Logic Programs with Negation, in [Minker '88], pp. 177–192.

    Google Scholar 

  16. J.W. Lloyd, Foundations of Logic Programming, Second extended edition, Springer Verlag, 1987.

    Google Scholar 

  17. J.W. Lloyd and R.W. Topor, Making Prolog More Expressive, Journal of Logic Programming 3, 1984.

    Google Scholar 

  18. D. Lugiez, A Deduction Procedure for First Order Programs, in [Levi and Martelli '89], pp. 585–599.

    Google Scholar 

  19. E.L. Lusk and R.A. Overbeek (eds.), Logic Programming, Proceedings of the North American Conference 1989, MIT Press, 1989.

    Google Scholar 

  20. M.J. Maher, Complete Axiomatization of the Algebras of Finite, Rational and Infinite Trees, research report, IBM — T.J. Watson Research Center, Yorktown Heights, NY.

    Google Scholar 

  21. J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988.

    Google Scholar 

  22. J.A. Plaza, Fully Declarative Programming with Logic, Ph.D. Dissertation, City University of New York, 1990.

    Google Scholar 

  23. J.A. Plaza, Completeness for Propositional Logic Programs with Negation, in [Ras and Zemankova '91]. pp. 600–609.

    Google Scholar 

  24. J.A. Plaza, Operators on Lattices of Ω-Herbrand Interpretations, in [Taitslin and Nerode '92].

    Google Scholar 

  25. T.C. Przymusinski, On the Declarative Semantics of Deductive Databases and Logic Programs, in [Minker '88], pp. 193–216.

    Google Scholar 

  26. T.C. Przymusinski, On Constructive Negation in Logic Programming, in [Lusk and Overbeek '89], addendum.

    Google Scholar 

  27. T.C. Przymusinski, On the Declarative and Procedural Semantics of Logic Programs, Journal of Logic Programming, to appear.

    Google Scholar 

  28. Z.W. Ras and M. Zemankova (eds.), Methodologies for Intelligent Systems, Proceedings of the 6 th International Symposium, Lecture Notes in AI 542, Springer Verlag, Berlin-New York, 1991.

    Google Scholar 

  29. E.Y. Shapiro (ed.), Concurrent Prolog: Collected Papers, MIT Press, Cambridge MA, 1987.

    Google Scholar 

  30. J.C. Shepherdson, Negation in Logic Programming, in [Minker '88], pp. 19–88.

    Google Scholar 

  31. M.A. Taitslin and A. Nerode (eds.), Proceedings of the Symposium on Logical Foundations of Computer Science — Logic at Tver '92, Lecture Notes in Computer Science, Springer Verlag, 1992, to appear.

    Google Scholar 

  32. K. Ueda, Guarded Horn Clauses, in [Shapiro '87], vol.1, pp. 140–156.

    Google Scholar 

  33. A. Van Gelder, K.A. Ross, and J.S. Schlipf, The Well-founded Semantics for General Logic Programs, Journal of the ACM, Vol. 38, No. 3, July 1991, pp. 620–650.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Miami, Coral Gables, P.O. Box 249 085, 33124, Florida, USA

    Jan A. Plaza

Authors
  1. Jan A. Plaza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plaza, J.A. (1992). Fully declarative logic programming. In: Bruynooghe, M., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1992. Lecture Notes in Computer Science, vol 631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55844-6_151

Download citation

  • DOI: https://doi.org/10.1007/3-540-55844-6_151

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55844-6

  • Online ISBN: 978-3-540-47297-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation