Jean-Marie Lagniez

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 71

Top Topics

Abstract Argumentation

Constraint Networks

Top Venues

Publications

Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly
A SAT-based Approach for Argumentation Dynamics. AAMAS (2024)
Jean-Marie Lagniez, Pierre Marquis, Armin Biere
Dynamic Blocked Clause Elimination for Projected Model Counting. SAT (2024)
Sara Riva, Jean-Marie Lagniez, Gustavo Magaña López, Loïc Paulevé
Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks. CoRR (2023)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
On Contrastive Explanations for Tree-Based Classifiers. ECAI (2023)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Sur les explications abductives préférées pour les arbres de décision et les forêts aléatoires. EGC (2023)
Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis
Computing Abductive Explanations for Boosted Regression Trees. IJCAI (2023)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
Computing Abductive Explanations for Boosted Trees. AISTATS (2023)
Gilles Audemard, Steve Bellart, Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. EGC (2023)
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit
A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation. Arg&App@KR (2023)
Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez
Algorithms for partially robust team formation. Auton. Agents Multi Agent Syst. 37 (2) (2023)
Jean-Marie Lagniez, Pierre Marquis
Boosting Definability Bipartition Computation Using SAT Witnesses. JELIA (2023)
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit
A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation. JIAF (2023)
Sara Riva, Jean-Marie Lagniez, Gustavo Magaña López, Loïc Paulevé
Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks. CMSB (2023)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
Computing Abductive Explanations for Boosted Trees. CoRR (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Trading Complexity for Sparsity in Random Forest Explanations. AAAI (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. EGC (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On Preferred Abductive Explanations for Decision Trees and Random Forests. IJCAI (2022)
Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel
Identifying Soft Cores in Propositional Formulæ. ICAART (2) (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. EGC (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the explanatory power of Boolean decision trees. Data Knowl. Eng. 142 (2022)
Gilles Audemard, Jean-Marie Lagniez, Marie Miceli
A New Exact Solver for (Weighted) Max#SAT. SAT (2022)
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit
Design and Results of ICCMA 2021. CoRR (2021)
Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis
On the computation of probabilistic coalition structures. Auton. Agents Multi Agent Syst. 35 (1) (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. KR (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. CoRR (2021)
Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez
Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience. AAMAS (2021)
Florent Capelli, Jean-Marie Lagniez, Pierre Marquis
Certifying Top-Down Decision-DNNF Compilers. AAAI (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Explanatory Power of Decision Trees. CoRR (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Trading Complexity for Sparsity in Random Forest Explanations. CoRR (2021)
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit
Introducing the Fourth International Competition on Computational Models of Argumentation. SAFA@COMMA (2020)
Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre
NACRE - A Nogood And Clause Reasoning Engine. LPAR (2020)
Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis
Definability for model counting. Artif. Intell. 281 (2020)
Nicolas Schwind, Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis
On Computational Aspects of Iterated Belief Change. IJCAI (2020)
Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis, Valentin Montmirail
Consolidating Modal Knowledge Bases. ECAI (2020)
Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski
An Incremental SAT-Based Approach to the Graph Colouring Problem. CP (2019)
Jean-Marie Lagniez, Pierre Marquis
A Recursive Algorithm for Projected Model Counting. AAAI (2019)
Nicolas Schwind, Katsumi Inoue, Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis
What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario. IJCAI (2019)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. IJCAR (2018)
Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. CP (2018)
Éric Grégoire, Jean-Marie Lagniez, Du Zhang
Consensus-finding that preserves mutually conflicting hypothetical information from a same agent. AI Commun. 31 (3) (2018)
Éric Grégoire, Yacine Izza, Jean-Marie Lagniez
Boosting MCSes Enumeration. IJCAI (2018)
Éric Grégoire, Jean-Marie Lagniez, Du Zhang
Preface. Int. J. Artif. Intell. Tools 27 (1) (2018)
Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis
Probabilistic Coalition Structure Generation. KR (2018)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A SAT-Based Approach For PSPACE Modal Logics. KR (2018)
Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
DMC: A Distributed Model Counter. IJCAI (2018)
Jean-Marie Lagniez, Pierre Marquis, Anastasia Paparrizou
Defining and Evaluating Heuristics for the Compilation of Constraint Networks. CP (2017)
Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, Bertrand Mazure
Combining Nogoods in Restart-Based Search. CP (2017)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI (2017)
Jean-Marie Lagniez, Pierre Marquis
An Improved Decision-DNNF Compiler. IJCAI (2017)
Jean-Marie Lagniez, Pierre Marquis
On Preprocessing Techniques and Their Impact on Propositional Model Counting. J. Autom. Reason. 58 (4) (2017)
Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis
Boosting Distance-Based Revision Using SAT Encodings. LORI (2017)
Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis
SAT Encodings for Distance-Based Belief Merging Operators. AAAI (2017)
Éric Grégoire, Yacine Izza, Jean-Marie Lagniez
On Computing One Max_Subset Inclusion Consensus. ICTAI (2017)
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
A Distributed Version of Syrup. SAT (2017)
Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. AAAI (2017)
Éric Grégoire, Jean-Marie Lagniez
A Computational Approach to Consensus-Finding. ECAI (2016)
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
An Adaptive Parallel SAT Solver. CP (2016)
Éric Grégoire, Yacine Izza, Jean-Marie Lagniez
On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts. AAAI (2016)
Éric Grégoire, Sébastien Konieczny, Jean-Marie Lagniez
On Consensus Extraction. IJCAI (2016)
Éric Grégoire, Jean-Marie Lagniez, Du Zhang
On Computing Non-hypocritical Consensuses in Standard Logic. DEXA Workshops (2016)
Éric Grégoire, Jean-Marie Lagniez
RCL: An A. I. Tool for Computing Maximal Consensuses. Int. J. Artif. Intell. Tools 25 (4) (2016)
Éric Grégoire, Jean-Marie Lagniez, Du Zhang
Logical consensuses for case-based reasoning and for mathematical engineering of AI. ICCI*CC (2016)
Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis
Improving Model Counting by Leveraging Definability. IJCAI (2016)
Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
An Improved CNF Encoding Scheme for Probabilistic Inference. ECAI (2016)
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
On Checking Kripke Models for Modal Logic K. PAAR@IJCAR (2016)
Éric Grégoire, Jean-Marie Lagniez
A Computational Method for Enforcing Knowledge that Cannot be Subsumed. Int. J. Artif. Intell. Tools 25 (4) (2016)
Éric Grégoire, Jean-Marie Lagniez
On Anti-subsumptive Knowledge Enforcement. LPAR (2015)
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly
CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver. ICTAI (2015)
Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas
Compiling Constraint Networks into Multivalued Decomposable Decision Graphs. IJCAI (2015)
Philippe Besnard, Éric Grégoire, Jean-Marie Lagniez
On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts. AAAI (2015)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
On getting rid of the preprocessing minimization step in MUC-finding algorithms. Constraints An Int. J. 20 (4) (2015)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Enforcing Solutions in Constraint Networks. ECAI (2014)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
An Experimentally Efficient Method for (MSS, CoMSS) Partitioning. AAAI (2014)
Jean-Marie Lagniez, Pierre Marquis
Preprocessing for Propositional Model Counting. AAAI (2014)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Multiple Contraction through Partial-Max-SAT. ICTAI (2014)
Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Symmetry-Driven Decision Diagrams for Knowledge Compilation. ECAI (2014)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Boosting MUC extraction in unsatisfiable constraint networks. Appl. Intell. 41 (4) (2014)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
A General Artificial Intelligence Approach for Skeptical Reasoning. AGI (2014)
Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28 (5) (2014)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Preserving Partial Solutions While Relaxing Constraint Networks. IJCAI (2013)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Improving MUC extraction thanks to local search. CoRR (2013)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms. ICTAI (2013)
Jean-Marie Lagniez, Armin Biere
Factoring Out Assumptions to Speed Up MUS Extraction. SAT (2013)
Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT (2013)
Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas
Knowledge Compilation for Model Counting: Affine Decision Trees. IJCAI (2013)
Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
Just-In-Time Compilation of Knowledge Bases. IJCAI (2013)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
Relax! ICTAI (2012)
Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
Revisiting Clause Exchange in Parallel SAT Solving. SAT (2012)
Long Guo, Jean-Marie Lagniez
Dynamic Polarity Adjustment in a Parallel SAT Solver. ICTAI (2011)
Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure
A CSP Solver Focusing on fac Variables. CP (2011)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
On Freezing and Reactivating Learnt Clauses. SAT (2011)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) (2010)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Learning in Local Search. ICTAI (2009)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Integrating Conflict Driven Clause Learning to Local Search LSCS (2009)