Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 1995: Logic Programming and Nonmonotonic Reasoning pp 245–258Cite as

Default consequence relations as a logical framework for logic programs

  • Conference paper
  • First Online:

  • 154 Accesses

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

Abstract

We consider the use of default consequence relations suggested in [1,2] as a ‘logical basis’ for normal logic programs. We give a representation of major semantics for logic programs in this framework and study the question what kind of default reasoning is appropriate for them. It is shown, in particular, that default consequence relations based on three-valued inference are adequate for these semantics.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bochman (1994) On the relation between default and modal consequence relations Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning, KR'94, Morgan Kaufmann, San Mateo, CA., pp. 63–74.

    Google Scholar 

  2. A. Bochman (1993) Modal nonmonotonic logics demodalized. Annals of Mathematics and Artificial Intelligence (to appear).

    Google Scholar 

  3. J. Chen and S. Kundu (1991) The strong semantics for logic programs. Methodologies for Intelligent Systems (LNAI 542), Z. W. Ras and M. Zamenkova (eds.), Springer Verlag, pp. 490–499.

    Google Scholar 

  4. M. C. Fitting (1985) A Kripke-Kleene semantics for logic programs. JLP 2: 295–312.

    Google Scholar 

  5. M. C. Fitting (1993) The family of stable models. JLP 17: 197–225.

    Google Scholar 

  6. D. M. Gabbay (1976). Investigations in Modal and Tense Logics. Dordrecht: D. Reidel.

    Google Scholar 

  7. M. Gelfond and V. Lifschitz (1988) The stable model semantics for logic programming Proc. 5th International Conf./Symp. on Logic Programming, R. Kowalski and K. Bowen (eds.), MIT Press: Cambridge, MA, pp. 1070–1080.

    Google Scholar 

  8. S. Kraus, D. Lehmann and M. Magidor (1990) Nonmonotonic reasoning, peferential models and cumulative logics. Artificial Intelligence, 44: 167–207.

    Google Scholar 

  9. E. Laenens, D. Vermeir and C. Zaniolo (1992) Logic programming semantics made easy. Automata, Languages and Programming (LNCS 623), Springer, pp. 499–508.

    Google Scholar 

  10. W. Marek, A. Nerode and J. Remmel (1990) A theory of nonmonotonic rule systems I Annals of Mathematics and Artificial Intelligence, 1: 241–273.

    Google Scholar 

  11. W. Marek and V.S. Subrahmanian (1992) The relationship between stable, supported, default and autoepistemic semantics for general logic programs. Theoretical Computer Science, 103: 365–386.

    Google Scholar 

  12. W. Marek and M. Truszczyński (1989) Stable semantics for logic programs and default theories. Proc. 1989 North Amer. Conf. on Logic Programming, MIT Press: Cambridge, MA, pp. 243–256.

    Google Scholar 

  13. R. C. Moore (1985). Semantical considerations on non-monotonic logic. Artificial Intelligence 25:75–94.

    Google Scholar 

  14. H. Przymusinska and T. Przymusinski (1990) Semantic issues in deductive databases and logic programs, in R. Benerji (ed.) Formal Techniques in Artificial Intelligence, North-Holland: Amsterdam, pp. 321–367.

    Google Scholar 

  15. T.C. Przymusinski (1990) Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae, 13: 445–463.

    Google Scholar 

  16. T. Przymusinski (1991) Three-valued nonmonotonic formalisms and semantics of logic programs. Artificial Intelligence, 49: 309–343.

    Google Scholar 

  17. R. Reiter (1980). A logic for default reasoning. Artificial Intelligence 13:81–132.

    Google Scholar 

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

    Google Scholar 

  19. H. Thiele On generation of cumulative inference operators by default deduction rules. LNAI 543, Springer Verlag, pp. 100–137.

    Google Scholar 

  20. A. Van Gelder, K.A. Ross and J.S. Schlipfn (1991) The well-founded semantics for general logic programs. J. ACM, 38: 620–650.

    Google Scholar 

Download references

Authors
  1. Alexander Bochman
    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

Bochman, A. (1995). Default consequence relations as a logical framework for logic programs. 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_18

Download citation

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

  • 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