I'm looking into computing the prime implicants of a Boolean function. I have found many different algorithms in the literature, many of them relying on SAT solvers. However, I have not been able to find a SAT solver that already provides this feature. Are there any?
Similarly, are there any SAT solvers/SMT solvers/related tools out there that work efficiently in practice for minimizing Boolean formulas?
