research
∙
06/03/2020
Constraint Reductions
This is a commentary on the CP 2003 paper "Efficient cnf encoding of boo...
share
research
∙
06/18/2019
Subsumption-driven clause learning with DPLL+restarts
We propose to use a DPLL+restart to solve SAT instances by successive si...
research
∙
11/03/2015
SAT as a game
We propose a funny representation of SAT. While the primary interest is ...
research
∙
04/03/2012
Unit contradiction versus unit propagation
Some aspects of the result of applying unit resolution on a CNF formula ...
research
∙
06/17/2011
On the expressive power of unit resolution
This preliminary report addresses the expressive power of unit resolutio...
research
∙
03/21/2011
BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae
BoolVar/PB is an open source java library dedicated to the translation o...
research
∙
12/17/2010
On the CNF encoding of cardinality constraints and beyond
In this report, we propose a quick survey of the currently known techniq...
research
∙
11/26/2010
Evolving difficult SAT instances thanks to local search
We propose to use local search algorithms to produce SAT instances which...
research
∙
11/12/2010
