Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6577Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Stein, Lynn Andrea | - |
| dc.date | 2004-10-08T20:28:54Z | - |
| dc.date | 2004-10-08T20:28:54Z | - |
| dc.date | 1991-08-01 | - |
| dc.date.accessioned | 2013-10-09T02:46:06Z | - |
| dc.date.available | 2013-10-09T02:46:06Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1316 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6577 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This paper describes a theory of inheritance theories. We present an original theory of inheritance in nonmonotonic hierarchies. The structures on which this theory is based delineate a framework that subsumes most inheritance theories in the literature, providing a new foundation for inheritance. * Our path-based theory is sound and complete w.r.t. a direct model-theoretic semantics. * Both the credulous and the skeptical conclusions of this theory are polynomial-time computable. * We prove that true skeptical inheritance is not contained in the language of path-based inheritance. Because our techniques are modular w.r.t. the definition of specificity, they generalize to provide a unified framework for a broad class of inheritance theories. By describing multiple inheritance theories in the same "language" of credulous extensions, we make principled comparisons rather than the ad-hoc examination of specific examples makes up most of the comparative inheritance work. | - |
| dc.format | 7847601 bytes | - |
| dc.format | 6345355 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1316 | - |
| dc.title | Resolving Ambiguity in Nonmonotonic Inheritance Hierarchies | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.