Search Results for author: Guillaume Escamocher

Found 3 papers, 0 papers with code

Generating Difficult SAT Instances by Preventing Triangles

no code implementations8 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.

Variable and value elimination in binary constraint satisfaction via forbidden patterns

no code implementations12 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.