Skeptical Inheritance: Computing the Intersection of Credulous Extensions
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Commonsense Reasoning. Pages 1153-1159.
Abstract
Ideally skeptical inheritance supports exactly those inferences true in every credulous extension of an inheritance hierarchy. We provide a formal definition of ideally skeptical inheritance. We show that two path -based approaches fail to capture ideally skeptical inheritance, and that there are inheritance hierarchies for which there are more always-true inferences than always-supported paths. We describe an ATMS-like scheme that computes ideally skeptical inheritance and represents hierarchical dependencies using a limited form of Boolean satisfiability. Finally, we demonstrate a preemption (specificity) strategy for which ideally skeptical inheritance is polynomial-time computable.
@inproceedings{ijcai1989p185,
title = {Skeptical Inheritance: Computing the Intersection of Credulous Extensions},
author = {Stein, Lynn Andrea},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {1153--1159},
year = {1989},
month = {8},
note = {Commonsense Reasoning},
url = {https://ijcai.org/proceedings/1989/185},
}
TY - CPAPER TI - Skeptical Inheritance: Computing the Intersection of Credulous Extensions AU - Stein, Lynn Andrea T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 1153 EP - 1159 UR - https://ijcai.org/proceedings/1989/185 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
