Heuristics for Thelen's Prime Implicant Method
Jacek Bieganowski, Andrei G. Karatkevich · 2005
Thelen’s algorithm is an efficient method for generation of the prime implicants of a Boolean function represented in CNF. In the paper new heuristics are presented, allowing to accelerate the algorithm. Experimental analysis of their effects is performed.