activity
20142024
most citedOn the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits

5 citations · 11 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2024

Dynamic Blocked Clause Elimination for Projected Model Counting

Jean-Marie Lagniez, Pierre Marquis, Armin Biere

In this paper, we explore the application of blocked clause elimination for projected model counting. This is the problem of determining the number of models ||\exists X.Σ|| of a p…

cs.AI20241 cited

Reasoning About Action and Change

Florence Dupin de Saint-Cyr, Andreas Herzig, Jérôme Lang +1

The purpose of this book is to provide an overview of AI research, ranging from basic work to interfaces and applications, with as much emphasis on results as on current issues. It…

cs.SE20232 cited

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…

cs.AI20235 cited

On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits

Alexis de Colnet, Pierre Marquis

We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study EnumIP f…

cs.AI20143 cited

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…