Computational Complexity of Hypothesis Assembly
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 1112-1118.
Abstract
The problem of finding a best explanation of a set of data has been a topic of much interest in Artificial Intelligence. In this paper we present an approach to this problem by hypothesis assembly. We present this approach formally so that we can examine the time complexity and correctness of the algorithms. We then examine a system implemented using this approach, which performs red blood antibody identification. We use this domain to examine the ramifications of the assumptions of the formal model in a real world situation. We also briefly compare this approach to other assembly approaches in terms of time complexity and reliance on assumptions.
@inproceedings{ijcai1987p225,
title = {Computational Complexity of Hypothesis Assembly},
author = {Allemang, Dean and Tanner, Michael C. and Bylander, Tom and Josephson, John R.},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {1112--1118},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/225},
}
TY - CPAPER TI - Computational Complexity of Hypothesis Assembly AU - Allemang, Dean AU - Tanner, Michael C. AU - Bylander, Tom AU - Josephson, John R. T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 1112 EP - 1118 UR - https://ijcai.org/proceedings/1987/225 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
