Trimming Pseudo-Boolean Proofs
This work presents a proof trimmer for Boolean satisfiability solving, and shows how this technique can be used to reduce proof size and proof checking time for richer combinatorial paradigms.
Berhan Oumer Adame, Bart Bogaerts, Benjamin Bogø et al.
· 0 citations