Skip to main content
SpringerLink
Log in

Logical characterizations of nonmonotonic TMSs

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1989 (MFCS 1989)

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

Abstract

Nonmonotonic truth maintenance systems (TMSs) have been widely used without a clear appreciation of their capabilities and limitations. This paper characterizes the logical inferences performed by a nonmonotonic TMS in terms of two formalisms of independent interest, namely logic programming with the stable set semantics and autoepistemic logic. The paper also shows that implementing a nonmonotonic TMS is an NP-complete problem.

A full version of this paper, including detailed proofs, will appear in a journal.

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. Allen L. Brown and Yoav Shoham. New results on semantical nonmonotonic reasoning. Available from the authors, January 1988.

    Google Scholar 

  2. Allen L. Brown. Modal propositional semantics for reason maintenance systems. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 178–184, 1985.

    Google Scholar 

  3. Eugene Charniak, Christopher K. Riesbeck, and Drew V. McDermott. Artificial Intelligence Programming, chapter 16. Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1980. Second edition, 1987.

    Google Scholar 

  4. Jon Doyle. A truth-maintenance system. Artificial Intelligence, 12:231–272, 1979.

    Google Scholar 

  5. Jon Doyle. The ins and outs of reason maintenance. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, 1983.

    Google Scholar 

  6. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Fifth International Conference Symposium on Logic Programming, pages 1070–1080, 1988.

    Google Scholar 

  7. James W. Goodwin. A process theory of non-monotonic inference. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 185–187, 1985.

    Google Scholar 

  8. David A. McAllester. Personal communication, 1987.

    Google Scholar 

  9. Robert Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75–94, 1985.

    Google Scholar 

  10. Paul H. Morris. Stable closures, defeasible logic, and contradiction tolerant reasoning. In Proceedings of the National Conference on Artificial Intelligence, pages 506–511, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox Palo Alto Research Center and Department of Computer Science, Cornell University, USA

    Charles Elkan

Authors
  1. Charles Elkan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elkan, C. (1989). Logical characterizations of nonmonotonic TMSs. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation