no code implementations • 6 Dec 2022 • Guillaume Escamocher, Barry O'Sullivan
We present a way to create small yet difficult model counting instances.
no code implementations • 15 Oct 2019 • Guillaume Escamocher, Barry O'Sullivan
We present in this paper our solver for logic grid puzzles.
no code implementations • 8 Mar 2019 • Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich
When creating benchmarks for SAT solvers, we need SAT instances that are easy to build but hard to solve.
no code implementations • 12 Feb 2015 • David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivny
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size.