A Default Interpretation of Defeasible Network
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 156-160.
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.
@inproceedings{ijcai1997p24,
title = {A Default Interpretation of Defeasible Network},
author = {Wang, Xianchang and You, Jia-Huai and Yuan, Li-Yan},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {156--160},
year = {1997},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1997/24},
}
TY - CPAPER TI - A Default Interpretation of Defeasible Network AU - Wang, Xianchang AU - You, Jia-Huai AU - Yuan, Li-Yan T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 156 EP - 160 UR - https://ijcai.org/proceedings/1997/24 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
