Skip to content

Author

Berhan Oumer Adame

We have 1 of 8 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.