This paper studies the semantics for the class of all defeasible (inheritance) networks ,including cyclic and inconsistent networks using a trans-formaiton approach. First we show that defeasible networks can be translated, tractably, to default theorises whil preserving Horty's path-off credulous semantics for all consistent networks. Using the existing methods in dealing with the semantics of default logic, we are able to provide a tractable skeptical semantics, the well-founded semantics, and a new cedulous semantics, the regular semantics, both of which are defined for any defeasible network. Furthermore, we shwo that these semantics are based on the same principle of specificity used by Horty in defining his credulous semantics of defeasible networks.
展开▼
