6 citations · 13 across the 9 of their papers we have counts for
10 papers
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).…
Explanation Quality Assessment as Ranking with Listwise Rewards
Thomas Bailleux, Tanmoy Mukherjee, Emmanuel Lonca +2
We reformulate explanation quality assessment as a ranking problem rather than a generation problem. Instead of optimizing models to produce a single "best" explanation token-by-to…
Proceedings of the 2025 XCSP3 Competition
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2025 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'25 (31st International Conference…
Proceedings of the 2024 XCSP3 Competition
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2024 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'24 (30th International Conference…
Proceedings of the 2023 XCSP3 Competition
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2023 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'23 (the 29th International Confer…
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
Analyzing a Feature Model (FM) and reasoning on the corresponding configuration space is a central task in Software Product Line (SPL) engineering. Problems such as deciding the sa…
Proceedings of the 2022 XCSP3 Competition
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2022 XCSP3 Competition. The results of this competition of constraint solvers were presented at FLOC (Federated Logic Conference) 20…
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
We are interested in computing most preferred models of a given d-DNNF circuit , where the preference relation is based on an algebraic structure called a monotone, totally…
Design and Results of ICCMA 2021
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly +1
Since 2015, the International Competition on Computational Models of Argumentation (ICCMA) provides a systematic comparison of the different algorithms for solving some classical r…
On the Complexity of Optimization Problems based on Compiled NNF Representations
Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set…