Symbolic Revision of Theories with M-of-N Rules
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 1135-1141.
Abstract
This paper presents a major rev1s1on of the EITHER propositional theory refinement system. Two issues are discussed. First, we show how run time efficiency can be greatly improved by changing from a exhaustive scheme for computing repairs to an iterative greedy method . Second, we show how to extend EITHER to refine M-of-N rules. The resulting algorithm, NEITHER (New EITHER), is more than an order of magnitude faster and produces significantly more accurate results with theories that fit the M-of-N format. To demonstrate the advantages of NEITHER, we present preliminary experimental results comparing it to EITHER and various other systems on refining the DNA promoter domain theory.
@inproceedings{ijcai1993p157,
title = {Symbolic Revision of Theories with M-of-N Rules},
author = {Baffes, Paul T. and Mooney, Raymond J.},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {1135--1141},
year = {1993},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1993/157},
}
TY - CPAPER TI - Symbolic Revision of Theories with M-of-N Rules AU - Baffes, Paul T. AU - Mooney, Raymond J. T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 1135 EP - 1141 UR - https://ijcai.org/proceedings/1993/157 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
