Formalizing nonmonotonic reasoning systems
Artificial Intelligence
The mathematics of inheritance systems
The mathematics of inheritance systems
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Cancellation in a parallel semantic network
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In Artificial Intelligence. well-understood reasoning systems and tractable reasoning systems have often seemed mutually exclusive. This has been exemplified by nonmonotonic reasoning formalisms and inheritance-with-exceptions reasoners. These have epitomized the two extremes: the former not even semidecidable, the latter completely ad hoc. We previously presented a formal mechanism for specifying inheritance systems. and minimal criteria for acceptable inheritance reasoning. This left open the problem of realizing an acceptable reasoner. Since then. Touretzky has developed a reasoner that appears to meet our criteria. We show that his reasoner is formally adequate, and explore some of the implications of this result vis-à-vis the study of non monotonic reasoning.