Nadia Creignou

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 24

Top Topics

Satisfiability Problem

Propositional Logic

Reasoning Tasks

Top Venues

ACM Trans. Comput. Log.

Discret. Appl. Math.

Publications

Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin
On the enumeration of signatures of XOR-CNF's. CoRR (2024)
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Complexity of Reasoning with Cardinality Minimality Conditions. CoRR (2023)
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Complexity of Reasoning with Cardinality Minimality Conditions. AAAI (2023)
Nadia Creignou, Raïda Ktari, Odile Papini
Belief contraction and erasure in fragments of propositional logic. J. Log. Comput. 32 (7) (2022)
Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. MFCS (2022)
Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. CoRR (2022)
Sarah Blind, Nadia Creignou, Frédéric Olive
Locally definable vertex set properties are efficiently enumerable. Discret. Appl. Math. 303 (2021)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterised Enumeration for Modification Problems. Algorithms 12 (9) (2019)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268 (2019)
Nadia Creignou, Raïda Ktari, Odile Papini
Belief Update within Propositional Fragments. J. Artif. Intell. Res. 61 (2018)
Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran
Belief Update in the Horn Fragment. IJCAI (2018)
Nadia Creignou, Reinhard Pichler, Stefan Woltran
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Log. Methods Comput. Sci. 14 (4) (2018)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
On the Complexity of Hard Enumeration Problems. LATA (2017)
Nadia Creignou, Reinhard Pichler, Stefan Woltran
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? CoRR (2017)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60 (4) (2017)
Nadia Creignou, Raïda Ktari, Odile Papini
Complexity of Model Checking for Cardinality-Based Belief Revision Operators. ECSQARU (2017)
Nadia Creignou, Raïda Ktari, Odile Papini
Belief Contraction Within Fragments of Propositional Logic. ECAI (2016)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17 (3) (2016)
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6 (9) (2016)
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
On the Complexity of Hard Enumeration Problems. CoRR (2016)
Nadia Creignou, Raïda Ktari, Odile Papini
Belief Update Within Propositional Fragments. ECSQARU (2015)
Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136 (4) (2015)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration for Modification Problems. LATA (2015)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
Exact location of the phase transition for random (1, 2)-QSAT. RAIRO Theor. Informatics Appl. 49 (1) (2015)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief merging within fragments of propositional logic. CoRR (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15 (3) (2014)
Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran
Belief revision within fragments of propositional logic. J. Comput. Syst. Sci. 80 (2) (2014)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief merging within fragments of propositional logic. ECAI (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for logic-based Argumentation CoRR (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. MFCS (2013)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration with Ordering. CoRR (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. CoRR (2013)
Nadia Creignou, Reinhard Pichler, Stefan Woltran
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI (2013)
Nadia Creignou, Hervé Daudé
Sensitivity of Boolean formulas. Eur. J. Comb. 34 (5) (2013)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity of logic-based argumentation in Schaefer's framework. COMMA (2012)
Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2 (11) (2012)
Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems. SAT (2012)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22 (5) (2012)
Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran
Belief Revision within Fragments of Propositional Logic. KR (2012)
Nadia Creignou, Uwe Egly, Martina Seidl
A Framework for the Specification of Random SAT and QSAT Formulas. TAP@TOOLS (2012)
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13 (2) (2012)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2 (2-3) (2011)
Nadia Creignou, Hervé Daudé, Uwe Egly
Phase Transition for Random Quantified XOR-Formulas CoRR (2011)
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. SAT (2011)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47 (2) (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Sets of Boolean Connectives That Make Argumentation Easier. JELIA (2010)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11 (4) (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic CoRR (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity Classifications for Propositional Abduction in Post's Framework CoRR (2010)
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Log. Methods Comput. Sci. 8 (3) (2010)
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31 (2) (2010)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT (2009)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
The threshold for random (1,2)-QSAT CoRR (2009)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions CoRR (2009)
Nadia Creignou, Hervé Daudé
The SAT-UNSAT transition for random constraint satisfaction problems. Discret. Math. 309 (8) (2009)
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL (2008)
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer
Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42 (2) (2008)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL (2008)
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74 (7) (2008)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT (2008)
Nadia Creignou, Heribert Vollmer
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints (2008)
Nadia Creignou, Hervé Daudé, Uwe Egly
Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. 29 (2007)
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. 14 (023) (2007)
Nadia Creignou, Bruno Zanuttini
A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36 (1) (2006)
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints (2006)
Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints (2006)
Nadia Creignou, Hervé Daudé, John V. Franco
A sharp threshold for the renameable-Horn and the q-Horn properties. Discret. Appl. Math. 153 (1-3) (2005)
Philippe Chapdelaine, Nadia Creignou
The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43 (1) (2005)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electron. Colloquium Comput. Complex. (024) (2005)
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
Preferred representations of Boolean relations Electron. Colloquium Comput. Complex. (119) (2005)
Nadia Creignou, Hervé Daudé
Combinatorial sharpness criterion and phase transition classification for random CSPs. Inf. Comput. 190 (2) (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers (2004)
Nadia Creignou, Hervé Daudé
-XOR-CNF satisfiability. RAIRO Theor. Informatics Appl. 37 (2) (2003)
Nadia Creignou, Hervé Daudé
Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302 (1-3) (2003)
Nadia Creignou, Hervé Daudé, Olivier Dubois
Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Comb. Probab. Comput. 12 (2) (2003)
Nadia Creignou, Hervé Daudé, Olivier Dubois
Approximating the satisfiability threshold for random k-XOR-formulas CoRR (2001)
Nadia Creignou, Hervé Daudé
Satisfiability Threshold for Random XOR-CNF Formulas. Discret. Appl. Math. (1999)
Nadia Creignou
Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68 (4) (1998)
Nadia Creignou, Malika More
Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7 (3) (1997)
Nadia Creignou, Jean-Jacques Hébrard
On Generating All Solutions of Generalized Satisfiability Problems. RAIRO Theor. Informatics Appl. 31 (6) (1997)
Nadia Creignou, Miki Hermann
Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125 (1) (1996)
Nadia Creignou
Exact Complexity of Problems of Incompletely Specified Automata. Ann. Math. Artif. Intell. 16 (1996)
Nadia Creignou
The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. Theor. Comput. Sci. 145 (1&2) (1995)
Nadia Creignou
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. J. Comput. Syst. Sci. 51 (3) (1995)
Nadia Creignou
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. CSL (1992)