3 citations · 5 across the 5 of their papers we have counts for
5 papers
On the expressive power of unit resolution
Olivier Bailleux
This preliminary report addresses the expressive power of unit resolution regarding input data encoded with partial truth assignments of propositional variables. A characterization…
BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae
Olivier Bailleux
BoolVar/PB is an open source java library dedicated to the translation of pseudo-Boolean constraints into CNF formulae. Input constraints can be categorized with tags. Several enco…
On the CNF encoding of cardinality constraints and beyond
Olivier Bailleux
In this report, we propose a quick survey of the currently known techniques for encoding a Boolean cardinality constraint into a CNF formula, and we discuss about the relevance of…
Evolving difficult SAT instances thanks to local search
Olivier Bailleux
We propose to use local search algorithms to produce SAT instances which are harder to solve than randomly generated k-CNF formulae. The first results, obtained with rudimentary se…
Reified unit resolution and the failed literal rule
Olivier Bailleux
Unit resolution can simplify a CNF formula or detect an inconsistency by repeatedly assign the variables occurring in unit clauses. Given any CNF formula sigma, we show that there…