A few months ago I tried to write a Binate Covering Problem (BCP) solver, and haven't yet gotten it working.
But today I realized that writing one is a waste of time. BCP can be solved by a Max-SAT solver, and a huge amount of effort has been invested by very smart people to make those work efficiently. My feeble attempt at a BCP solver couldn't possibly do better.
Here's Python code to solve BCP using Z3's Python bindings:
https://github.com/brouhaha/bcp-z3-python
#BCP #BinateCoveringProblem #SAT #Z3
