Parallelism in Inheritance Hierarchies with Exceptions
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 194-201.
Abstract
In a recent paper, Etherington & Reiter formalized a simple version of semantic networks with exceptions in terms of Reiter's Default Logic. With this approach they were able to formally characterize the correctness of an in Ference algorithm in terms of Default Logic, and exhibited an algorithm that was correct in this sense. Finally, they concluded that massively parallel architectures for semantic networks. such as N ETL apparently cannot implement this algorithm. In this paper, we present a different massively parallel architecture for the simplified semantic networks outlined in their paper which appears to avoid the objections to NETL. We also present some results of simulations in this framework of the examples presented in Etherington and Reiter.
@inproceedings{ijcai1985p36,
title = {Parallelism in Inheritance Hierarchies with Exceptions},
author = {Cottrell, Garrison W.},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {194--201},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/36},
}
TY - CPAPER TI - Parallelism in Inheritance Hierarchies with Exceptions AU - Cottrell, Garrison W. T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 194 EP - 201 UR - https://ijcai.org/proceedings/1985/36 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
