Show simple item record

dc.creator McDermott, Drew
dc.creator Doyle, Jon
dc.date 2004-10-01T20:33:11Z
dc.date 2004-10-01T20:33:11Z
dc.date 1978-08-01
dc.date.accessioned 2013-10-09T02:41:01Z
dc.date.available 2013-10-09T02:41:01Z
dc.date.issued 2013-10-09
dc.identifier AIM-486
dc.identifier http://hdl.handle.net/1721.1/5734
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description "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.
dc.format 38 p.
dc.format 10308025 bytes
dc.format 8120283 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-486
dc.title Non-Monotonic Logic I


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account