21 citations · 26 across the 4 of their papers we have counts for
5 papers
Generation and Prediction of Difficult Model Counting Instances
Guillaume Escamocher, Barry O'Sullivan
We present a way to create small yet difficult model counting instances. Our generator is highly parameterizable: the number of variables of the instances it produces, as well as t…
Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior
Guillaume Escamocher, Barry O'Sullivan
We present in this paper our solver for logic grid puzzles. The approach used by our algorithm mimics the way a human would try to solve the same problem. Every progress made durin…
Generating Difficult SAT Instances by Preventing Triangles
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. A recent development in the search for such methods has led to the Balance…
Variable and value elimination in binary constraint satisfaction via forbidden patterns
David A. Cohen, Martin C. Cooper, Guillaume Escamocher +1
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (val…
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Martin C. Cooper, Guillaume Escamocher
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of…