| Efficient CNF encoding of boolean cardinality constraints O Bailleux, Y Boufkhad International conference on principles and practice of constraint …, 2003 | 445 | 2003 |
| New encodings of pseudo-boolean constraints into CNF O Bailleux, Y Boufkhad, O Roussel Theory and Applications of Satisfiability Testing-SAT 2009: 12th …, 2009 | 125 | 2009 |
| A translation of pseudo-boolean constraints to SAT O Bailleux, Y Boufkhad, O Roussel Journal on Satisfiability, Boolean Modeling and Computation 2 (1-4), 191-200, 2006 | 112 | 2006 |
| A new universal cellular automaton discovered by evolutionary algorithms E Sapin, O Bailleux, JJ Chabrier, P Collet Genetic and Evolutionary Computation–GECCO 2004: Genetic and Evolutionary …, 2004 | 47 | 2004 |
| Research of a cellular automaton simulating logic gates by evolutionary algorithms E Sapin, O Bailleux, C Jean-Jacques European Conference on Genetic Programming, 414-423, 2003 | 44 | 2003 |
| DISTANCE-SAT: Complexity and algorithms O Bailleux, P Marquis AAAI/IAAI, 642-647, 1999 | 35 | 1999 |
| Demonstration of the Universality of a New Cellular Automaton. E Sapin, O Bailleux, JJ Chabrier, P Collet International Journal of Unconventional Computing 3 (2), 2007 | 26 | 2007 |
| Research of complex forms in cellular automata by evolutionary algorithms E Sapin, O Bailleux, JJ Chabrier Artificial Evolution: 6th International Conference, Evolution Artificielle …, 2004 | 23 | 2004 |
| Research of complexity in cellular automata through evolutionary algorithms E Sapin, O Bailleux, J Chabrier Complex systems 17 (3), 231-242, 2007 | 22 | 2007 |
| Full CNF Encoding: The Counting Constraints Case. O Bailleux, Y Boufkhad SAT, 2, 2004 | 21 | 2004 |
| Some computational aspects of distance-sat O Bailleux, P Marquis Journal of Automated Reasoning 37 (4), 231-260, 2006 | 16 | 2006 |
| Measuring the spatial dispersion of evolutionary search processes: Application to walksat A Sidaner, O Bailleux, JJ Chabrier Artificial Evolution: 5th International Conference, Evolution Artificielle …, 2002 | 13 | 2002 |
| Approximate resolution of hard numbering problems O Bailleux, JJ Chabrier AAAI/IAAI, Vol. 1, 169-174, 1996 | 13 | 1996 |
| On the CNF encoding of cardinality constraints and beyond O Bailleux arXiv preprint arXiv:1012.3853, 2010 | 6 | 2010 |
| Local search for statistical counting O Bailleux AAAI/IAAI, 386-391, 1998 | 6 | 1998 |
| Counting by statistics on search trees: Application to constraint satisfaction problems O Bailleux, JJ Chabrier Intelligent Data Analysis 1 (1-4), 263-274, 1997 | 6 | 1997 |
| On the expressive power of unit resolution O Bailleux arXiv preprint arXiv:1106.3498, 2011 | 4 | 2011 |
| Boolvar/pb v1. 0, a java library for translating pseudo-boolean constraints into cnf formulae O Bailleux arXiv preprint arXiv:1103.3954, 2011 | 4 | 2011 |
| Contribution à l'étude des paysages de recherche locale associés au problème SAT O Bailleux Dijon, 1996 | 3 | 1996 |
| DPLL with restarts linearly simulates CDCL O Bailleux Université de Bourgogne, 2019 | 2 | 2019 |
