1 citations · 2 across the 3 of their papers we have counts for
4 papers
On the enumeration of signatures of XOR-CNF's
Nadia Creignou, Oscar Defrain, Frédéric Olive +1
Given a CNF formula with clauses over a set of variables , a truth assignment generates a binary sequence $σ_φ(\mathbf{a})=(C…
Complexity of Reasoning with Cardinality Minimality Conditions
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Many AI-related reasoning problems are based on the problem of satisfiability of propositional formulas with some cardinality-minimality condition. While the complexity of the sati…
Parameterized Enumeration with Ordering
Nadia Creignou, Raïda Ktari, Arne Meier +3
The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration pro…
Descriptive complexity for pictures languages (extended abstract)
Etienne Grandjean, Frédéric Olive, Gaétan richard
This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. - We uniformly generalize to any dime…