Olivier Bailleux

According to our database, Olivier Bailleux authored at least 24 papers between 1996 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Constraint Reductions.

Olivier Bailleux, Yacine Boufkhad

CoRR, 2020

2019

Subsumption-driven clause learning with DPLL+restarts.

Olivier Bailleux

CoRR, 2019

2015

SAT as a game.

Olivier Bailleux

CoRR, 2015

2012

Unit contradiction versus unit propagation

Olivier Bailleux

CoRR, 2012

2011

On the expressive power of unit resolution

Olivier Bailleux

CoRR, 2011

BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae

Olivier Bailleux

CoRR, 2011

2010

On the CNF encoding of cardinality constraints and beyond

Olivier Bailleux

CoRR, 2010

Evolving difficult SAT instances thanks to local search

Olivier Bailleux

CoRR, 2010

Reified unit resolution and the failed literal rule

Olivier Bailleux

CoRR, 2010

2009

New Encodings of Pseudo-Boolean Constraints into CNF.

Olivier Bailleux, Yacine Boufkhad, Olivier Roussel

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2007

Demonstration of the Universality of a New Cellular Automaton.

Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier, Pierre Collet

Int. J. Unconv. Comput., 2007

Research of Complexity in Cellular Automata through Evolutionary Algorithms.

Emmanuel Sapin, Olivier Bailleux, Jacqueline Chabrier

Complex Syst., 2007

2006

A Translation of Pseudo Boolean Constraints to SAT.

Olivier Bailleux, Yacine Boufkhad, Olivier Roussel

J. Satisf. Boolean Model. Comput., 2006

Some Computational Aspects of distance-sat.

Olivier Bailleux, Pierre Marquis

J. Autom. Reason., 2006

2004

Full CNF Encoding: The Counting Constraints Case.

Olivier Bailleux, Yacine Boufkhad

Proceedings of the SAT 2004, 2004

A New Universal Cellular Automaton Discovered by Evolutionary Algorithms.

Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier, Pierre Collet

Proceedings of the Genetic and Evolutionary Computation, 2004

2003

Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms.

Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier

Proceedings of the Genetic Programming, 6th European Conference, EuroGP 2003, 2003

Efficient CNF Encoding of Boolean Cardinality Constraints.

Olivier Bailleux, Yacine Boufkhad

Proceedings of the Principles and Practice of Constraint Programming, 2003

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms.

Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier

Proceedings of the Artificial Evolution, 2003

2001

Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat.

Alain Sidaner, Olivier Bailleux, Jean-Jacques Chabrier

Proceedings of the Artificial Evolution, 2001

1999

DISTANCE-SAT: Complexity and Algorithms.

Olivier Bailleux, Pierre Marquis

Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998

Local Search for Statistical Counting.

Olivier Bailleux

Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems.

Olivier Bailleux, Jean-Jacques Chabrier

Intell. Data Anal., 1997

1996

Approximate Resolution of Hard Numbering Problems.

Olivier Bailleux, Jean-Jacques Chabrier

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996