On Inheritance Hierarchies with Exceptions
Abstract
Using default logic, we formalize NETL-like inheritance hierarchies with exceptions. This provides a number of benefits: (1) A precise semantics for such hierarchies. (2) A provably correct (with respect to the proof theory of default logic) inference algorithm for acyclic networks. (3) A guarantee that acyclic networks have extensions. (4) A provably correct quasi-parallel inference algorithm for such networks. 1.
Cite
Text
Etherington and Reiter. "On Inheritance Hierarchies with Exceptions." AAAI Conference on Artificial Intelligence, 1983.Markdown
[Etherington and Reiter. "On Inheritance Hierarchies with Exceptions." AAAI Conference on Artificial Intelligence, 1983.](https://mlanthology.org/aaai/1983/etherington1983aaai-inheritance/)BibTeX
@inproceedings{etherington1983aaai-inheritance,
title = {{On Inheritance Hierarchies with Exceptions}},
author = {Etherington, David W. and Reiter, Raymond},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1983},
pages = {104-108},
url = {https://mlanthology.org/aaai/1983/etherington1983aaai-inheritance/}
}