Cancellation in a Parallel Semantic Network
Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Nowledge Representation. Pages 257-262.
Abstract
Handling exceptions to general rules is a persistent and difficult problem in systems for representing knowledge. In semantic networks, this often takes the form of cancelling some item of information, such as membership in a class, that would otherwise be inherited from a higher level description in the type hierarchy. Some conceptually clean approaches to cancellation lead to great inefficiency in accessing the information in the network, and can negate much of the speed advantage that would otherwise be possible in a parallel network system such as NETL. In this paper we explore some of the interactions between cancellation and parallelism in semantic networks, and we propose a cancellation scheme that appears to be workable for NETL-Iike systems.
@inproceedings{ijcai1981p53,
title = {Cancellation in a Parallel Semantic Network},
author = {Fahlman, Scott E. and Touretzky, David S. and van Roggen, Walter},
booktitle = {Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, {IJCAI-81}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Roger C. Schank},
pages = {257--262},
year = {1981},
month = {8},
note = {Nowledge Representation},
url = {https://ijcai.org/proceedings/1981/53},
}
TY - CPAPER TI - Cancellation in a Parallel Semantic Network AU - Fahlman, Scott E. AU - Touretzky, David S. AU - van Roggen, Walter T2 - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81 PB - International Joint Conferences on Artificial Intelligence PY - 1981 SP - 257 EP - 262 UR - https://ijcai.org/proceedings/1981/53 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
