Nadia Creignou

99 papers A* 5A 9B 6C 5Journal 62Unranked 9
YearRankTypeTitle / Venue / Authors
2026 — conf
From FPT Decision to FPT Enumeration.
FoIKS
Nadia Creignou, Timo Camillo Merkl, Reinhard Pichler, Daniel Unterberger
2025 J jnl
Enumeration Classes Defined by Circuits.
ACM Trans. Comput. Theory
Nadia Creignou, Arnaud Durand, Heribert Vollmer
2025 J jnl
From FPT Decision to FPT Enumeration.
CoRR
Nadia Creignou, Timo Camillo Merkl, Reinhard Pichler, Daniel Unterberger
2025 B conf
On the Enumeration of Signatures of XOR-CNF's.
WADS
Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin
2024 A conf
Belief Erasure in Propositional Logic.
ECAI
Nadia Creignou, Raïda Ktari, Odile Papini
2024 — conf
Effacement des croyances en logique propositionnelle.
JIAF-JFPDA
Nadia Creignou, Raïda Ktari, Odile Papini
2024 J jnl
On the enumeration of signatures of XOR-CNF's.
CoRR
Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin
2024 J jnl
Special issue on logic and complexity.
Math. Struct. Comput. Sci.
Nadia Creignou, Arnaud Durand, Heribert Vollmer
2023 A* conf
Complexity of Reasoning with Cardinality Minimality Conditions.
AAAI
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2023 J jnl
Complexity of Reasoning with Cardinality Minimality Conditions.
CoRR
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2022 J jnl
Belief contraction and erasure in fragments of propositional logic.
J. Log. Comput.
Nadia Creignou, Raïda Ktari, Odile Papini
2022 B conf
Enumeration Classes Defined by Circuits.
MFCS
Nadia Creignou, Arnaud Durand, Heribert Vollmer
2022 J jnl
Enumeration Classes Defined by Circuits.
CoRR
Nadia Creignou, Arnaud Durand, Heribert Vollmer
2021 J jnl
Locally definable vertex set properties are efficiently enumerable.
Discret. Appl. Math.
Sarah Blind, Nadia Creignou, Frédéric Olive
2019 J jnl
A complexity theory for hard enumeration problems.
Discret. Appl. Math.
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2019 J jnl
Parameterised Enumeration for Modification Problems.
Algorithms
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2018 A* conf
Belief Update in the Horn Fragment.
IJCAI
Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran
2018 J jnl
Belief Update within Propositional Fragments.
J. Artif. Intell. Res.
Nadia Creignou, Raïda Ktari, Odile Papini
2018 J jnl
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Log. Methods Comput. Sci.
Nadia Creignou, Reinhard Pichler, Stefan Woltran
2017 C conf
Complexity of Model Checking for Cardinality-Based Belief Revision Operators.
ECSQARU
Nadia Creignou, Raïda Ktari, Odile Papini
2017 J jnl
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
CoRR
Nadia Creignou, Reinhard Pichler, Stefan Woltran
2017 C conf
On the Complexity of Hard Enumeration Problems.
LATA
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2017 J jnl
Paradigms for Parameterized Enumeration.
Theory Comput. Syst.
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2016 A conf
Belief Contraction Within Fragments of Propositional Logic.
ECAI
Nadia Creignou, Raïda Ktari, Odile Papini
2016 J jnl
Belief Merging within Fragments of Propositional Logic.
ACM Trans. Comput. Log.
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
2016 J jnl
On the Complexity of Hard Enumeration Problems.
CoRR
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2016 J jnl
SAT and Interactions (Dagstuhl Seminar 16381).
Dagstuhl Reports
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer
2016 A ed.
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
SAT
Nadia Creignou, Daniel Le Berre
2015 C conf
Belief Update Within Propositional Fragments.
ECSQARU
Nadia Creignou, Raïda Ktari, Odile Papini
2015 J jnl
Exact location of the phase transition for random (1, 2)-QSAT.
RAIRO Theor. Informatics Appl.
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
2015 J jnl
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting.
Fundam. Informaticae
Nadia Creignou, Heribert Vollmer
2015 C conf
Parameterized Enumeration for Modification Problems.
LATA
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2014 A conf
Belief merging within fragments of propositional logic.
ECAI
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
2014 J jnl
Belief merging within fragments of propositional logic.
CoRR
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
2014 J jnl
Belief revision within fragments of propositional logic.
J. Comput. Syst. Sci.
Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran
2014 J jnl
Complexity Classifications for Logic-Based Argumentation.
ACM Trans. Comput. Log.
Nadia Creignou, Uwe Egly, Johannes Schmidt
2013 J jnl
Complexity Classifications for logic-based Argumentation
CoRR
Nadia Creignou, Uwe Egly, Johannes Schmidt
2013 A* conf
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
IJCAI
Nadia Creignou, Reinhard Pichler, Stefan Woltran
2013 B conf
Paradigms for Parameterized Enumeration.
MFCS
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 J jnl
Paradigms for Parameterized Enumeration.
CoRR
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 J jnl
Parameterized Enumeration with Ordering.
CoRR
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2013 J jnl
Sensitivity of Boolean formulas.
Eur. J. Comb.
Nadia Creignou, Hervé Daudé
2012 — conf
A Framework for the Specification of Random SAT and QSAT Formulas.
TAP@TOOLS
Nadia Creignou, Uwe Egly, Martina Seidl
2012 A* conf
Belief Revision within Fragments of Propositional Logic.
KR
Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran
2012 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework.
J. Log. Comput.
Nadia Creignou, Johannes Schmidt, Michael Thomas
2012 C conf
Complexity of logic-based argumentation in Schaefer's framework.
COMMA
Nadia Creignou, Uwe Egly, Johannes Schmidt
2012 A conf
Parameterized Complexity of Weighted Satisfiability Problems.
SAT
Nadia Creignou, Heribert Vollmer
2012 J jnl
SAT Interactions (Dagstuhl Seminar 12471).
Dagstuhl Reports
Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
2012 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
ACM Trans. Comput. Log.
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
2011 J jnl
Complexity of logic-based argumentation in Post's framework.
Argument Comput.
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2011 A conf
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.
SAT
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2011 J jnl
Phase Transition for Random Quantified XOR-Formulas
CoRR
Nadia Creignou, Hervé Daudé, Uwe Egly
2010 J jnl
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Log. Methods Comput. Sci.
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 A* conf
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions.
KR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 J jnl
Nonuniform Boolean constraint satisfaction problems with cardinality constraint.
ACM Trans. Comput. Log.
Nadia Creignou, Henning Schnoor, Ilka Schnoor
2010 B conf
Sets of Boolean Connectives That Make Argumentation Easier.
JELIA
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2010 J jnl
The Complexity of Problems for Quantified Constraints.
Theory Comput. Syst.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic
CoRR
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 — conf
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
Circuits, Logic, and Games
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 J jnl
The Helly property and satisfiability of Boolean formulas defined on set families.
Eur. J. Comb.
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
2009 A conf
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.
SAT
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
2009 J jnl
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2009 J jnl
The SAT-UNSAT transition for random constraint satisfaction problems.
Discret. Math.
Nadia Creignou, Hervé Daudé
2009 J jnl
The threshold for random (1,2)-QSAT
CoRR
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
2008 — conf
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?.
Complexity of Constraints
Nadia Creignou, Heribert Vollmer
2008 J jnl
Complexity of Clausal Constraints Over Chains.
Theory Comput. Syst.
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer
2008 — ed.
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar].
Complexity of Constraints
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2008 — conf
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
ISMVL
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
2008 A conf
New Results on the Phase Transition for Random Quantified Boolean Formulas.
SAT
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
2008 B conf
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.
CSL
Nadia Creignou, Henning Schnoor, Ilka Schnoor
2008 J jnl
Structure identification of Boolean relations and plain bases for co-clones.
J. Comput. Syst. Sci.
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
2007 J jnl
Phase Transition for Random Quantified XOR-Formulas.
J. Artif. Intell. Res.
Nadia Creignou, Hervé Daudé, Uwe Egly
2007 J jnl
The Complexity of Problems for Quantified Constraints.
Electron. Colloquium Comput. Complex.
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
2006 — conf
06401 Abstracts Collection - Complexity of Constraints.
Complexity of Constraints
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2006 — conf
06401 Executive Summary - Complexity of Constraints.
Complexity of Constraints
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2006 J jnl
A Complete Classification of the Complexity of Propositional Abduction.
SIAM J. Comput.
Nadia Creignou, Bruno Zanuttini
2006 — ed.
Complexity of Constraints, 01.10. - 06.10.2006
Complexity of Constraints
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2005 J jnl
A sharp threshold for the renameable-Horn and the q-Horn properties.
Discret. Appl. Math.
Nadia Creignou, Hervé Daudé, John V. Franco
2005 J jnl
Preferred representations of Boolean relations
Electron. Colloquium Comput. Complex.
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
2005 J jnl
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electron. Colloquium Comput. Complex.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005 J jnl
The complexity of Boolean constraint satisfaction local search problems.
Ann. Math. Artif. Intell.
Philippe Chapdelaine, Nadia Creignou
2004 A conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 — conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 J jnl
Combinatorial sharpness criterion and phase transition classification for random CSPs.
Inf. Comput.
Nadia Creignou, Hervé Daudé
2003 J jnl
Approximating The Satisfiability Threshold For Random K-Xor-Formulas.
Comb. Probab. Comput.
Nadia Creignou, Hervé Daudé, Olivier Dubois
2003 J jnl
Generalized satisfiability problems: minimal elements and phase transitions.
Theor. Comput. Sci.
Nadia Creignou, Hervé Daudé
2003 J jnl
Smooth and sharp thresholds for random
RAIRO Theor. Informatics Appl.
Nadia Creignou, Hervé Daudé
2001 J jnl
Approximating the satisfiability threshold for random k-XOR-formulas
CoRR
Nadia Creignou, Hervé Daudé, Olivier Dubois
2001 — book
Complexity classifications of Boolean constraint satisfaction problems.
Nadia Creignou, Sanjeev Khanna, Madhu Sudan
1999 J jnl
Satisfiability Threshold for Random XOR-CNF Formulas.
Discret. Appl. Math.
Nadia Creignou, Hervé Daudé
1998 J jnl
Complexity Versus Stability for Classes of Propositional Formulas.
Inf. Process. Lett.
Nadia Creignou
1997 J jnl
Complexity of Satisfiability Problems with Symmetric Polynomial Clauses.
J. Log. Comput.
Nadia Creignou, Malika More
1997 J jnl
On Generating All Solutions of Generalized Satisfiability Problems.
RAIRO Theor. Informatics Appl.
Nadia Creignou, Jean-Jacques Hébrard
1996 J jnl
Complexity of Generalized Satisfiability Counting Problems.
Inf. Comput.
Nadia Creignou, Miki Hermann
1996 J jnl
Exact Complexity of Problems of Incompletely Specified Automata.
Ann. Math. Artif. Intell.
Nadia Creignou
1995 J jnl
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems.
J. Comput. Syst. Sci.
Nadia Creignou
1995 J jnl
The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.
Theor. Comput. Sci.
Nadia Creignou
1992 B conf
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.
CSL
Nadia Creignou