Gilles Audemard

78 papers A* 14A 28B 2C 2Misc 1Journal 18Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees. CoRR Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski
2025	J	`jnl`	Leveraging Association Rules for Better Predictions and Better Explanations. CoRR Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski
2025	J	`jnl`	Proceedings of the 2025 XCSP3 Competition. CoRR Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
2025	—	`conf`	Une interface XAI pour des modèles d'apprentissage automatique à base d'arbres. EGC Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski
2024	A*	`conf`	Check-In Desk Scheduling Optimisation at CDG International Airport. AAAI Thibault Falque, Gilles Audemard, Christophe Lecoutre, Bertrand Mazure
2024	A*	`conf`	Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories. IJCAI Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2024	A	`conf`	Designing an XAI Interface for Tree-Based ML Models. ECAI Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski
2024	A	`conf`	On the Computation of Contrastive Explanations for Boosted Regression Trees. ECAI Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis
2024	A*	`conf`	On the Computation of Example-Based Abductive Explanations for Random Forests. IJCAI Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2024	J	`jnl`	Proceedings of the 2024 XCSP3 Competition. CoRR Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
2024	A*	`conf`	PyXAI: An XAI Library for Tree-Based Models. IJCAI Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2024	—	`conf`	Rectifier pour mieux distiller. EGC Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri
2023	A*	`conf`	Computing Abductive Explanations for Boosted Regression Trees. IJCAI Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis
2023	A	`conf`	Computing Abductive Explanations for Boosted Trees. AISTATS Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2023	A	`conf`	Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP Gilles Audemard, Christophe Lecoutre, Charles Prud'homme
2023	A	`conf`	On Contrastive Explanations for Tree-Based Classifiers. ECAI Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2023	J	`jnl`	Proceedings of the 2023 XCSP3 Competition. CoRR Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
2023	—	`conf`	PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2023	—	`conf`	Sur les explications abductives préférées pour les arbres de décision et les forêts aléatoires. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	A	`conf`	A New Exact Solver for (Weighted) Max#SAT. SAT Gilles Audemard, Jean-Marie Lagniez, Marie Miceli
2022	J	`jnl`	Computing Abductive Explanations for Boosted Trees. CoRR Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2022	—	`conf`	Identifying Soft Cores in Propositional Formulæ. ICAART (2) Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel
2022	—	`conf`	Les raisons majoritaires : des explications abductives pour les forêts aléatoires. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	A*	`conf`	On Preferred Abductive Explanations for Decision Trees and Random Forests. IJCAI Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	J	`jnl`	On the explanatory power of Boolean decision trees. Data Knowl. Eng. Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	J	`jnl`	Proceedings of the 2022 XCSP3 Competition. CoRR Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
2022	—	`conf`	Sur le pouvoir explicatif des arbres de décision. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	A*	`conf`	Trading Complexity for Sparsity in Random Forest Explanations. AAAI Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	A	`conf`	A hybrid CP/MOLS approach for multi-objective imbalanced classification. GECCO Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen
2021	A*	`conf`	On the Computational Intelligibility of Boolean Classifiers. KR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	On the Computational Intelligibility of Boolean Classifiers. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	On the Explanatory Power of Decision Trees. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	Trading Complexity for Sparsity in Random Forest Explanations. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2020	A*	`conf`	On Tractable XAI Queries based on Compiled Representations. KR Gilles Audemard, Frédéric Koriche, Pierre Marquis
2020	A	`conf`	SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. SAT Gilles Audemard, Loïc Paulevé, Laurent Simon
2020	J	`jnl`	SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. CoRR Gilles Audemard, Loïc Paulevé, Laurent Simon
2020	A	`conf`	Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. ECAI Gilles Audemard, Christophe Lecoutre, Mehdi Maamar
2020	J	`jnl`	XCSP Constraints An Int. J. Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel
2020	J	`jnl`	XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems. CoRR Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette
2018	J	`jnl`	On the Glucose SAT Solver. Int. J. Artif. Intell. Tools Gilles Audemard, Laurent Simon
2017	A	`conf`	A Distributed Version of Syrup. SAT Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
2016	A	`conf`	An Adaptive Parallel SAT Solver. CP Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
2016	A	`conf`	Extreme Cases in SAT Problems. SAT Gilles Audemard, Laurent Simon
2014	J	`jnl`	Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon
2014	C	`conf`	An Effective Distributed D&C Approach for the Satisfiability Problem. PDP Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette
2014	—	`conf`	Dolius: A Distributed Parallel SAT Solving Framework. POS@SAT Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette
2014	A	`conf`	Impact of Community Structure on SAT Solver Performance. SAT Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon
2014	A	`conf`	Lazy Clause Exchange Policy for Parallel SAT Solvers. SAT Gilles Audemard, Laurent Simon
2014	A	`conf`	Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel
2013	A	`conf`	Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
2013	A*	`conf`	Just-In-Time Compilation of Knowledge Bases. IJCAI Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
2012	A	`conf`	Refining Restarts Strategies for SAT and UNSAT. CP Gilles Audemard, Laurent Simon
2012	A	`conf`	Revisiting Clause Exchange in Parallel SAT Solving. SAT Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
2011	A	`conf`	On Freezing and Reactivating Learnt Clauses. SAT Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
2010	A*	`conf`	A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI Gilles Audemard, George Katsirelos, Laurent Simon
2010	—	`conf`	Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
2009	—	`conf`	Integrating Conflict Driven Clause Learning to Local Search LSCS Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
2009	B	`conf`	Learning in Local Search. ICTAI Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
2009	A*	`conf`	Predicting Learnt Clauses Quality in Modern SAT Solvers. IJCAI Gilles Audemard, Laurent Simon
2008	A	`conf`	A Generalized Framework for Conflict Analysis. SAT Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais
2008	A	`conf`	Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. CP Gilles Audemard, Laurent Simon
2008	J	`jnl`	SAT graph-based representation: A new perspective. J. Algorithms Gilles Audemard, Saïd Jabbour, Lakhdar Sais
2007	A	`conf`	Circuit Based Encoding of CNF Formula. SAT Gilles Audemard, Lakhdar Sais
2007	A*	`conf`	GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. IJCAI Gilles Audemard, Laurent Simon
2007	A*	`conf`	Symmetry Breaking in Quantified Boolean Formulae. IJCAI Gilles Audemard, Saïd Jabbour, Lakhdar Sais
2006	J	`jnl`	Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. Gilles Audemard, Belaid Benhamou, Laurent Henocque
2005	A	`conf`	A Symbolic Search Based Approach for Quantified Boolean Formulas. SAT Gilles Audemard, Lakhdar Sais
2004	A	`conf`	Dealing with Symmetries in Quantified Boolean Formulas. SAT Gilles Audemard, Bertrand Mazure, Lakhdar Sais
2004	B	`conf`	SAT Based BDD Solver for Quantified Boolean Formulas. ICTAI Gilles Audemard, Lakhdar Sais
2004	—	`conf`	Verifying Industrial Hybrid Systems with MathSAT. BMC@CAV Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani
2002	A	`conf`	A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. CADE Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
2002	C	`conf`	Bounded Model Checking for Timed Systems. FORTE Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
2002	Misc	`conf`	Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. AISC Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
2002	A	`conf`	Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE Gilles Audemard, Belaid Benhamou
2001	—	`conf`	Etude des symétries dans les modèles finis. JFPLC Gilles Audemard, Belaid Benhamou
2001	A	`conf`	The eXtended Least Number Heuristic. IJCAR Gilles Audemard, Laurent Henocque
2000	—	`conf`	AVAL: An Enumerative Method for SAT. Computational Logic Gilles Audemard, Belaid Benhamou, Pierre Siegel
2000	A	`conf`	Two Techniques to Improve Finite Model Search. CADE Gilles Audemard, Belaid Benhamou, Laurent Henocque