{"type":"ScholarlyArticle","title":"A Default Interpretation of Defeasible Network","authors":[{"name":"Xianchang Wang","slug":"xianchang-wang","given":"Xianchang","family":"Wang","affiliation":""},{"name":"Jia-Huai You","slug":"jia-huai-you","given":"Jia-Huai","family":"You","affiliation":""},{"name":"Li-Yan Yuan","slug":"li-yan-yuan","given":"Li-Yan","family":"Yuan","affiliation":""}],"abstract":"This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and inconsistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theories while preserving Horty's pathoff 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 credulous semantics, the regular semantics, both of which are defined for any defeasible network. Furthermore, we show that these semantics are based on the same principle of specificity used by Horty in defining his credulous semantics of defeasible networks.","doi":null,"url":"https://ijcai.org/proceedings/1997/24","pdf":"https://ijcai.org/proceedings/1997/0024.pdf","markdown":"https://ijcai.org/proceedings/1997/24.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/24","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":24,"pages":{"first":156,"last":160},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}