## An SE-tree-based Prime Implicant Generation Algorithm (1994)

Venue: | IEEE Trans |

Citations: | 9 - 1 self |

### BibTeX

@ARTICLE{Rymon94anse-tree-based,

author = {Ron Rymon},

title = {An SE-tree-based Prime Implicant Generation Algorithm},

journal = {IEEE Trans},

year = {1994},

volume = {11}

}

### OpenURL

### Abstract

Prime implicants/implicates (PIs) have been shown to be a useful tool in several problem domains. In Model-Based Diagnosis (MBD), [de Kleer et al. 90] have used PIs to characterize diagnoses. We present a PI generation algorithm which, although based on the general SE-tree-based search framework, is effectively an improvement of a particular PI generation algorithm proposed by [Slagle et al. 70]. The improvement is achieved via a decomposition tactic which is boosted by the SE-tree-based framework. The new algorithm is also more flexible in a number of ways. We present empirical results comparing the new algorithm to the old one, as well as to current PI generation algorithms. 1 Introduction Prime implicates/implicants (PIs) were a topic of great interest to researchers in the early days of computer science, in part because of their use in procedures for boolean function minimization [Quine 52]. A number of algorithms were developed, including [Quine 52], [Karnaugh 53], [McCluskey 56]...