Skip to main content
Springer Nature Link
Log in

Notions of nonmonotonic derivability

  • Conference paper
  • First Online:
Nonmonotonic and Inductive Logic (NIL 1990)

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

Included in the following conference series:

  • 132 Accesses

Abstract

The purpose of this paper is to discuss various notions of nonmonotonic derivability from a conceptual point of view and to give a classification of some important forms of nonmonotonic derivability.

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.L. Clark, Negation as failure, in: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, New York, 1978.

    Google Scholar 

  2. P.G. Hinman, Recursion-Theoretic Hierarchies, Springer, Berlin, 1978.

    Google Scholar 

  3. G. Jäger, Some contributions to the logical analysis of circumscription, in: Proceedings of CADE 86 — 8th International Conference on Automated Deduction, Lecture Notes in Computer Science 230, Springer, Berlin, 1986.

    Google Scholar 

  4. G. Jäger, Non-monotonic reasoning by axiomatic extensions, in: J.E. Fenstad, I.T. Frolow and R. Hilpinen, Proceedings 8th International Congress Logic, Methodology and Philosophy of Science, North-Holland, Amsterdam, 1989.

    Google Scholar 

  5. V. Lifschitz, Closed world data bases and circumscription, Artificial Intelligence 27 (1985).

    Google Scholar 

  6. V. Lifschitz, On the satisfiability of circumscription, Artificial Intelligence 28 (1986).

    Google Scholar 

  7. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin 1987 (second, extended edition).

    Google Scholar 

  8. J. McCarthy, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13 (1980).

    Google Scholar 

  9. J. McCarthy, Applications of circumscription to formalizing common sense knowledge, Artificial Intelligence 28 (1986).

    Google Scholar 

  10. D. McDermott, Nonmonotonic logic II: nonmonotonic modal theories, Journal of the ACM 29 (1982).

    Google Scholar 

  11. D. McDermott and J. Doyle, Non-monotonic logic I, Artificial Intelligence 13 (1980).

    Google Scholar 

  12. R.C. Moore, Possible-world semantics for autoepistemic logic, in: Proceedings Nonmonotonic Reasoning Workshop, New Paltz, NY, 1984.

    Google Scholar 

  13. R.C. Moore, Semantical considerations on nonmonotonic logic, Artificial Intelligence 25 (1985).

    Google Scholar 

  14. Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.

    Google Scholar 

  15. R. Reiter, On closed world data bases, in: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, New York, 1978.

    Google Scholar 

  16. J.R. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, Mass., 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und angewandte Mathematik, Universität Bern, Switzerland

    Gerhard Jäger

Authors
  1. Gerhard Jäger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dix K. P. Jantke P. H. Schmitt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jäger, G. (1991). Notions of nonmonotonic derivability. In: Dix, J., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1990. Lecture Notes in Computer Science, vol 543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023318

Download citation

  • DOI: https://doi.org/10.1007/BFb0023318

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54564-4

  • Online ISBN: 978-3-540-38469-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics