International journal paper(s)
Gilles Audemard, Said Jabbour, Lakhdar Saïs, "SAT Graph-Based Representation: A New Perspective". in Journal of Algorithms In Logics, Informatics and Cognition , vol. 63, pp. 17--33, 2008.[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, Laurent Henocque, "Predicting and Detecting Symmetries in FOL Finite Model Search". in Journal of Automated Reasoning , vol. 36, n° 3, pp. 177--212, december 2006.
[pdf] [BibTeX]
Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani, "Verifying Industrial Hybrid Systems with MathSAT". in Electronic Notes in Theoretical Computer Science , vol. 119, n° 2, pp. 17--32, march 2005.
[pdf] [BibTeX]
International conference paper(s) with proceedings
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, "On freezeing and reactivating learnt clauses". in Fourteenth International Conference on Theory and Applications of Satisfiability Testing (SAT'11), pp. 188-200, june 2011.[pdf] [BibTeX]
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, "Boosting local search thanks to CDCL". in 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'10), pp. 474--488, october 2010.
[pdf] [BibTeX]
Gilles Audemard, George Katsirelos, Laurent Simon, "A Restriction of Extended Resolution for Clause Learning SAT Solvers". in 24nd Conference on Artificial Intelligence (AAAI'10), pp. 10--15, july 2010.
[pdf] [BibTeX]
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, "Learning in local search". in 21st International Conference on Tools with Artificial Intelligence (ICTAI'09), IEEE Computer Society, pp. 417-424, november 2009.
[pdf] [BibTeX]
Gilles Audemard, Laurent Simon, "Predicting Learnt Clauses Quality in Modern SAT Solver". in Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09), pp. 399-404, july 2009.
[pdf] [BibTeX]
Gilles Audemard, Laurent Simon, "Experimenting a Conflict-Driven Clause Learning Algorithm". in 14th International Conference on Principles and Practice of Constraint Programming (CP'08), Lecture Notes in Computer Science (LNCS 5202), Springer, pp. 630--634, september 2008.
[pdf] [BibTeX]
Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Said Jabbour, Lakhdar Saïs, "A generalized Framework For Conflict Analysis". in Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT'08), pp. 21--27, may 2008.
[BibTeX]
Gilles Audemard, Said Jabbour, Lakhdar Saïs, "Efficient Symmetry Breaking Predicates for Quantified Boolean Formulae". in Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon), pp. 14--21, september 2007.
[pdf] [BibTeX]
Gilles Audemard, Lakhdar Saïs, "Circuit Based Encoding of CNF Formula". in Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT'07), LNCS 4501, Springer Verlag, pp. 16--21, may 2007.
[pdf] [BibTeX]
Gilles Audemard, Laurent Simon, "GUNSAT : a greedy local search algorithm for unsatisfiability". in International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 2256--2261, january 2007.
[pdf] [BibTeX]
Gilles Audemard, Said Jabbour, Lakhdar Saïs, " Symmetry Breaking in Quantified Boolean Formulae". in International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 2262--2267, january 2007.
[pdf] [BibTeX]
Gilles Audemard, Lakhdar Saïs, " A Symbolic Search Based Approach for Quantified Boolean Formulas". in 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05), LNCS 3569, Springer Verlag, pp. 16-30, 2005.
[pdf] [BibTeX]
Gilles Audemard, Lakhdar Saïs, " Une approche Symbolique pour les Formules Booléennes Quantifiées". in Colloque sur l'Optimisation et les Systèmes d'Informations (COSI'05), pp. 285-296, 2005.
[BibTeX]
Gilles Audemard, Lakhdar Saïs, " SAT Based BDD Solver for Quantified Boolean Formulas". in 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), IEEE Computer Society, pp. 82 - 89, september 2004.
[pdf] [BibTeX]
Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, " Dealing with Symmetries in Quantified Boolean Formulas". in Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), pp. 257-262, 2004.
[pdf] [BibTeX]
Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani, " Bounded Model Checking for Timed Systems". in 22nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'02), LNCS 2529 Springer Verlag, pp. 243-259, november 2002.
[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, " Reasoning by symmetry and function ordering in Finite model generation". in 18th Conference on Automated Deduction (CADE'18), LNCS 2392 Springer Verlag, pp. 226-240, july 2002.
[pdf] [BibTeX]
Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani, " A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions". in 18th Conference on Automated Deduction (CADE'18), LNCS 2392 Springer Verlag, pp. 195-210, july 2002.
[pdf] [BibTeX]
Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani, "Integrating boolean and mathematical solving : fondations, basic algorithms and requirements". in 10th Symposium on the Integration of symbolic Computation and Mechanized Reasoning (CALCULEMUS), Springer Verlag, pp. 231-245, july 2002.
[pdf] [BibTeX]
Gilles Audemard, Laurent Henocque, " The eXtended Least Number Heuristic". in International Joint Conference on Automated Reasoning (IJCAR'01), Springer Verlag, pp. 427-442, june 2001.
[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, Pierre Siegel, " AVAL: an Enumerative Method for SAT". in International Conference on Computational Logic (CL'00), LNCS 1861, Springer Verlag, pp. 373-383, july 2000.
[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, Laurent Henocque, " Two techniques to improve Finite Model Search.". in 17th Conference on Automated Deduction (CADE'17), LNCS 2083, Springer Verlag, pp. 302-308, june 2000.
[pdf] [BibTeX]
International conference paper(s) without proceedings
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, "Integrating Conflict Driven Clause Learning to Local Search". in International Workshop on Local Search Techniques in Constraint Satisfaction (affiliated to CP) (LSCS09), september 2009. (Electronic proceedings)[pdf] [BibTeX]
Gilles Audemard, Said Jabbour, Lakhdar Saïs, "Efficient Symmetry breaking Predicates for quantified boolean formulae". in Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon), september 2007.
[BibTeX]
Gilles Audemard, Said Jabbour, Lakhdar Saïs, "Using SAT-Graph representation to derive hard instances". in 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'07), july 2007.
[pdf] [BibTeX]
Gilles Audemard, Daniel Le berre, Olivier Roussel, Ines Lynce, Joao Marques-silva, "OpenSAT: an open source SAT software project". in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), may 2003. (poster)
[pdf] [BibTeX]
Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani, " Verifying Industrial Hybrid Systems with MathSAT". in Proceedings of the first workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR), pp. 62-75, 2003.
[BibTeX]
Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani, " Bounded model checking for timed systems". in Second Workshop on Real-Time Tools-Affiliated with CAV , july 2002.
[BibTeX]
Gilles Audemard, Belaid Benhamou, "Symmetry in finite model of first order logic". in Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon), pp. 01-08, december 2001.
[pdf] [BibTeX]
National conference paper(s)
Gilles Audemard, George Katsirelos, Laurent Simon, "Une restriction de la résolution étendue pour les démonstrateurs SAT modernes". in Sixièmes Journées Francophones de Programmation par Contraintes (JFPC'10), pp. 43--50, june 2010.[pdf] [BibTeX]
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, "Approche hybride pour SAT". in 17eme congrès francophone AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA'10), pp. 279--286, january 2010.
[pdf] [BibTeX]
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, "Analyse de conflits dans le cadre de la recherche locale". in Journées Francophones de la Programmation par Contraintes (JFPC'09), pp. 215-224, june 2009.
[pdf] [BibTeX]
Gilles Audemard, Mouny Samy-modeliar, Laurent Simon, "Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus ?". in Journées Francophones de la Programmation par Contraintes (JFPC'09), pp. 245-253, june 2009.
[pdf] [BibTeX]
Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Said Jabbour, Lakhdar Saïs, "Un cadre général pour l'analyse des conflits". in Quatrièmes Journées Francophones de Programmation par Contraintes (JFPC'08), pp. 267--276, june 2008.
[pdf] [BibTeX]
Gilles Audemard, Said Jabbour, Lakhdar Saïs, "Exploitation des symétries dans les formules booléennes quantifiées". in Secondes Journées Francophones de Programmation par Contraintes (JFPC'06), pp. 257--266, june 2006.
[pdf] [BibTeX]
Gilles Audemard, Lakhdar Saïs, "Une approche symbolique pour les formules booléennes quantifiées". in Premières Journées Francophones de la Programmation par Contraintes (JFPC'05), pp. 59-68, june 2005.
[pdf] [BibTeX]
Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, " Symétries et Formules Booléennes Quantifiées". in Dixièmes Journées Nationales de la Résolution Pratique des Problèmes {NP}-Complets (JNPC'04), pp. 43 - 53, 2004.
[pdf] [BibTeX]
Gilles Audemard, Daniel Le berre, Olivier Roussel, "OpenSAT: une plateforme SAT Open Source". in Neuvièmes Journées Nationales sur la résolution Pratique de Problèmes NP-Complets (JNPC'03), june 2003.
[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, " Etude des symétries dans les modèles finis". in Journées Francophones de Programmation en Logique et programmation par Containtes (JFPLC'01), Hermes Science, pp. 109-122, april 2001.
[pdf] [BibTeX]
Gilles Audemard, Laurent Henocque, " Sur la génération des groupes finis non isomorphes". in Sixièmes Journées Nationales sur la Résolution Pratique des Problèmes {NP}-complets (JNPC'00), pp. 57-66, june 2000.
[pdf] [BibTeX]
Gilles Audemard, Belaid Benhamou, Pierre Siegel, " La méthode d'avalanche AVAL : une méthode énumérative pour SAT". in Actes des Cinquièmes Journées Nationales sur la Résolution Pratique des Problèmes NP-complets (JNPC'99), pp. 17-25, june 1999.
[pdf] [BibTeX]
Book chapter(s)
Gilles Audemard, Belaid Benhamou, "Symétries". in Problème SAT : progrès et défis, chapter 6, Lakhdar Saïs(Eds.), Hermes, 2008.[BibTeX]
Habilitation(s) à Diriger des Recherches
Gilles Audemard, "Résolution de problèmes autour de SAT". Habilitation à Diriger des Recherches, Université d'atois, november 2010.[pdf] [slides] [BibTeX]
PhD thesis
Gilles Audemard, " Résolution du problème SAT et génération de modèles finis en logique du premier ordre". PhD Thesis, Provence, october 2001.[BibTeX]