Two Techniques to Improve Finite Model Search. - Gilles Audemard; Belaid Benhamou; Laurent Henocque (CADE, 2000)

AVAL: An Enumerative Method for SAT. - Gilles Audemard; Belaid Benhamou; Pierre Siegel (Computational Logic, 2000)

The eXtended Least Number Heuristic. - Gilles Audemard; Laurent Henocque (IJCAR, 2001)

Etude des symétries dans les modèles finis. - Gilles Audemard; Belaid Benhamou (JFPLC, 2001)

Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. - Gilles Audemard; Piergiorgio Bertoli; Alessandro Cimatti; Artur Kornilowicz; Roberto Sebastiani (AISC, 2002)

Reasoning by Symmetry and Function Ordering in Finite Model Generation. - Gilles Audemard; Belaid Benhamou (CADE, 2002)

A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. - Gilles Audemard; Piergiorgio Bertoli; Alessandro Cimatti; Artur Kornilowicz; Roberto Sebastiani (CADE, 2002)

Bounded Model Checking for Timed Systems. - Gilles Audemard; Alessandro Cimatti; Artur Kornilowicz; Roberto Sebastiani (FORTE, 2002)

SAT Based BDD Solver for Quantified Boolean Formulas. - Gilles Audemard; Lakhdar Sais (ICTAI, 2004)

Dealing with Symmetries in Quantified Boolean Formulas. - Gilles Audemard; Bertrand Mazure; Lakhdar Sais (SAT, 2004)

Verifying Industrial Hybrid Systems with MathSAT. - Gilles Audemard; Marco Bozzano; Alessandro Cimatti; Roberto Sebastiani (BMC@CAV, 2004)

A Symbolic Search Based Approach for Quantified Boolean Formulas. - Gilles Audemard; Lakhdar Sais (SAT, 2005)

Predicting and Detecting Symmetries in FOL Finite Model Search. - Gilles Audemard; Belaid Benhamou; Laurent Henocque (J. Autom. Reason., 2006)

Symmetry Breaking in Quantified Boolean Formulae. - Gilles Audemard; Saïd Jabbour; Lakhdar Sais (IJCAI, 2007)

GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. - Gilles Audemard; Laurent Simon 001 (IJCAI, 2007)

Circuit Based Encoding of CNF Formula. - Gilles Audemard; Lakhdar Sais (SAT, 2007)

Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. - Gilles Audemard; Laurent Simon 001 (CP, 2008)

A Generalized Framework for Conflict Analysis. - Gilles Audemard; Lucas Bordeaux; Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (SAT, 2008)

SAT graph-based representation: A new perspective. - Gilles Audemard; Saïd Jabbour; Lakhdar Sais (J. Algorithms, 2008)

Learning in Local Search. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (ICTAI, 2009)

Predicting Learnt Clauses Quality in Modern SAT Solvers. - Gilles Audemard; Laurent Simon 001 (IJCAI, 2009)

Integrating Conflict Driven Clause Learning to Local Search - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (LSCS, 2009)

A Restriction of Extended Resolution for Clause Learning SAT Solvers. - Gilles Audemard; George Katsirelos; Laurent Simon 001 (AAAI, 2010)

Boosting Local Search Thanks to cdcl. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (LPAR (Yogyakarta), 2010)

On Freezing and Reactivating Learnt Clauses. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (SAT, 2011)

Refining Restarts Strategies for SAT and UNSAT. - Gilles Audemard; Laurent Simon 001 (CP, 2012)

Revisiting Clause Exchange in Parallel SAT Solving. - Gilles Audemard; Benoît Hoessen; Saïd Jabbour; Jean-Marie Lagniez; Cédric Piette (SAT, 2012)

Just-In-Time Compilation of Knowledge Bases. - Gilles Audemard; Jean-Marie Lagniez; Laurent Simon 001 (IJCAI, 2013)

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. - Gilles Audemard; Jean-Marie Lagniez; Laurent Simon 001 (SAT, 2013)

Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. - Gilles Audemard; Christophe Lecoutre; Mouny Samy Modeliar; Gilles Goncalves; Daniel Cosmin Porumbel (CP, 2014)

An Effective Distributed D&C Approach for the Satisfiability Problem. - Gilles Audemard; Benoît Hoessen; Saïd Jabbour; Cédric Piette (PDP, 2014)

Dolius: A Distributed Parallel SAT Solving Framework. - Gilles Audemard; Benoît Hoessen; Saïd Jabbour; Cédric Piette (POS@SAT, 2014)

Lazy Clause Exchange Policy for Parallel SAT Solvers. - Gilles Audemard; Laurent Simon 001 (SAT, 2014)

Impact of Community Structure on SAT Solver Performance. - Zack Newsham; Vijay Ganesh 001; Sebastian Fischmeister; Gilles Audemard; Laurent Simon 001 (SAT, 2014)

Améliorer SAT dans le cadre incrémental. - Gilles Audemard; Armin Biere; Jean-Marie Lagniez; Laurent Simon 001 (Rev. d'Intelligence Artif., 2014)

An Adaptive Parallel SAT Solver. - Gilles Audemard; Jean-Marie Lagniez; Nicolas Szczepanski; Sébastien Tabary (CP, 2016)

Extreme Cases in SAT Problems. - Gilles Audemard; Laurent Simon 001 (SAT, 2016)

A Distributed Version of Syrup. - Gilles Audemard; Jean-Marie Lagniez; Nicolas Szczepanski; Sébastien Tabary (SAT, 2017)

On the Glucose SAT Solver. - Gilles Audemard; Laurent Simon 001 (Int. J. Artif. Intell. Tools, 2018)

Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. - Gilles Audemard; Christophe Lecoutre; Mehdi Maamar (ECAI, 2020)

On Tractable XAI Queries based on Compiled Representations. - Gilles Audemard; Frédéric Koriche; Pierre Marquis (KR, 2020)

SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. - Gilles Audemard; Loïc Paulevé; Laurent Simon 001 (SAT, 2020)

XCSP3 and its ecosystem. - Gilles Audemard; Frédéric Boussemart; Christophe Lecoutre; Cédric Piette; Olivier Roussel (Constraints An Int. J., 2020)

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

A hybrid CP/MOLS approach for multi-objective imbalanced classification. - Nicolas Szczepanski; Gilles Audemard; Laetitia Jourdan; Christophe Lecoutre; Lucien Mousin; Nadarajen Veerapen (GECCO, 2021)

On the Computational Intelligibility of Boolean Classifiers. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (KR, 2021)

On the Explanatory Power of Decision Trees. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (CoRR, 2021)

Trading Complexity for Sparsity in Random Forest Explanations. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (AAAI, 2022)

Les raisons majoritaires : des explications abductives pour les forêts aléatoires. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (EGC, 2022)

Sur le pouvoir explicatif des arbres de décision. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (EGC, 2022)

Identifying Soft Cores in Propositional Formulæ. - Gilles Audemard; Jean-Marie Lagniez; Marie Miceli; Olivier Roussel (ICAART (2), 2022)

On Preferred Abductive Explanations for Decision Trees and Random Forests. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (IJCAI, 2022)

A New Exact Solver for (Weighted) Max#SAT. - Gilles Audemard; Jean-Marie Lagniez; Marie Miceli (SAT, 2022)

Proceedings of the 2022 XCSP3 Competition. - Gilles Audemard; Christophe Lecoutre; Emmanuel Lonca (CoRR, 2022)

On the explanatory power of Boolean decision trees. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (Data Knowl. Eng., 2022)

Computing Abductive Explanations for Boosted Trees. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (AISTATS, 2023)

Guiding Backtrack Search by Tracking Variables During Constraint Propagation. - Gilles Audemard; Christophe Lecoutre; Charles Prud'homme (CP, 2023)

On Contrastive Explanations for Tree-Based Classifiers. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (ECAI, 2023)

Sur les explications abductives préférées pour les arbres de décision et les forêts aléatoires. - Gilles Audemard; Steve Bellart; Louenas Bounia; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (EGC, 2023)

PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. - Gilles Audemard; Steve Bellart; Louenas Bounia; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (EGC, 2023)

Computing Abductive Explanations for Boosted Regression Trees. - Gilles Audemard; Steve Bellart; Jean-Marie Lagniez; Pierre Marquis (IJCAI, 2023)

Proceedings of the 2023 XCSP3 Competition. - Gilles Audemard; Christophe Lecoutre; Emmanuel Lonca (CoRR, 2023)

Check-In Desk Scheduling Optimisation at CDG International Airport. - Thibault Falque; Gilles Audemard; Christophe Lecoutre; Bertrand Mazure (AAAI, 2024)

Designing an XAI Interface for Tree-Based ML Models. - Gilles Audemard; Sylvie Coste-Marquis; Pierre Marquis; Mehdi Sabiri; Nicolas Szczepanski (ECAI, 2024)

On the Computation of Contrastive Explanations for Boosted Regression Trees. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis (ECAI, 2024)

Rectifier pour mieux distiller. - Gilles Audemard; Sylvie Coste-Marquis; Pierre Marquis; Mehdi Sabiri (EGC, 2024)

On the Computation of Example-Based Abductive Explanations for Random Forests. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (IJCAI, 2024)

Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (IJCAI, 2024)

PyXAI: An XAI Library for Tree-Based Models. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (IJCAI, 2024)

Proceedings of the 2024 XCSP3 Competition. - Gilles Audemard; Christophe Lecoutre; Emmanuel Lonca (CoRR, 2024)

Une interface XAI pour des modèles d'apprentissage automatique à base d'arbres. - Gilles Audemard; Sylvie Coste-Marquis; Pierre Marquis; Mehdi Sabiri; Nicolas Szczepanski (EGC, 2025)