- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c24 |      | |
| c23 | | Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette: Revisiting Clause Exchange in Parallel SAT Solving. SAT 2012: 200-213 |
| 2011 | ||
| c22 | | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: On Freezing and Reactivating Learnt Clauses. SAT 2011: 188-200 |
| 2010 | ||
| c21 | | Gilles Audemard, George Katsirelos, Laurent Simon: A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI 2010 |
| c20 | | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488 |
| 2009 | ||
| c19 | | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Learning in Local Search. ICTAI 2009: 417-424 |
| c18 | | Gilles Audemard, Laurent Simon: Predicting Learnt Clauses Quality in Modern SAT Solvers. IJCAI 2009: 399-404 |
| c17 | | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Integrating Conflict Driven Clause Learning to Local Search. LSCS 2009: 55-68 |
| 2008 | ||
| j3 | | Gilles Audemard, Saïd Jabbour, Lakhdar Sais: SAT graph-based representation: A new perspective. J. Algorithms 63(1-3): 17-33 (2008) |
| c16 | | Gilles Audemard, Laurent Simon: Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. CP 2008: 630-634 |
| c15 | | Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: A Generalized Framework for Conflict Analysis. SAT 2008: 21-27 |
| 2007 | ||
| c14 | | Gilles Audemard, Laurent Simon: GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. IJCAI 2007: 2256-2261 |
| c13 | | Gilles Audemard, Saïd Jabbour, Lakhdar Sais: Symmetry Breaking in Quantified Boolean Formulae. IJCAI 2007: 2262-2267 |
| c12 | | |
| 2006 | ||
| j2 | | Gilles Audemard, Belaid Benhamou, Laurent Henocque: Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reasoning 36(3): 177-212 (2006) |
| 2005 | ||
| j1 | | Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani: Verifying Industrial Hybrid Systems with MathSAT. Electr. Notes Theor. Comput. Sci. 119(2): 17-32 (2005) |
| c11 | | Gilles Audemard, Lakhdar Sais: A Symbolic Search Based Approach for Quantified Boolean Formulas. SAT 2005: 16-30 |
| 2004 | ||
| c10 | | Gilles Audemard, Lakhdar Sais: SAT Based BDD Solver for Quantified Boolean Formulas. ICTAI 2004: 82-89 |
| c9 | | Gilles Audemard, Bertrand Mazure, Lakhdar Sais: Dealing with Symmetries in Quantified Boolean Formulas. SAT 2004 |
| 2002 | ||
| c8 | | Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani: Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. AISC 2002: 231-245 |
| c7 | | 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 |
| c6 | | Gilles Audemard, Belaid Benhamou: Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002: 226-240 |
| c5 | | Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani: Bounded Model Checking for Timed Systems. FORTE 2002: 243-259 |
| 2001 | ||
| c4 | | |
| c3 |  | |
| 2000 | ||
| c2 | | Gilles Audemard, Belaid Benhamou, Laurent Henocque: Two Techniques to Improve Finite Model Search. CADE 2000: 302-308 |
| c1 | | Gilles Audemard, Belaid Benhamou, Pierre Siegel: AVAL: An Enumerative Method for SAT. Computational Logic 2000: 373-383 |
Colors in the list of coauthors
Last update Thu May 23 07:52:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page