Search Results for author: Nadia Creignou

Found 2 papers, 0 papers with code

Enumeration Classes Defined by Circuits

no code implementations1 May 2022 Nadia Creignou, Arnaud Durand, Heribert Vollmer

We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators.

Belief merging within fragments of propositional logic

no code implementations25 Apr 2014 Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran

This paper presents a general approach to define new merging operators derived from existing ones such that the result of merging remains in the fragment under consideration.

Cannot find the paper you are looking for? You can Submit a new open access paper.