← Authors

Pierre Marquis

32 papers · 2013–2025 · 4 conferences · across top CS/AI conferences

Achievements

🌍 Conference Polyglot (4) πŸ—ΊοΈ Taxonomy Completionist (32) 🌈 Renaissance Researcher (6) πŸŒ‰ Interdisciplinary Bridge 🧭 Keyword Pioneer 🐝 Cross-Pollinator (13) πŸƒ Academic Marathon (12) 🏠 Conference Loyalist (25) 🀝 Dynamic Duo (16) πŸ”¬ Deep Specialist (11) 🧬 Topic Evolution πŸ† Keyword Champion (7) ❓ The Questioner (2) πŸ—ƒοΈ Keyword Collector (94) πŸ”₯ Unstoppable (11) πŸ’Ž Century Club (32) πŸš€ Conference Pioneer

Conferences

IJCAI (25) AAAI (5) AISTATS (1) EMNLP (1)

Top co-authors

Jean-Marie Lagniez (16) Sébastien Konieczny (8) Gilles Audemard (7) Nicolas Schwind (6) Nicolas Szczepanski (5) Katsumi Inoue (5) Frédéric Koriche (4) Steve Bellart (3) Daniel Le Berre (2) Louènas Bounia (2)

Keywords

explainable ai (7) abductive explanation (6) belief revision (6) decision tree (5) computational complexity (4) random forest (4) iterated belief change (3) model counting (2) axiomatic approach (2) multi-agent system (2) propositional logic (2) belief change (2) contrastive explanation (2) boosted tree (2) pseudo-boolean constraint (2) polynomial time (2) knowledge representation (2) knowledge compilation (2) explanation generation (2) rationality postulate (2)

Papers

Connecting Concept Layers and Rationales to Enhance Language Model Interpretability EMNLP 2025
Iterated Belief Change as Learning IJCAI 2025
On the Computation of Example-Based Abductive Explanations for Random Forests IJCAI 2024
BeliefFlow: A Framework for Logic-Based Belief Diffusion via Iterated Belief Change AAAI 2024
PyXAI: An XAI Library for Tree-Based Models IJCAI 2024
Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories IJCAI 2024
Computing Abductive Explanations for Boosted Regression Trees IJCAI 2023
Editing Boolean Classifiers: A Belief Change Perspective AAAI 2023
On Translations between ML Models for XAI Purposes IJCAI 2023
Computing Abductive Explanations for Boosted Trees AISTATS 2023
Trading Complexity for Sparsity in Random Forest Explanations AAAI 2022
On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Extended Abstract) IJCAI 2022
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits IJCAI 2022
On Preferred Abductive Explanations for Decision Trees and Random Forests IJCAI 2022
Certifying Top-Down Decision-DNNF Compilers AAAI 2021
On Belief Change for Multi-Label Classifier Encodings IJCAI 2021
On Irrelevant Literals in Pseudo-Boolean Constraint Learning IJCAI 2020
On Computational Aspects of Iterated Belief Change IJCAI 2020
Belief Merging Operators as Maximum Likelihood Estimators IJCAI 2020
A Recursive Algorithm for Projected Model Counting AAAI 2019
Rational Inference Relations from Maximal Consistent Subsets Selection IJCAI 2019
What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario IJCAI 2019
Pseudo-Boolean Constraints from a Knowledge Representation Perspective IJCAI 2018
DMC: A Distributed Model Counter IJCAI 2018
An Improved Decision-DNNF Compiler IJCAI 2017
Is Promoting Beliefs Useful to Make Them Accepted in Networks of Agents? IJCAI 2016
Improving Model Counting by Leveraging Definability IJCAI 2016
Extension Enforcement in Abstract Argumentation as an Optimization Problem IJCAI 2015
Compiling Constraint Networks into Multivalued Decomposable Decision Graphs IJCAI 2015
Knowledge Compilation for Model Counting: Affine Decision Trees IJCAI 2013
Semiring Labelled Decision Diagrams, Revisited: Canonicity and Spatial Efficiency Issues IJCAI 2013
Towards a Knowledge Compilation Map for Heterogeneous Representation Languages IJCAI 2013