Computing prime implicates
Peter E. Jackson · 1992
This paper surveys three methods for computing the prime implicates of a set of propositions (ie., minimizing a boolean function) and performs a comparison between them. Data is provided which suggests that methods based on resolution can be as efficient as methods based on matrices and semantic trees. We also discuss the advantages of resolution-based methods for applications in man-machine communication involving abduction (inference to the best explanation) and truth maintenance (belief revision).