A Default Interpretation of Defeasible Network
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 offpath 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. 1 Introduction Two fundamental problems are to be addressed in this paper. First, the semantics of defeasible networks has previously been studied mainly under the assumption that such a network is acyclic and consistent. There is...
Cite
Text
Wang et al. "A Default Interpretation of Defeasible Network." International Joint Conference on Artificial Intelligence, 1997.Markdown
[Wang et al. "A Default Interpretation of Defeasible Network." International Joint Conference on Artificial Intelligence, 1997.](https://mlanthology.org/ijcai/1997/wang1997ijcai-default/)BibTeX
@inproceedings{wang1997ijcai-default,
title = {{A Default Interpretation of Defeasible Network}},
author = {Wang, Xianchang and You, Jia-Huai and Yuan, Li-Yan},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1997},
pages = {156-161},
url = {https://mlanthology.org/ijcai/1997/wang1997ijcai-default/}
}