Intuitionistic basis for non-monotonic logic

Dov M. Gabbay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

26 Scopus citations


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).

Original languageEnglish
Title of host publication6th Conference on Automated Deduction
EditorsD.W. Loveland
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540115588
StatePublished - 1982
Event6th Conference on Automated Deduction, CADE 1982 - New York, United States
Duration: 7 Jun 19829 Jun 1982

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume138 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th Conference on Automated Deduction, CADE 1982
Country/TerritoryUnited States
City New York

Bibliographical note

Publisher Copyright:
© 1982, Springer-Verlag.


Dive into the research topics of 'Intuitionistic basis for non-monotonic logic'. Together they form a unique fingerprint.

Cite this