1 citations · 1 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.AI2020
On Irrelevant Literals in Pseudo-Boolean Constraint Learning
Danel Le Berre, Pierre Marquis, Stefan Mengel +1
Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning sol…
cs.AI2020
On Weakening Strategies for PB Solvers
Daniel Le Berre, Pierre Marquis, Romain Wallon
Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generaliz…