Symbolic Revision of Theories with M-of-N Rules

This paper presents a major revision of the Either propositional theory re nement system. Two issues are discussed. First, we show howrun timee ciency can be greatlyimproved by changing from a exhaustive scheme for computing repairs to an iterative greedy method. Second, we show how to extend Either to re ne M-of-N rules. The resulting algorithm, Neither New Either, is more than an order of magnitude faster and produces signi cantly more accurate results with theories that t 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 re ning the DNA promoter domain theory.

• Type: Conference
• Year: 1993
• Where: IJCAI
• Authors: Paul T. Baffes, Raymond J. Mooney
• Keywords: IJCAI 1993, IJCAI 2007, Iterative Greedy Method, Ne M-of-n Rules, Propositional Theory