Publications

Articles de revues internationales

2020 Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel, XCSP3 and its ecosystem in Constraints Journal (Constraints),pp. 1-23, 2020.

2018 Gilles Audemard, Laurent Simon, On the Glucose SAT solver in International Journal on Artificial Intelligence Tools (IJAIT),vol. 27, n° 1, pp. 1-25, 2018.

2008 Gilles Audemard, Said Jabbour, Lakhdar Saïs, SAT Graph-Based Representation: A New Perspective in Journal of Algorithms in Cognition, Informatics and Logic,vol. 63, pp. 17--33, 2008.

2006 Gilles Audemard, Belaïd Benhamou, Laurent Henocque, Predicting and Detecting Symmetries in FOL Finite Model Search in Journal of Automated Reasoning,vol. 36, n° 3, pp. 177-212, 2006.

2005 Gilles Audemard, Marco Bozzano, Alessendro Cimatti, Roberto Sebastiani, Verifying Industrial Hybrid Systems with MathSAT in Electronic Notes in Theoretical Computer Science,vol. 119, n° 2, pp. 17-32, 2005.

Articles de conférences internationales

2022 Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Les raisons majoritaires : des explications abductives pour les forêts aléatoires in 22ème Conférence francophone sur l'Extraction et Gestion des Connaissances (EGC 2022),Editions RNTI, pp. 123-134, 2022.

2022 Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel, Identifying Soft Cores in Propositional Formulae in 14th International Conference on Agents and Artificial Intelligence, ICAART,2022.

2022 Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Sur le pouvoir explicatif des arbres de décision in Extraction et Gestion des Connaissances, EGC,Editions RNTI, vol. E-38, pp. 147-158, 2022.

2021 Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen, A hybrid CP/MOLS approach for multi-objective imbalanced classification in GECCO '21: Genetic and Evolutionary Computation Conference,ACM, pp. 723-731, 2021.

2021 Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, On the Computational Intelligibility of Boolean Classifiers in 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021},International Joint Conferences on Artificial Intelligence Organization, pp. 74-86, 2021.

2020 Gilles Audemard, Loïc Paulevé, Laurent Simon, SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers in SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing,Springer, vol. 12178, pp. 107-113, 2020.

2020 Gilles Audemard, Frédéric Koriche, Pierre Marquis, On Tractable XAI Queries based on Compiled Representations in 17th International Conference on Principles of Knowledge Representation and Reasoning (KR'20),2020.

2020 Gilles Audemard, Christophe Lecoutre, Mehdi Maamar, Segmented Tables: an Efficient Modeling Tool for Constraint Reasoning in 24th European Conference on Artificial Intelligence (ECAI'20),2020.

2019 Gilles Audemard, Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski, pFactory: A generic library for designing parallel solvers in International Conference on Applied Computing (AC),2019.

2017 Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary, A Distributed Version of Syrup in 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17),pp. 215-232, 2017.

2016 Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary, An Adaptive SAT Solver in 22nd International Conference on Principles and Practice of Constraint Programming (CP'16),pp. 30-48, 2016.

2016 Gilles Audemard, Laurent Simon, Extreme Cases in SAT Problems in 19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16),Lecture Notes in Computer Science (LNCS) Volume 9710, Springer, pp. 87-103, 2016.

2014 Gilles Audemard, Laurent Simon, Lazy clause exchange policy for parallel SAT solvers in 17th International Conference on Theory and Applications of Satisfiability Testing,pp. To appear, 2014.

2014 Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar, Gilles Goncalves, Daniel Porumbel, Scoring-based Neighborhood Dominance for the Subgraph isomorphism Problem in 20th International Conference on Principles and Practice of Constraint Programming (CP'14),Lecture Notes in Computer Science (LNCS), Volume 8656, Springer, pp. 125--141, 2014.

2014 Zack Newsham, Gilles Audemard, Vijay Ganesh, Sebastian Fischmeister, Laurent Simon, Impact of Community Structure on SAT Solver Performance in 17th International Conference on Theory and Applications of Satisfiability Testing,pp. To appear, 2014.

2014 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette, Dolius: A Distributed Parallel SAT Solving Framework in Pragmatics of SAT 2014 (POS'14),2014.

2014 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette, An Effective Distributed D&C Approach for the Satisfiability Problem in 22nd International Conference on Parallel, Distributed and Network-Based Computing (PDP'14),pp. 183-187, 2014.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Du glucose en goutte à goutte pour les coeurs insatisfiables in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 59-66, 2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Just-In-Time Compilation of Knowledge Bases in 23th International Joint Conference on Artificial Intelligence (IJCAI'13),pp. 447-453, 2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction in International Conference on Theory and Applications of Satisfiability Testing,2013.

2012 Gilles Audemard, Benoît Hoessen, Said Jabbour, Jean-Marie Lagniez, Cédric Piette, PeneLoPe, a Parallel Clause-Freezer Solver in SAT Challenge 2012: Solver and Benchmarks Descriptions,pp. 43-44, 2012.

2012 Gilles Audemard, Laurent Simon, GLUCOSE 2.1: Aggressive, but Reactive, Clause Database Management, Dynamic Restarts (System Description) in Pragmatics of SAT 2012 (POS'12),2012.

2012 Gilles Audemard, Laurent Simon, Refining restarts strategies for SAT and UNSAT formulae in 18th International Conference on Principles and Practice of Constraint Programming,2012.

2012 Gilles Audemard, Laurent Simon, Glucose 2.1: Aggressive - but Reactive - Clause Database Management, Dynamic Restarts in International Workshop of Pragmatics of SAT (Affiliated to SAT),2012.

2012 Gilles Audemard, Benoît Hoessen, Said Jabbour, Jean-Marie Lagniez, Cédric Piette, Revisiting Clause Exchange in Parallel SAT Solving in 15th International Conference on Theory and Applications of Satisfiability Testing (SAT'12),Springer, vol. 7962, pp. 200-213, 2012.

2011 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, On freezeing and reactivating learnt clauses in 14th International Conference on Theory and Applications of Satisfiability Testing (SAT'11),Springer, vol. 6695, pp. 188-200, 2011.

2010 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),Springer, vol. 6397, pp. 474-488, 2010.

2010 Gilles Audemard, George Katsirelos, Laurent Simon, A Restriction of Extended Resolution for Clause Learning SAT Solvers in 24th Conference on Artificial Intelligence (AAAI'10),pp. 10-15, 2010.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Integrating Conflict Driven Clause Learning to Local Search in 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS'09),2009.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Analyse de conflits dans le cadre de la recherche locale in Cinquièmes Journées Francophones de Programmation par Contraintes,pp. 215-225, 2009.

2009 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, 2009.

2009 Laurent Simon, Gilles Audemard, Predicting Learnt Clauses Quality in Modern SAT Solver in Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09),2009.

2009 Gilles Audemard, Mouny Samy Modeliar, Laurent Simon, Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus ? in Cinquièmes Journées Francophones de Programmation par Contraintes,pp. 245-255, 2009.

2008 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, 2008.

2008 Gilles Audemard, Laurent Simon, Experimenting a Conflict-Driven Clause Learning Algorithm in 14th International Conference on Principles and Practice of Constraint Programming (CP'08),pp. 630-634, 2008.

2007 Gilles Audemard, L. Simon, GUNSAT : a greedy local search algorithm for unsatisfiability in International Joint Conference on Artificial Intelligence(IJCAI'07),pp. 2256--2261, 2007.

2007 Gilles Audemard, Lahkdar Sais, 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, 2007.

2007 Gilles Audemard, Said Jabbour, Lahkdar Sais, Symmetry Breaking in Quantified Boolean Formulae in International Joint Conference on Artificial Intelligence(IJCAI'07),pp. 2262--2267, 2007.

2004 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, 2004.

2004 Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, Dealing with Symmetries in Quantified Boolean Formulas in Proc. of the Seventh International Conference on Theory and Applications of Satisfiability Testing,pp. 257-262, 2004.

2003 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 (SAT2003),2003.

2002 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, 2002.

2002 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, 2002.

2002 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,2002.

2002 Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani, Integrating boolean and mathematical solving : fondations, basic algorithms and requirements in Proceedings on the 10th Symposium on the Integration of symbolic Computation and Mechanized Reasoning (CALCULEMUS 2002) LNCS 2385,Springer, pp. 231-245, 2002.

2002 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, 2002.

2001 Gilles Audemard, Belaid Benhamou, Symmetry in finite model of first order logic in Proceedings of Symmetry in Constraint (SymCon'01) - CP'01 Workshop,pp. 01-08, 2001.

2001 Gilles Audemard, Laurent Henocque, The eXtended Least Number Heuristic in International Joint Conference on Automated Reasoning (IJCAR'01),Springer, pp. 427-442, 2001.

2000 Gilles Audemard, Belaid Benhamou, Laurent Henocque, Two techniques to improve Finite Model Search. in Proceedings of the 17th International Conference on Automated Deduction (CADE 17),LNCS 2083, Springer Verlag, pp. 302-308, 2000.

2000 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, 2000.

Articles de revues nationales

2014 Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon, Améliorer SAT dans le cadre incrémental in Revue d'intelligence artificielle (RIA),vol. 28, n° 5, pp. 593-614, 2014.

Articles de conférences nationales

2014 Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar, Gilles Goncalves, Daniel Porumbel, Dominance au voisinage pour le probleme d'isomorphisme de sous-graphe in 8èmes Journées Nationales de l'Intelligence Artificielle Fondamentale (IAF'14),2014.

2013 Gilles Audemard, Benoît Hoessen, Said Jabbour, Cédric Piette, Un nouveau cadre diviser pour régner pour SAT distribué in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 51-58, 2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Du Glucose en goutte à goutte pour les coeurs inconsistants in Journées Francophones de Programmation par Contraintes,2013.

2012 Gilles Audemard, Benoît Hoessen, Said Jabbour, Jean-Marie Lagniez, Cédric Piette, Résolution parallèle de SAT: mieux collaborer pour aller plus loin in JFPC 2012,2012.

2012 Gilles Audemard, Benoît Hoessen, Said Jabbour, Jean-Marie Lagniez, Cédric Piette, Résolution parallèle de SAT : mieux collaborer pour aller plus loin in 8ièmes Journées Francophones de Programmation par Contraintes (JFPC'12),pp. 35-44, 2012.

2010 Gilles Audemard, George Katsirelos, Laurent Simon, Une restriction de la résolution étendue pour les démonstrateurs SAT modernes in JFPC 2010 - Sixièmes Journées Francophones de Programmation par Contraintes,pp. 43-50, 2010.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Approche hybride pour SAT in 17ième Congrès Francophone sur la Reconnaissance des Formes et Intelligence Artificielle (RFIA'10),pp. 279-286, 2010.

2010 Laurent Simon, Gilles Audemard, George Katsirelos, Une restriction de la résolution étendue pour les démonstrateurs SAT modernes in JFPC,2010.

2008 Gilles Audemard, Lucas Bordeaux, youssef Hamadi, Said Jabbour, Lakhdar Saïs, Un cadre général pour l'analyse des conflits in 4ièmes Journées Francophones de Programmation par Contraintes (JFPC'08),pp. 267-376, 2008.

2008 Gilles Audemard, Lucas Bordeaux, youssef Hamadi, Said Jabbour, Lakhdar Saïs, Un cadre général pour l'analyse de conflits in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes,pp. 267-276, 2008.

2007 Gilles Audemard, Said Jabbour, Lahkdar Sais, Using SAT-Graph representation to derive hard instances in 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07),2007.

2004 Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, Symétries et Formules Booléennes Quantifiées in Journées Nationales de la Résolution Pratique des Problèmes NP-Complets (JNPC),pp. 43 - 53, 2004.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, OpenSAT: une plateforme SAT Open Source in JNPC'03,2003.

2001 Gilles Audemard, Belaid Benhamou, Etude des symétries dans les modèles finis in 11èmes Journées Francophones de Programmation en Logique et programmation par Containtes (JFPLC'01),Hermes Science, pp. 109-122, 2001.

2000 Gilles Audemard, Laurent Henocque, Sur la génération des groupes finis non isomorphes in Actes des sixièmes Journées Nationales des problèmes NP complets (JNPC 00),pp. 57-66, 2000.

1999 Gilles Audemard, Belaid Benhamou, Pierre Siegel, La méthode d'avalanche AVAL : une méthode énumérative pour SAT in 5èmes Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC'99),pp. 17-25, 1999.

Chapitres d'ouvrages

2008 Gilles Audemard, Belaïd Benhamou, Symétries in Problème SAT : progrès et défis,pp. 169-190, Hermès, 2008.

Rapports techniques

2021 Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette, XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems 2021.

2021 Frederic Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette, XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems 2021.

2013 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, SatHYS: Sat Hybrid Solver 2013.

2013 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette, PeneLoPe in SAT Competition 2013 2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, RCL: Reduce learnt clauses 2013.