default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Bailleux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i9]Olivier Bailleux, Yacine Boufkhad:
Constraint Reductions. CoRR abs/2006.02081 (2020)
2010 – 2019
- 2019
- [i8]Olivier Bailleux:
Subsumption-driven clause learning with DPLL+restarts. CoRR abs/1906.07508 (2019) - 2015
- [i7]Olivier Bailleux:
SAT as a game. CoRR abs/1511.00813 (2015) - 2012
- [i6]Olivier Bailleux:
Unit contradiction versus unit propagation. CoRR abs/1204.0731 (2012) - 2011
- [i5]Olivier Bailleux:
BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae. CoRR abs/1103.3954 (2011) - [i4]Olivier Bailleux:
On the expressive power of unit resolution. CoRR abs/1106.3498 (2011) - 2010
- [i3]Olivier Bailleux:
Reified unit resolution and the failed literal rule. CoRR abs/1011.2898 (2010) - [i2]Olivier Bailleux:
Evolving difficult SAT instances thanks to local search. CoRR abs/1011.5866 (2010) - [i1]Olivier Bailleux:
On the CNF encoding of cardinality constraints and beyond. CoRR abs/1012.3853 (2010)
2000 – 2009
- 2009
- [c10]Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
New Encodings of Pseudo-Boolean Constraints into CNF. SAT 2009: 181-194 - 2007
- [j5]Emmanuel Sapin, Olivier Bailleux, Jacqueline Chabrier:
Research of Complexity in Cellular Automata through Evolutionary Algorithms. Complex Syst. 17(3) (2007) - [j4]Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier, Pierre Collet:
Demonstration of the Universality of a New Cellular Automaton. Int. J. Unconv. Comput. 3(2): 79-103 (2007) - 2006
- [j3]Olivier Bailleux, Pierre Marquis:
Some Computational Aspects of distance-sat. J. Autom. Reason. 37(4): 231-260 (2006) - [j2]Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT. J. Satisf. Boolean Model. Comput. 2(1-4): 191-200 (2006) - 2004
- [c9]Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier, Pierre Collet
:
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms. GECCO (1) 2004: 175-187 - [c8]Olivier Bailleux, Yacine Boufkhad:
Full CNF Encoding: The Counting Constraints Case. SAT 2004 - 2003
- [c7]Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier:
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms. Artificial Evolution 2003: 357-367 - [c6]Olivier Bailleux, Yacine Boufkhad:
Efficient CNF Encoding of Boolean Cardinality Constraints. CP 2003: 108-122 - [c5]Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier:
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms. EuroGP 2003: 414-423 - 2001
- [c4]Alain Sidaner, Olivier Bailleux, Jean-Jacques Chabrier:
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat. Artificial Evolution 2001: 77-90
1990 – 1999
- 1999
- [c3]Olivier Bailleux, Pierre Marquis:
DISTANCE-SAT: Complexity and Algorithms. AAAI/IAAI 1999: 642-647 - 1998
- [c2]Olivier Bailleux:
Local Search for Statistical Counting. AAAI/IAAI 1998: 386-391 - 1997
- [j1]Olivier Bailleux, Jean-Jacques Chabrier:
Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems. Intell. Data Anal. 1(1-4): 263-274 (1997) - 1996
- [c1]Olivier Bailleux, Jean-Jacques Chabrier:
Approximate Resolution of Hard Numbering Problems. AAAI/IAAI, Vol. 1 1996: 169-174
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
