Intuitionistic basis for non-monotonic logic (original) (raw)
- 171 Accesses
- 37 Citations
- 2 Altmetric
Abstract
McDermott and Doyle [4] suggested a system, denoted by ⊢, of non-monotonic logic. This notion was intended to formalise non-monotonic reasoning as involved in real situations and in artificial intelligence. McDermott and Doyle also list in their paper several difficulties and problems in their approach. Their semantics seems to be inadequate and there are several counterintuitive results obtained in their system.
McDermott and Doyle base their provability notion ⊢ on the provability notion ⊢ of classical logic. We introduce in this note two logical systems based on the provability notion ⊩ of intuitionistic logic. We show that in the resulting nonmonotonic logic most of the problems disappear. We further show that intuitionistic ⊩ is indeed the reasoning adopted implicitly by available TMS (Truth Maintainance Systems).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
- D.M. Gabbay, Investigations in Modal and Tense Logic with Applications, D. Reidel, 1976.
Google Scholar - D.M. Gabbay, Semantical Investigations in Heytings' Intuitionistic Logic, D. Reidel, 1981.
Google Scholar - John McCarthy, Circumscription: A form of non-monotonic reasoning, in Artificial Intelligence 13 (1980), pp. 27–39.
Article Google Scholar - D. McDermott and J. Doyle, Non-monotonic logic I, in Artificial Integlligence 13 (1980), pp. 41–72.
Article Google Scholar - R. Reiter, A logic for default reasoning, in Artificial Intelligence 13 (1980), pp. 81–132.
Article Google Scholar
Author information
Authors and Affiliations
- University of Stuttgart, USA
Dov M. Gabbay (Project Rohrer) - Bar-Ilan University, USA
Dov M. Gabbay (Project Rohrer)
Editor information
D. W. Loveland
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabbay, D.M. (1982). Intuitionistic basis for non-monotonic logic. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000064
Download citation
- .RIS
- .ENW
- .BIB
- DOI: https://doi.org/10.1007/BFb0000064
- Published: 07 September 2005
- Publisher Name: Springer, Berlin, Heidelberg
- Print ISBN: 978-3-540-11558-8
- Online ISBN: 978-3-540-39240-8
- eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.