default search action
Nadia Creignou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c28]Nadia Creignou, Raïda Ktari, Odile Papini
:
Belief Erasure in Propositional Logic. ECAI 2024: 1230-1237 - [c27]Nadia Creignou, Raïda Ktari, Odile Papini:
Effacement des croyances en logique propositionnelle. JIAF-JFPDA 2024: 8-17 - [i23]Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin:
On the enumeration of signatures of XOR-CNF's. CoRR abs/2402.18537 (2024) - 2023
- [c26]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Complexity of Reasoning with Cardinality Minimality Conditions. AAAI 2023: 3932-3940 - [i22]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Complexity of Reasoning with Cardinality Minimality Conditions. CoRR abs/2303.01571 (2023) - 2022
- [j39]Nadia Creignou, Raïda Ktari, Odile Papini:
Belief contraction and erasure in fragments of propositional logic. J. Log. Comput. 32(7): 1436-1468 (2022) - [c25]Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. MFCS 2022: 38:1-38:14 - [i21]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. CoRR abs/2205.00539 (2022) - 2021
- [j38]Sarah Blind
Locally definable vertex set properties are efficiently enumerable. Discret. Appl. Math. 303: 186-202 (2021)
2010 – 2019
- 2019
- [j37]Nadia Creignou, Raïda Ktari, Arne Meier
Parameterised Enumeration for Modification Problems. Algorithms 12(9): 189 (2019) - [j36]Nadia Creignou, Markus Kröll
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268: 191-209 (2019) - 2018
- [j35]Nadia Creignou, Raïda Ktari, Odile Papini:
Belief Update within Propositional Fragments. J. Artif. Intell. Res. 61: 807-834 (2018) - [j34]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) - [c24]Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran:
Belief Update in the Horn Fragment. IJCAI 2018: 1781-1787 - 2017
- [j33]Nadia Creignou, Arne Meier
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017) - [c23]Nadia Creignou, Raïda Ktari, Odile Papini:
Complexity of Model Checking for Cardinality-Based Belief Revision Operators. ECSQARU 2017: 387-397 - [c22]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195 - [i20]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? CoRR abs/1711.07786 (2017) - 2016
- [j32]Nadia Creignou, Odile Papini, Stefan Rümmele
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17(3): 20 (2016) - [c21]Nadia Creignou, Raïda Ktari, Odile Papini:
Belief Contraction Within Fragments of Propositional Logic. ECAI 2016: 390-398 - [e3]Nadia Creignou, Daniel Le Berre:
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings. Lecture Notes in Computer Science 9710, Springer 2016, ISBN 978-3-319-40969-6 [contents] - [i19]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. CoRR abs/1610.05493 (2016) - [i18]Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer:
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6(9): 74-93 (2016) - 2015
- [j31]Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136(4): 297-316 (2015) - [j30]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): 23-45 (2015) - [c20]Nadia Creignou, Raïda Ktari, Odile Papini:
Belief Update Within Propositional Fragments. ECSQARU 2015: 165-174 - [c19]Nadia Creignou, Raïda Ktari, Arne Meier
Parameterized Enumeration for Modification Problems. LATA 2015: 524-536 - 2014
- [j29]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief revision within fragments of propositional logic. J. Comput. Syst. Sci. 80(2): 427-449 (2014) - [j28]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15(3): 19:1-19:20 (2014) - [c18]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. ECAI 2014: 231-236 - [i17]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. CoRR abs/1404.6445 (2014) - 2013
- [j27]Nadia Creignou, Hervé Daudé:
Sensitivity of Boolean formulas. Eur. J. Comb. 34(5): 793-805 (2013) - [c17]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI 2013: 824-831 - [c16]Nadia Creignou, Arne Meier
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301 - [i16]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for logic-based Argumentation. CoRR abs/1304.5388 (2013) - [i15]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013) - [i14]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration with Ordering. CoRR abs/1309.5009 (2013) - 2012
- [j26]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22(5): 1145-1170 (2012) - [j25]Nadia Creignou, Arne Meier
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012) - [c15]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity of logic-based argumentation in Schaefer's framework. COMMA 2012: 237-248 - [c14]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief Revision within Fragments of Propositional Logic. KR 2012 - [c13]Nadia Creignou, Heribert Vollmer
Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354 - [c12]Nadia Creignou, Uwe Egly, Martina Seidl:
A Framework for the Specification of Random SAT and QSAT Formulas. TAP@TOOLS 2012: 163-168 - [i13]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012) - 2011
- [j24]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2(2-3): 107-129 (2011) - [c11]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. SAT 2011: 120-133 - [i12]Nadia Creignou, Hervé Daudé, Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas. CoRR abs/1110.2739 (2011) - 2010
- [j23]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) - [j22]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): 502-516 (2010) - [j21]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): 454-490 (2010) - [j20]Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11(4): 24:1-24:32 (2010) - [c10]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129 - [c9]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010 - [i11]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010 - [i10]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010) - [i9]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. CoRR abs/1006.4923 (2010)
2000 – 2009
- 2009
- [j19]Nadia Creignou, Hervé Daudé:
The SAT-UNSAT transition for random constraint satisfaction problems. Discret. Math. 309(8): 2085-2099 (2009) - [c8]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT 2009: 363-376 - [i8]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
The threshold for random (1,2)-QSAT. CoRR abs/0907.0937 (2009) - [i7]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. CoRR abs/0912.3134 (2009) - 2008
- [j18]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008) - [j17]Nadia Creignou, Miki Hermann, Andrei A. Krokhin
Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008) - [c7]Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123 - [c6]Nadia Creignou, Heribert Vollmer
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37 - [c5]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105 - [c4]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47 - [e2]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5250, Springer 2008, ISBN 978-3-540-92799-0 [contents] - 2007
- [j16]Nadia Creignou, Hervé Daudé, Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. 29: 1-18 (2007) - [i6]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j15]Nadia Creignou, Bruno Zanuttini:
A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006) - [e1]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i5]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006 - [i4]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006 - 2005
- [j14]Philippe Chapdelaine, Nadia Creignou:
The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1): 51-63 (2005) - [j13]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): 48-57 (2005) - [i3]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. TR05 (2005) - [i2]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Preferred representations of Boolean relations. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j12]Nadia Creignou, Hervé Daudé:
Combinatorial sharpness criterion and phase transition classification for random CSPs. Inf. Comput. 190(2): 220-238 (2004) - [c3]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004 - [c2]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers 2004: 30-45 - 2003
- [j11]Nadia Creignou, Hervé Daudé, Olivier Dubois:
Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Comb. Probab. Comput. 12(2): 113-126 (2003) - [j10]Nadia Creignou, Hervé Daudé:
Smooth and sharp thresholds for random k-XOR-CNF satisfiability. RAIRO Theor. Informatics Appl. 37(2): 127-147 (2003) - [j9]Nadia Creignou, Hervé Daudé:
Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3): 417-430 (2003) - 2001
- [b1]Nadia Creignou, Sanjeev Khanna, Madhu Sudan:
Complexity classifications of Boolean constraint satisfaction problems. SIAM monographs on discrete mathematics and applications 7, SIAM 2001, ISBN 978-0-89871-479-1, pp. I-XII, 1-106 - [i1]Nadia Creignou, Hervé Daudé, Olivier Dubois:
Approximating the satisfiability threshold for random k-XOR-formulas. CoRR cs.DM/0106001 (2001)
1990 – 1999
- 1999
- [j8]Nadia Creignou, Hervé Daudé:
Satisfiability Threshold for Random XOR-CNF Formulas. Discret. Appl. Math. 96-97: 41-53 (1999) - 1998
- [j7]Nadia Creignou:
Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68(4): 161-165 (1998) - 1997
- [j6]Nadia Creignou, Jean-Jacques Hébrard:
On Generating All Solutions of Generalized Satisfiability Problems. RAIRO Theor. Informatics Appl. 31(6): 499-511 (1997) - [j5]Nadia Creignou, Malika More:
Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7(3): 353-366 (1997) - 1996
- [j4]Nadia Creignou:
Exact Complexity of Problems of Incompletely Specified Automata. Ann. Math. Artif. Intell. 16: 237-249 (1996) - [j3]Nadia Creignou, Miki Hermann:
Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125(1): 1-12 (1996) - 1995
- [j2]Nadia Creignou:
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. J. Comput. Syst. Sci. 51(3): 511-522 (1995) - [j1]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): 111-145 (1995) - 1992
- [c1]Nadia Creignou:
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. CSL 1992: 115-133
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: