An algorithm to generate prime implicants and its application to the selection problem

Authors:
Richard C. T. Lee
Affiliations:
-
Venue:
Information Sciences: an International Journal
Year:
1972

Citing 3
Cited 0

Experiments With Some Programs That Search Game Trees

Journal of the ACM (JACM)
Application of game tree searching techniques to sequential pattern recognition

Communications of the ACM
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, the algorithm to generate prime implicants presented in Ref. 5 is extended to a new algorithm. The new algorithm does not require the Boolean function to be in conjunctive normal form and is complete in the sense that it generates all the prime implicants. The author also shows that this new algorithm can be used to efficiently solve the selection problem ^[^4^]. By using this algorithm, the original selection problem can be solved by a branch-and-bound approach ^[^1^] which avoids an exhaustive search of the solution space and reduces the amount of necessary calculations.