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.
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 • 24 Oct 2014 • Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.
no code implementations • 6 May 2014 • Daniel Le Berre
The NMR community would like to build a repository of benchmarks to push forward the design of systems implementing NMR as it has been the case for many other areas in AI.
