| 2008 |
|---|
| 19 | EE | Gilles Audemard,
Laurent Simon:
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms.
CP 2008: 630-634 |
| 18 | EE | Gilles Audemard,
Lucas Bordeaux,
Youssef Hamadi,
Saïd Jabbour,
Lakhdar Sais:
A Generalized Framework for Conflict Analysis.
SAT 2008: 21-27 |
| 17 | EE | Gilles Audemard,
Saïd Jabbour,
Lakhdar Sais:
SAT graph-based representation: A new perspective.
J. Algorithms 63(1-3): 17-33 (2008) |
| 2007 |
|---|
| 16 | EE | Gilles Audemard,
Laurent Simon:
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability.
IJCAI 2007: 2256-2261 |
| 15 | EE | Gilles Audemard,
Saïd Jabbour,
Lakhdar Sais:
Symmetry Breaking in Quantified Boolean Formulae.
IJCAI 2007: 2262-2267 |
| 14 | EE | Gilles Audemard,
Lakhdar Sais:
Circuit Based Encoding of CNF Formula.
SAT 2007: 16-21 |
| 2006 |
|---|
| 13 | EE | Gilles Audemard,
Belaid Benhamou,
Laurent Henocque:
Predicting and Detecting Symmetries in FOL Finite Model Search.
J. Autom. Reasoning 36(3): 177-212 (2006) |
| 2005 |
|---|
| 12 | EE | Gilles Audemard,
Lakhdar Sais:
A Symbolic Search Based Approach for Quantified Boolean Formulas.
SAT 2005: 16-30 |
| 11 | EE | Gilles Audemard,
Marco Bozzano,
Alessandro Cimatti,
Roberto Sebastiani:
Verifying Industrial Hybrid Systems with MathSAT.
Electr. Notes Theor. Comput. Sci. 119(2): 17-32 (2005) |
| 2004 |
|---|
| 10 | EE | Gilles Audemard,
Lakhdar Sais:
SAT Based BDD Solver for Quantified Boolean Formulas.
ICTAI 2004: 82-89 |
| 9 | EE | Gilles Audemard,
Bertrand Mazure,
Lakhdar Sais:
Dealing with Symmetries in Quantified Boolean Formulas.
SAT 2004 |
| 2002 |
|---|
| 8 | EE | Gilles Audemard,
Piergiorgio Bertoli,
Alessandro Cimatti,
Artur Kornilowicz,
Roberto Sebastiani:
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements.
AISC 2002: 231-245 |
| 7 | EE | Gilles Audemard,
Piergiorgio Bertoli,
Alessandro Cimatti,
Artur Kornilowicz,
Roberto Sebastiani:
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions.
CADE 2002: 195-210 |
| 6 | EE | Gilles Audemard,
Belaid Benhamou:
Reasoning by Symmetry and Function Ordering in Finite Model Generation.
CADE 2002: 226-240 |
| 5 | EE | Gilles Audemard,
Alessandro Cimatti,
Artur Kornilowicz,
Roberto Sebastiani:
Bounded Model Checking for Timed Systems.
FORTE 2002: 243-259 |
| 2001 |
|---|
| 4 | EE | Gilles Audemard,
Laurent Henocque:
The eXtended Least Number Heuristic.
IJCAR 2001: 427-442 |
| 3 | | Gilles Audemard,
Belaid Benhamou:
Etude des symétries dans les modèles finis.
JFPLC 2001: 109-122 |
| 2000 |
|---|
| 2 | | Gilles Audemard,
Belaid Benhamou,
Laurent Henocque:
Two Techniques to Improve Finite Model Search.
CADE 2000: 302-308 |
| 1 | EE | Gilles Audemard,
Belaid Benhamou,
Pierre Siegel:
AVAL: An Enumerative Method for SAT.
Computational Logic 2000: 373-383 |
