Skip to main content
SpringerLink
Log in

On the extension of logic programming with negation through uniform proofs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 928))

Abstract

In the past, logic program semantics have been studied often separately from the underlying proof system, and this, consequently, leads to a somewhat confusing status of semantics. In this paper we show that elegant, yet natural semantics can be obtained by building a mechanism of justifying default assumptions on top of a proof system. In particular, we propose extended logic programming languages with negation through uniform proofs. The result is a very general framework, in which any abstract logic programming language can be extended to a nonmonotonic reasoning system, and many semantics, previously proposed and new, can be characterized and understood in terms of uniform proofs.

Currently on leave at the ISIS, Fujitsu Labs, Numazu, Shizuoka, Japan.

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. C. R. Baral and V. S. Subrahmanian. Stable and extension class theory for logic programs and default logics. Journal of Automated Reasoning, 8:345–366, 1992.

    Google Scholar 

  2. G. Brewka. Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence, 50:183–205, 1994.

    Google Scholar 

  3. J. Dix. A classification theory of semantics of normal logic programs: II. weak properties. to appear, 1994.

    Google Scholar 

  4. P. M. Dung. Negations as hypotheses: an abductive foundation for logic programming. In Proceedings of the 8th ICLP, pages 3–17, 1991.

    Google Scholar 

  5. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–386, 1991.

    Google Scholar 

  6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pages 1070–1080, The MIT Press, 1988.

    Google Scholar 

  7. A. Kakas, P. Mancarella, and P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP, pages 504–519, 1994.

    Google Scholar 

  8. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.

    Google Scholar 

  9. L.M. Pereira, J.J. Alferes, C.V. Damasio, and J.N. Aparicio. Adding closed world assumptions to well-founded semantics. Theoretical Computer Science, 122:49–68, 1993.

    Google Scholar 

  10. T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216, Morgan Kaufmann Publishers, 1988.

    Google Scholar 

  11. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial intelligence, 1994. (To appear).

    Google Scholar 

  12. T. C. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Foundamenta Informaticae, 13:445–463, 1990.

    Google Scholar 

  13. C. Sakama and K. Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145–172, 1994.

    Google Scholar 

  14. J.S. Schlipf. Formalizing a logic for logic programming. Annals of Mathematics and Artificial Intelligence, 5:279–302, 1992.

    Google Scholar 

  15. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. JACM, 38:620–650, 1991.

    Google Scholar 

  16. J.-H. You and L. Y. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, 22(3):209–219, 1995.

    Google Scholar 

  17. J.-H. You and L. Y. Yuan. A three-valued semantics of deductive databases and logic programs. Journal of Computer and System Science, 49:334–361, 1994. The preliminary version appears in the Proc. of the 9th ACM PODS, page 171–182, 1990.

    Google Scholar 

  18. L. Y. Yuan. Autoepistemic logic of first order and its expressive power. Journal of Automated Reasoning, 13:69–82, 1994.

    Google Scholar 

  19. L. Y. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. Journal of Automated Reasoning, 10:143–160, 1993.

    Google Scholar 

  20. L.Y. Yuan and J.-H. You. On coherence approach to logic program revision. In Proc. of the 12th ICLP, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, T6G 2H1, Edmonton, Canada

    Li Yan Yuan & Jia Huai You

Authors
  1. Li Yan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Wiktor Marek Anil Nerode M. Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, L.Y., You, J.H. (1995). On the extension of logic programming with negation through uniform proofs. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-59487-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59487-1

  • Online ISBN: 978-3-540-49282-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation