This paper presents a major revision 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.

PDF, PS

In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pp. 1135-1140, Chambery, France, August 1993.

@InProceedings{baffes:ijcai93, title={Symbolic Revision of Theories With M-of-N Rules}, author={Paul T. Baffes and Raymond J. Mooney}, booktitle={Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93)}, month={August}, address={Chambery, France}, key={NEITHER}, pages={1135-1140}, url="http://www.cs.utexas.edu/users/ai-lab?baffes:ijcai93", year={1993} }