Show simple item record

Non-Monotonic Logic I

dc.date.accessioned2004-10-01T20:33:11Z
dc.date.accessioned2018-11-24T10:10:19Z
dc.date.available2004-10-01T20:33:11Z
dc.date.available2018-11-24T10:10:19Z
dc.date.issued1978-08-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5734
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/5734
dc.description.abstract"Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence of incomplete information, must make and subsequently revise predictions in light of new observations. We present the motivation and history of such logics. We develop model and proof theories, a proof procedure, and applications for one important non-monotonic logic. In particular, we prove the completeness of the non-monotonic predicate calculus and the decidability of the non-monotonic sentential calculus. We also discuss characteristic properties of this logic and its relationship to stronger logics, logics of incomplete information, and truth maintenance systems.en_US
dc.format.extent38 p.en_US
dc.format.extent10308025 bytes
dc.format.extent8120283 bytes
dc.language.isoen_US
dc.titleNon-Monotonic Logic Ien_US


Files in this item

FilesSizeFormatView
AIM-486.pdf8.120Mbapplication/pdfView/Open
AIM-486.ps10.30Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record