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?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.