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

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

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

A CSP Solver Focusing on fac Variables. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (CP, 2011)

Dynamic Polarity Adjustment in a Parallel SAT Solver. - Long Guo; Jean-Marie Lagniez (ICTAI, 2011)

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

Relax! - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (ICTAI, 2012)

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

Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (ICTAI, 2013)

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

Preserving Partial Solutions While Relaxing Constraint Networks. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (IJCAI, 2013)

Knowledge Compilation for Model Counting: Affine Decision Trees. - Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis; Samuel Thomas (IJCAI, 2013)

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

Factoring Out Assumptions to Speed Up MUS Extraction. - Jean-Marie Lagniez; Armin Biere (SAT, 2013)

Improving MUC extraction thanks to local search. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (CoRR, 2013)

An Experimentally Efficient Method for (MSS, CoMSS) Partitioning. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (AAAI, 2014)

Preprocessing for Propositional Model Counting. - Jean-Marie Lagniez; Pierre Marquis (AAAI, 2014)

A General Artificial Intelligence Approach for Skeptical Reasoning. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (AGI, 2014)

Symmetry-Driven Decision Diagrams for Knowledge Compilation. - Anicet Bart; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (ECAI, 2014)

Enforcing Solutions in Constraint Networks. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (ECAI, 2014)

Multiple Contraction through Partial-Max-SAT. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (ICTAI, 2014)

Boosting MUC extraction in unsatisfiable constraint networks. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (Appl. Intell., 2014)

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

On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts. - Philippe Besnard; Éric Grégoire; Jean-Marie Lagniez (AAAI, 2015)

CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver. - Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly (ICTAI, 2015)

Compiling Constraint Networks into Multivalued Decomposable Decision Graphs. - Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis; Samuel Thomas (IJCAI, 2015)

On Anti-subsumptive Knowledge Enforcement. - Éric Grégoire; Jean-Marie Lagniez (LPAR, 2015)

On getting rid of the preprocessing minimization step in MUC-finding algorithms. - Éric Grégoire; Jean-Marie Lagniez; Bertrand Mazure (Constraints An Int. J., 2015)

Logical consensuses for case-based reasoning and for mathematical engineering of AI. - Éric Grégoire; Jean-Marie Lagniez; Du Zhang (ICCI*CC, 2016)

On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts. - Éric Grégoire; Yacine Izza; Jean-Marie Lagniez (AAAI, 2016)

On Checking Kripke Models for Modal Logic K. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (PAAR@IJCAR, 2016)

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

On Computing Non-hypocritical Consensuses in Standard Logic. - Éric Grégoire; Jean-Marie Lagniez; Du Zhang (DEXA Workshops, 2016)

An Improved CNF Encoding Scheme for Probabilistic Inference. - Anicet Bart; Frédéric Koriche; Jean-Marie Lagniez; Pierre Marquis (ECAI, 2016)

A Computational Approach to Consensus-Finding. - Éric Grégoire; Jean-Marie Lagniez (ECAI, 2016)

On Consensus Extraction. - Éric Grégoire; Sébastien Konieczny; Jean-Marie Lagniez (IJCAI, 2016)

Improving Model Counting by Leveraging Definability. - Jean-Marie Lagniez; Emmanuel Lonca; Pierre Marquis (IJCAI, 2016)

A Computational Method for Enforcing Knowledge that Cannot be Subsumed. - Éric Grégoire; Jean-Marie Lagniez (Int. J. Artif. Intell. Tools, 2016)

RCL: An A. I. Tool for Computing Maximal Consensuses. - Éric Grégoire; Jean-Marie Lagniez (Int. J. Artif. Intell. Tools, 2016)

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. - Thomas Caridroit; Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (AAAI, 2017)

SAT Encodings for Distance-Based Belief Merging Operators. - Sébastien Konieczny; Jean-Marie Lagniez; Pierre Marquis (AAAI, 2017)

Combining Nogoods in Restart-Based Search. - Gael Glorian; Frédéric Boussemart; Jean-Marie Lagniez; Christophe Lecoutre; Bertrand Mazure (CP, 2017)

Defining and Evaluating Heuristics for the Compilation of Constraint Networks. - Jean-Marie Lagniez; Pierre Marquis; Anastasia Paparrizou (CP, 2017)

On Computing One Max_Subset Inclusion Consensus. - Éric Grégoire; Yacine Izza; Jean-Marie Lagniez (ICTAI, 2017)

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAI, 2017)

An Improved Decision-DNNF Compiler. - Jean-Marie Lagniez; Pierre Marquis (IJCAI, 2017)

Boosting Distance-Based Revision Using SAT Encodings. - Sébastien Konieczny; Jean-Marie Lagniez; Pierre Marquis (LORI, 2017)

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

On Preprocessing Techniques and Their Impact on Propositional Model Counting. - Jean-Marie Lagniez; Pierre Marquis (J. Autom. Reason., 2017)

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAR, 2018)

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Michael Sioutis (CP, 2018)

Boosting MCSes Enumeration. - Éric Grégoire; Yacine Izza; Jean-Marie Lagniez (IJCAI, 2018)

DMC: A Distributed Model Counter. - Jean-Marie Lagniez; Pierre Marquis; Nicolas Szczepanski (IJCAI, 2018)

A SAT-Based Approach For PSPACE Modal Logics. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (KR, 2018)

Probabilistic Coalition Structure Generation. - Nicolas Schwind; Tenda Okimoto; Katsumi Inoue; Katsutoshi Hirayama; Jean-Marie Lagniez; Pierre Marquis (KR, 2018)

Consensus-finding that preserves mutually conflicting hypothetical information from a same agent. - Éric Grégoire; Jean-Marie Lagniez; Du Zhang (AI Commun., 2018)

Preface. - Éric Grégoire; Jean-Marie Lagniez; Du Zhang (Int. J. Artif. Intell. Tools, 2018)

Promenade au-delà de NP. (Beyond NP). - Jean-Marie Lagniez (2019)

A Recursive Algorithm for Projected Model Counting. - Jean-Marie Lagniez; Pierre Marquis (AAAI, 2019)

An Incremental SAT-Based Approach to the Graph Colouring Problem. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Nicolas Szczepanski (CP, 2019)

What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario. - Nicolas Schwind; Katsumi Inoue; Sébastien Konieczny; Jean-Marie Lagniez; Pierre Marquis (IJCAI, 2019)

Introducing the Fourth International Competition on Computational Models of Argumentation. - Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly; Julien Rossit (SAFA@COMMA, 2020)

Consolidating Modal Knowledge Bases. - Zied Bouraoui; Jean-Marie Lagniez; Pierre Marquis; Valentin Montmirail (ECAI, 2020)

On Computational Aspects of Iterated Belief Change. - Nicolas Schwind; Sébastien Konieczny; Jean-Marie Lagniez; Pierre Marquis (IJCAI, 2020)

NACRE - A Nogood And Clause Reasoning Engine. - Gael Glorian; Jean-Marie Lagniez; Christophe Lecoutre (LPAR, 2020)

Definability for model counting. - Jean-Marie Lagniez; Emmanuel Lonca; Pierre Marquis (Artif. Intell., 2020)

Certifying Top-Down Decision-DNNF Compilers. - Florent Capelli; Jean-Marie Lagniez; Pierre Marquis (AAAI, 2021)

Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience. - Nicolas Schwind; Emir Demirovic; Katsumi Inoue; Jean-Marie Lagniez (AAMAS, 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 computation of probabilistic coalition structures. - Nicolas Schwind; Tenda Okimoto; Katsumi Inoue; Katsutoshi Hirayama; Jean-Marie Lagniez; Pierre Marquis (Auton. Agents Multi Agent Syst., 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)

Design and Results of ICCMA 2021. - Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly; Julien Rossit (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)

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)

Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks. - Sara Riva; Jean-Marie Lagniez; Gustavo Magaña López; Loïc Paulevé (CMSB, 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)

Boosting Definability Bipartition Computation Using SAT Witnesses. - Jean-Marie Lagniez; Pierre Marquis (JELIA, 2023)

A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation. - Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly; Julien Rossit (Arg&App@KR, 2023)

Algorithms for partially robust team formation. - Nicolas Schwind; Emir Demirovic; Katsumi Inoue; Jean-Marie Lagniez (Auton. Agents Multi Agent Syst., 2023)

A SAT-based Approach for Argumentation Dynamics. - Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly (AAMAS, 2024)

On the Computation of Contrastive Explanations for Boosted Regression Trees. - Gilles Audemard; Jean-Marie Lagniez; Pierre Marquis (ECAI, 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)

A Top-Down Tree Model Counter for Quantified Boolean Formulas. - Florent Capelli; Jean-Marie Lagniez; Andreas Plank; Martina Seidl (IJCAI, 2024)

Leveraging Decision-DNNF Compilation for Enumerating Disjoint Partial Models. - Jean-Marie Lagniez; Emmanuel Lonca (KR, 2024)

Learning Model Agnostic Explanations via Constraint Programming. - Frédéric Koriche; Jean-Marie Lagniez; Stefan Mengel; Chi Tran (ECML/PKDD (4), 2024)

Dynamic Blocked Clause Elimination for Projected Model Counting. - Jean-Marie Lagniez; Pierre Marquis; Armin Biere (SAT, 2024)

Reducing Quantum Circuit Synthesis to #SAT. - Dekel Zak; Jingyi Mei; Jean-Marie Lagniez; Alfons Laarman (CP, 2025)

Enhancing Query Efficiency for D-DNNF Representations Through Preprocessing. - Jean-Marie Lagniez; Emmanuel Lonca (JELIA (2), 2025)

Probabilistic Explanations for Regression Models. - Frédéric Koriche; Jean-Marie Lagniez; Chi Tran (UAI, 2025)

The third and fourth international competitions on computational models of argumentation: Design, results and analysis. - Stefano Bistarelli; Lars Kotthoff; Jean-Marie Lagniez; Emmanuel Lonca; Jean-Guy Mailly; Julien Rossit; Francesco Santini 001; Carlo Taticchi (Argument Comput., 2025)