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).
Original language | English |
---|---|
Title of host publication | 6th Conference on Automated Deduction |
Editors | D.W. Loveland |
Publisher | Springer Verlag |
Pages | 260-273 |
Number of pages | 14 |
ISBN (Print) | 9783540115588 |
DOIs | |
State | Published - 1982 |
Event | 6th Conference on Automated Deduction, CADE 1982 - New York, United States Duration: 7 Jun 1982 → 9 Jun 1982 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 138 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 6th Conference on Automated Deduction, CADE 1982 |
---|---|
Country/Territory | United States |
City | New York |
Period | 7/06/82 → 9/06/82 |
Bibliographical note
Publisher Copyright:© 1982, Springer-Verlag.