activity
20092026
most citedDesign and Results of ICCMA 2021

6 citations · 18 across the 17 of their papers we have counts for

collaborators

18 papers

cs.AI2026

Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding

Arthur Ledaguenel, Florent Capelli, Jean-Marie Lagniez

The widespread adoption of artificial intelligence (AI) within real-world applications has raised a lot of concerns regarding their trustworthiness, especially in critical applicat…

cs.AI2026

MiSS: A Logic-Driven Explanation of Minimal Sufficient Coalitions for Point Cloud Classifiers

Mengda Xing, Jean-Marie Lagniez

We present MiSS, a black-box, query-based framework for explaining 3D point cloud classifiers through perturbation-relative sufficiency reasoning. MiSS treats a superpoint partitio…

cs.LG2026

AI-Driven Surrogate Models for Predicting Electrode-Scale Discharge Behavior in Lithium-Ion Batteries

Mengda Xing, Jean-Marie Lagniez, Alejandro Franco

Physics-based simulations are essential for understanding the electrode-scale discharge behavior of lithium-ion batteries (LIBs) but suffer from prohibitive computational costs. To…

cs.DC2026

A Distributed Framework for Compiling and Reasoning with d-DNNF

Zhenghang Xu, Minghao Yin, jianan Wang +1

Knowledge Compilation (KC) is a powerful paradigm that enables efficient reasoning by transforming propositional formulas into tractable target languages, such as Deterministic, De…

cs.DC2026

gDMC: A Generic Distributed Model Counting Framework via Work-Stealing

Zhenghang Xu, Minghao Yin, Jumping Zhou +1

Propositional Model Counting () is essential for probabilistic reasoning but faces scalability limits on single cores. Existing distributed approaches struggle with…

cs.AI2026

Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing

Jean Marie Lagniez, Emmanuel Lonca

In this paper, we investigate preprocessing techniques aimed at improving the efficiency of accessing models of propositional formulas represented in conjunctive normal form (CNF).…