1 code implementation • 2 Sep 2021 • Daniel Le Berre, Romain Wallon
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers.
1 code implementation • 27 Jul 2021 • Romain Wallon
While it is well known that learning the first assertive clause produced during conflict analysis ensures to perform the highest possible backjump in a SAT solver, we show that there is no such guarantee in the presence of PB constraints.
no code implementations • 8 Dec 2020 • Danel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon
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 solvers.
no code implementations • 9 May 2020 • Daniel Le Berre, Pierre Marquis, Romain Wallon
While none of them performs better than the others on all benchmarks, applying weakening on the conflict side has surprising good performance, whereas applying partial weakening and division on both the conflict and the reason sides provides the best results overall.
no code implementations • 9 May 2019 • Stefan Mengel, Romain Wallon
Here we consider the expressivity of these formulas in the model of clausal encodings with auxiliary variables.
