iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/70/5975.xml
Nadia Creignou https://dl.acm.org/profile/81100291924 https://www.mathgenealogy.org/id.php?id=151835 Nadia Creignou Raïda Ktari Odile Papini Belief Erasure in Propositional Logic. 1230-1237 2024 ECAI https://doi.org/10.3233/FAIA240619 conf/ecai/2024 db/conf/ecai/ecai2024.html#KtariP24 Nadia Creignou Raïda Ktari Odile Papini Effacement des croyances en logique propositionnelle. 8-17 2024 JIAF-JFPDA https://hal.science/hal-04620491v2/document conf/jiaf/2024 db/conf/jiaf/jiaf-jfpda2024.html#CreignouKP24
Nadia Creignou Oscar Defrain Frédéric Olive Simon Vilmin On the enumeration of signatures of XOR-CNF's. 2024 abs/2402.18537 CoRR https://doi.org/10.48550/arXiv.2402.18537 db/journals/corr/corr2402.html#abs-2402-18537
Nadia Creignou Frédéric Olive Johannes Schmidt 0001 Complexity of Reasoning with Cardinality Minimality Conditions. 3932-3940 2023 AAAI https://doi.org/10.1609/aaai.v37i4.25507 conf/aaai/2023 db/conf/aaai/aaai2023.html#CreignouO023
Nadia Creignou Frédéric Olive Johannes Schmidt 0001 Complexity of Reasoning with Cardinality Minimality Conditions. 2023 abs/2303.01571 CoRR https://doi.org/10.48550/arXiv.2303.01571 db/journals/corr/corr2303.html#abs-2303-01571
Nadia Creignou Raïda Ktari Odile Papini Belief contraction and erasure in fragments of propositional logic. 1436-1468 2022 32 J. Log. Comput. 7 https://doi.org/10.1093/logcom/exac005 db/journals/logcom/logcom32.html#CreignouKP22
Nadia Creignou Arnaud Durand 0001 Heribert Vollmer Enumeration Classes Defined by Circuits. 38:1-38:14 2022 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2022.38 conf/mfcs/2022 db/conf/mfcs/mfcs2022.html#CreignouDV22
Nadia Creignou Arnaud Durand 0001 Heribert Vollmer Enumeration Classes Defined by Circuits. 2022 abs/2205.00539 CoRR https://doi.org/10.48550/arXiv.2205.00539 db/journals/corr/corr2205.html#abs-2205-00539
Sarah Blind Nadia Creignou Frédéric Olive Locally definable vertex set properties are efficiently enumerable. 186-202 2021 303 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.05.037 db/journals/dam/dam303.html#BlindCO21
Nadia Creignou Raïda Ktari Arne Meier Julian-Steffen Müller Frédéric Olive Heribert Vollmer Parameterised Enumeration for Modification Problems. 189 2019 12 Algorithms 9 https://doi.org/10.3390/a12090189 db/journals/algorithms/algorithms12.html#CreignouKMMOV19
Nadia Creignou Markus Kröll Reinhard Pichler Sebastian Skritek Heribert Vollmer A complexity theory for hard enumeration problems. 191-209 2019 268 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.02.025 db/journals/dam/dam268.html#CreignouKPSV19
Nadia Creignou Raïda Ktari Odile Papini Belief Update within Propositional Fragments. 807-834 2018 61 J. Artif. Intell. Res. https://doi.org/10.1613/jair.5541 db/journals/jair/jair61.html#CreignouKP18
Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2018 14 Log. Methods Comput. Sci. 4 https://doi.org/10.23638/LMCS-14(4:10)2018 db/journals/lmcs/lmcs14.html#CreignouPW18
Nadia Creignou Adrian Haret Odile Papini Stefan Woltran Belief Update in the Horn Fragment. 1781-1787 2018 IJCAI https://doi.org/10.24963/ijcai.2018/246 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#CreignouHPW18
Nadia Creignou Arne Meier Julian-Steffen Müller Johannes Schmidt 0001 Heribert Vollmer Paradigms for Parameterized Enumeration. 737-758 2017 60 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-016-9702-4 https://www.wikidata.org/entity/Q57998263 db/journals/mst/mst60.html#CreignouMMSV17
Nadia Creignou Raïda Ktari Odile Papini Complexity of Model Checking for Cardinality-Based Belief Revision Operators. 387-397 2017 ECSQARU https://doi.org/10.1007/978-3-319-61581-3_35 conf/ecsqaru/2017 db/conf/ecsqaru/ecsqaru2017.html#CreignouKP17 Nadia Creignou Markus Kröll Reinhard Pichler Sebastian Skritek Heribert Vollmer On the Complexity of Hard Enumeration Problems. 183-195 2017 LATA https://doi.org/10.1007/978-3-319-53733-7_13 conf/lata/2017 db/conf/lata/lata2017.html#CreignouKPSV17
Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2017 abs/1711.07786 CoRR http://arxiv.org/abs/1711.07786 db/journals/corr/corr1711.html#abs-1711-07786
Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief Merging within Fragments of Propositional Logic. 20 2016 17 ACM Trans. Comput. Log. 3 https://doi.org/10.1145/2898436 db/journals/tocl/tocl17.html#CreignouPRW16
Nadia Creignou Raïda Ktari Odile Papini Belief Contraction Within Fragments of Propositional Logic. 390-398 2016 ECAI https://doi.org/10.3233/978-1-61499-672-9-390 conf/ecai/2016 db/conf/ecai/ecai2016.html#CreignouKP16 Nadia Creignou Daniel Le Berre Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings SAT Springer 2016 Lecture Notes in Computer Science 9710 978-3-319-40969-6 https://doi.org/10.1007/978-3-319-40970-2 db/conf/sat/sat2016.html
Nadia Creignou Markus Kröll Reinhard Pichler Sebastian Skritek Heribert Vollmer On the Complexity of Hard Enumeration Problems. 2016 abs/1610.05493 CoRR http://arxiv.org/abs/1610.05493 db/journals/corr/corr1610.html#CreignouKPSV16
Olaf Beyersdorff Nadia Creignou Uwe Egly Heribert Vollmer SAT and Interactions (Dagstuhl Seminar 16381). 74-93 2016 6 Dagstuhl Reports 9 https://doi.org/10.4230/DagRep.6.9.74 db/journals/dagstuhl-reports/dagstuhl-reports6.html#BeyersdorffCEV16
Nadia Creignou Heribert Vollmer Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. 297-316 2015 136 Fundam. Informaticae 4 https://doi.org/10.3233/FI-2015-1159 db/journals/fuin/fuin136.html#CreignouV15
Nadia Creignou Hervé Daudé Uwe Egly Raphaël Rossignol Exact location of the phase transition for random (1, 2)-QSAT. 23-45 2015 49 RAIRO Theor. Informatics Appl. 1 https://doi.org/10.1051/ita/2014025 db/journals/ita/ita49.html#CreignouDER15
Nadia Creignou Raïda Ktari Odile Papini Belief Update Within Propositional Fragments. 165-174 2015 ECSQARU https://doi.org/10.1007/978-3-319-20807-7_15 conf/ecsqaru/2015 db/conf/ecsqaru/ecsqaru2015.html#CreignouKP15 Nadia Creignou Raïda Ktari Arne Meier Julian-Steffen Müller Frédéric Olive Heribert Vollmer Parameterized Enumeration for Modification Problems. 524-536 2015 LATA https://doi.org/10.1007/978-3-319-15579-1_41 https://www.wikidata.org/entity/Q57998294 conf/lata/2015 db/conf/lata/lata2015.html#CreignouKMMOV15
Nadia Creignou Odile Papini Reinhard Pichler Stefan Woltran Belief revision within fragments of propositional logic. 427-449 2014 80 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/j.jcss.2013.08.002 db/journals/jcss/jcss80.html#CreignouPPW14
Nadia Creignou Uwe Egly Johannes Schmidt 0001 Complexity Classifications for Logic-Based Argumentation. 19:1-19:20 2014 15 ACM Trans. Comput. Log. 3 https://doi.org/10.1145/2629421 db/journals/tocl/tocl15.html#CreignouE014
Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief merging within fragments of propositional logic. 231-236 2014 ECAI https://doi.org/10.3233/978-1-61499-419-0-231 conf/ecai/2014 db/conf/ecai/ecai2014.html#CreignouPRW14
Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief merging within fragments of propositional logic. 2014 abs/1404.6445 CoRR http://arxiv.org/abs/1404.6445 db/journals/corr/corr1404.html#CreignouPRW14
Nadia Creignou Hervé Daudé Sensitivity of Boolean formulas. 793-805 2013 34 Eur. J. Comb. 5 https://doi.org/10.1016/j.ejc.2012.12.006 db/journals/ejc/ejc34.html#CreignouD13
Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2013 IJCAI http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6622 http://ijcai.org/Abstract/13/128 conf/ijcai/2013 db/conf/ijcai/ijcai2013.html#CreignouPW13 824-831 Nadia Creignou Arne Meier Julian-Steffen Müller Johannes Schmidt 0001 Heribert Vollmer Paradigms for Parameterized Enumeration. 290-301 2013 MFCS https://doi.org/10.1007/978-3-642-40313-2_27 https://www.wikidata.org/entity/Q57998302 conf/mfcs/2013 db/conf/mfcs/mfcs2013.html#CreignouMMSV13
Nadia Creignou Uwe Egly Johannes Schmidt 0001 Complexity Classifications for logic-based Argumentation http://arxiv.org/abs/1304.5388 2013 CoRR abs/1304.5388 db/journals/corr/corr1304.html#abs-1304-5388
Nadia Creignou Arne Meier Julian-Steffen Müller Johannes Schmidt 0001 Heribert Vollmer Paradigms for Parameterized Enumeration. 2013 CoRR http://arxiv.org/abs/1306.2171 abs/1306.2171 db/journals/corr/corr1306.html#CreignouMMSV13
Nadia Creignou Raïda Ktari Arne Meier Julian-Steffen Müller Frédéric Olive Heribert Vollmer Parameterized Enumeration with Ordering. 2013 CoRR http://arxiv.org/abs/1309.5009 abs/1309.5009 db/journals/corr/corr1309.html#CreignouKMMOV13
Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Complexity Classifications for Propositional Abduction in Post's Framework. 1145-1170 2012 22 J. Log. Comput. 5 https://doi.org/10.1093/logcom/exr012 db/journals/logcom/logcom22.html#CreignouST12
Nadia Creignou Arne Meier Heribert Vollmer Michael Thomas 0001 The Complexity of Reasoning for Fragments of Autoepistemic Logic. 17:1-17:22 2012 13 ACM Trans. Comput. Log. 2 https://doi.org/10.1145/2159531.2159539 https://www.wikidata.org/entity/Q57998305 db/journals/tocl/tocl13.html#CreignouMVT12
Nadia Creignou Uwe Egly Johannes Schmidt 0001 Complexity of logic-based argumentation in Schaefer's framework. 237-248 2012 COMMA https://doi.org/10.3233/978-1-61499-111-3-237 conf/comma/2012 db/conf/comma/comma2012.html#CreignouES12 Nadia Creignou Odile Papini Reinhard Pichler Stefan Woltran Belief Revision within Fragments of Propositional Logic. 2012 KR http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4512 conf/kr/2012 db/conf/kr/kr2012.html#CreignouPPW12 Nadia Creignou Heribert Vollmer Parameterized Complexity of Weighted Satisfiability Problems. 341-354 2012 SAT https://doi.org/10.1007/978-3-642-31612-8_26 conf/sat/2012 db/conf/sat/sat2012.html#CreignouV12 Nadia Creignou Uwe Egly Martina Seidl A Framework for the Specification of Random SAT and QSAT Formulas. 163-168 2012 TAP@TOOLS https://doi.org/10.1007/978-3-642-30473-6_14 conf/tap/2012 db/conf/tap/tap2012.html#CreignouES12
Nadia Creignou Nicola Galesi Oliver Kullmann Heribert Vollmer SAT Interactions (Dagstuhl Seminar 12471). 87-101 2012 2 Dagstuhl Reports 11 https://doi.org/10.4230/DagRep.2.11.87 db/journals/dagstuhl-reports/dagstuhl-reports2.html#CreignouGKV12
Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Stefan Woltran Complexity of logic-based argumentation in Post's framework. 107-129 2011 2 Argument Comput. 2-3 https://doi.org/10.1080/19462166.2011.629736 db/journals/argcom/argcom2.html#Creignou0TW11
Nadia Creignou Frédéric Olive Johannes Schmidt 0001 Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. 120-133 2011 SAT https://doi.org/10.1007/978-3-642-21581-0_11 conf/sat/2011 db/conf/sat/sat2011.html#CreignouOS11
Nadia Creignou Hervé Daudé Uwe Egly Phase Transition for Random Quantified XOR-Formulas http://arxiv.org/abs/1110.2739 2011 CoRR abs/1110.2739 db/journals/corr/corr1110.html#abs-1110-2739
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 https://doi.org/10.2168/LMCS-8(3:31)2012 http://arxiv.org/abs/1009.1208 2010 Log. Methods Comput. Sci. 8 3 db/journals/lmcs/lmcs8.html#abs-1009-1208
Victor Chepoi Nadia Creignou Miki Hermann Gernot Salzer The Helly property and satisfiability of Boolean formulas defined on set families. 502-516 2010 31 Eur. J. Comb. 2 https://doi.org/10.1016/j.ejc.2009.03.022 db/journals/ejc/ejc31.html#ChepoiCHS10
Michael Bauland Elmar Böhler Nadia Creignou Steffen Reith Henning Schnoor Heribert Vollmer The Complexity of Problems for Quantified Constraints. 454-490 2010 47 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-009-9194-6 db/journals/mst/mst47.html#BaulandBCRSV10
Nadia Creignou Henning Schnoor Ilka Schnoor Nonuniform Boolean constraint satisfaction problems with cardinality constraint. 2010 11 ACM Trans. Comput. Log. 4 https://doi.org/10.1145/1805950.1805954 db/journals/tocl/tocl11.html#CreignouSS10 24:1-24:32
Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Stefan Woltran Sets of Boolean Connectives That Make Argumentation Easier. 117-129 2010 JELIA https://doi.org/10.1007/978-3-642-15675-5_12 conf/jelia/2010 db/conf/jelia/jelia2010.html#CreignouSTW10 Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. 2010 KR http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1201 conf/kr/2010 db/conf/kr/kr2010.html#CreignouST10 Nadia Creignou Arne Meier Michael Thomas 0001 Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic. 2010 Circuits, Logic, and Games http://drops.dagstuhl.de/opus/volltexte/2010/2523/ conf/dagstuhl/2010P10061 db/conf/dagstuhl/P10061.html#CreignouMTV10
Nadia Creignou Arne Meier Michael Thomas 0001 Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic http://arxiv.org/abs/1006.0220 2010 CoRR abs/1006.0220 db/journals/corr/corr1006.html#abs-1006-0220
Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Complexity Classifications for Propositional Abduction in Post's Framework http://arxiv.org/abs/1006.4923 2010 CoRR abs/1006.4923 db/journals/corr/corr1006.html#abs-1006-4923
Nadia Creignou Hervé Daudé The SAT-UNSAT transition for random constraint satisfaction problems. 2085-2099 2009 309 Discret. Math. 8 https://doi.org/10.1016/j.disc.2008.04.025 db/journals/dm/dm309.html#CreignouD09
Nadia Creignou Hervé Daudé Uwe Egly Raphaël Rossignol (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. 363-376 2009 SAT https://doi.org/10.1007/978-3-642-02777-2_34 conf/sat/2009 db/conf/sat/sat2009.html#CreignouDER09
Nadia Creignou Hervé Daudé Uwe Egly Raphaël Rossignol The threshold for random (1,2)-QSAT http://arxiv.org/abs/0907.0937 2009 CoRR abs/0907.0937 db/journals/corr/corr0907.html#abs-0907-0937
Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Complexity of Propositional Abduction for Restricted Sets of Boolean Functions http://arxiv.org/abs/0912.3134 2009 CoRR abs/0912.3134 db/journals/corr/corr0912.html#abs-0912-3134
Nadia Creignou Phokion G. Kolaitis Bruno Zanuttini Structure identification of Boolean relations and plain bases for co-clones. 1103-1115 2008 74 J. Comput. Syst. Sci. 7 https://doi.org/10.1016/j.jcss.2008.02.005 db/journals/jcss/jcss74.html#CreignouKZ08
Nadia Creignou Miki Hermann Andrei A. Krokhin Gernot Salzer Complexity of Clausal Constraints Over Chains. 239-255 2008 42 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-007-9003-z db/journals/mst/mst42.html#CreignouHKS08
Nadia Creignou Henning Schnoor Ilka Schnoor Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. 109-123 2008 CSL https://doi.org/10.1007/978-3-540-87531-4_10 conf/csl/2008 db/conf/csl/csl2008.html#CreignouSS08 Nadia Creignou Heribert Vollmer Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. 3-37 2008 Complexity of Constraints https://doi.org/10.1007/978-3-540-92800-3_2 conf/dagstuhl/2008coc db/conf/dagstuhl/coc2008.html#CreignouV08 Victor Chepoi Nadia Creignou Miki Hermann Gernot Salzer Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. 100-105 2008 ISMVL https://doi.org/10.1109/ISMVL.2008.41 https://doi.ieeecomputersociety.org/10.1109/ISMVL.2008.41 conf/ismvl/2008 db/conf/ismvl/ismvl2008.html#ChepoiCHS08 Nadia Creignou Hervé Daudé Uwe Egly Raphaël Rossignol New Results on the Phase Transition for Random Quantified Boolean Formulas. 34-47 2008 SAT https://doi.org/10.1007/978-3-540-79719-7_5 conf/sat/2008 db/conf/sat/sat2008.html#CreignouDER08 Nadia Creignou Phokion G. Kolaitis Heribert Vollmer Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. 5250 2008 https://doi.org/10.1007/978-3-540-92800-3 978-3-540-92799-0 Complexity of Constraints Lecture Notes in Computer Science Springer db/conf/dagstuhl/coc2008.html
Nadia Creignou Hervé Daudé Uwe Egly Phase Transition for Random Quantified XOR-Formulas. 1-18 2007 29 J. Artif. Intell. Res. https://doi.org/10.1613/jair.2120 db/journals/jair/jair29.html#CreignouDE07
Heribert Vollmer Michael Bauland Elmar Böhler Nadia Creignou Steffen Reith Henning Schnoor The Complexity of Problems for Quantified Constraints. 2007 TR07 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-023/index.html TR07-023 db/journals/eccc/eccc14.html#VollmerBBCRS07
Nadia Creignou Bruno Zanuttini A Complete Classification of the Complexity of Propositional Abduction. 207-229 2006 36 SIAM J. Comput. 1 https://doi.org/10.1137/S0097539704446311 db/journals/siamcomp/siamcomp36.html#CreignouZ06
Nadia Creignou Phokion G. Kolaitis Heribert Vollmer Complexity of Constraints, 01.10. - 06.10.2006 Complexity of Constraints Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 06401 2006 Dagstuhl Seminar Proceedings db/conf/dagstuhl/P6401.html http://drops.dagstuhl.de/portals/06401/ Nadia Creignou Phokion G. Kolaitis Heribert Vollmer 06401 Executive Summary - Complexity of Constraints. 2006 Complexity of Constraints http://drops.dagstuhl.de/opus/volltexte/2006/800 conf/dagstuhl/2006P6401 db/conf/dagstuhl/P6401.html#CreignouKV06 Nadia Creignou Phokion G. Kolaitis Heribert Vollmer 06401 Abstracts Collection - Complexity of Constraints. 2006 Complexity of Constraints http://drops.dagstuhl.de/opus/volltexte/2006/806 conf/dagstuhl/2006P6401 db/conf/dagstuhl/P6401.html#CreignouKV06a
Philippe Chapdelaine Nadia Creignou The complexity of Boolean constraint satisfaction local search problems. 51-63 2005 43 Ann. Math. Artif. Intell. 1 https://doi.org/10.1007/s10472-005-0419-3 db/journals/amai/amai43.html#ChapdelaineC05
Nadia Creignou Hervé Daudé John V. Franco A sharp threshold for the renameable-Horn and the q-Horn properties. 48-57 2005 153 Discret. Appl. Math. 1-3 https://doi.org/10.1016/j.dam.2005.05.005 db/journals/dam/dam153.html#CreignouDF05
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. 2005 TR05 TR05-024 db/journals/eccc/eccc12.html#TR05-024 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-024/index.html
Nadia Creignou Phokion G. Kolaitis Bruno Zanuttini Preferred representations of Boolean relations Electron. Colloquium Comput. Complex. 2005 TR05 TR05-119 db/journals/eccc/eccc12.html#TR05-119 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-119/index.html
Nadia Creignou Hervé Daudé Combinatorial sharpness criterion and phase transition classification for random CSPs. 220-238 2004 190 Inf. Comput. 2 https://doi.org/10.1016/j.ic.2004.01.002 db/journals/iandc/iandc190.html#CreignouD04
Michael Bauland Philippe Chapdelaine Nadia Creignou Miki Hermann Heribert Vollmer An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. 2004 conf/sat/2004 SAT http://www.satisfiability.org/SAT04/programme/73.pdf db/conf/sat/sat2004.html#BaulandCCHV04 Michael Bauland Philippe Chapdelaine Nadia Creignou Miki Hermann Heribert Vollmer An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. 30-45 2004 conf/sat/2004lncs SAT (Selected Papers https://doi.org/10.1007/11527695_3 db/conf/sat/sat2004lncs.html#BaulandCCHV04a
Nadia Creignou Hervé Daudé Olivier Dubois 0002 Approximating The Satisfiability Threshold For Random K-Xor-Formulas. 2003 12 Comb. Probab. Comput. 2 db/journals/cpc/cpc12.html#CreignouDD03 https://doi.org/10.1017/S0963548302005552 113-126
Nadia Creignou Hervé Daudé Smooth and sharp thresholds for random <i>k</i>-XOR-CNF satisfiability. 127-147 2003 37 RAIRO Theor. Informatics Appl. 2 https://doi.org/10.1051/ita:2003014 db/journals/ita/ita37.html#CreignouD03
Nadia Creignou Hervé Daudé Generalized satisfiability problems: minimal elements and phase transitions. 417-430 2003 302 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/S0304-3975(02)00890-3 db/journals/tcs/tcs302.html#CreignouD03
Nadia Creignou Sanjeev Khanna Madhu Sudan 0001 Complexity classifications of Boolean constraint satisfaction problems. I-XII, 1-106 SIAM 2001 SIAM monographs on discrete mathematics and applications 7 978-0-89871-479-1
Nadia Creignou Hervé Daudé Olivier Dubois 0002 Approximating the satisfiability threshold for random k-XOR-formulas https://arxiv.org/abs/cs/0106001 2001 CoRR cs.DM/0106001 db/journals/corr/corr0106.html#cs-DM-0106001
Nadia Creignou Hervé Daudé Satisfiability Threshold for Random XOR-CNF Formulas. 41-53 1999 96-97 Discret. Appl. Math. https://doi.org/10.1016/S0166-218X(99)00032-3 db/journals/dam/dam96.html#CreignouD99
Nadia Creignou Complexity Versus Stability for Classes of Propositional Formulas. 161-165 1998 68 Inf. Process. Lett. 4 db/journals/ipl/ipl68.html#Creignou98 https://doi.org/10.1016/S0020-0190(98)00163-X
Nadia Creignou Jean-Jacques Hébrard On Generating All Solutions of Generalized Satisfiability Problems. 499-511 1997 31 RAIRO Theor. Informatics Appl. 6 db/journals/ita/ita31.html#CreignouH97 https://doi.org/10.1051/ita/1997310604991
Nadia Creignou Malika More Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. 353-366 1997 7 J. Log. Comput. 3 db/journals/logcom/logcom7.html#CreignouM97 https://doi.org/10.1093/logcom/7.3.353
Nadia Creignou Exact Complexity of Problems of Incompletely Specified Automata. 237-249 1996 16 Ann. Math. Artif. Intell. db/journals/amai/amai16.html#Creignou96 https://doi.org/10.1007/BF02127799
Nadia Creignou Miki Hermann Complexity of Generalized Satisfiability Counting Problems. 1-12 1996 125 Inf. Comput. 1 db/journals/iandc/iandc125.html#CreignouH96 https://doi.org/10.1006/inco.1996.0016 https://www.wikidata.org/entity/Q64385460
Nadia Creignou A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. 511-522 1995 51 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss51.html#Creignou95 https://doi.org/10.1006/jcss.1995.1087
Nadia Creignou The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 111-145 1995 145 Theor. Comput. Sci. 1&2 db/journals/tcs/tcs145.html#Creignou95 https://doi.org/10.1016/0304-3975(94)00182-I
Nadia Creignou The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 115-133 1992 conf/csl/1992 CSL db/conf/csl/csl92.html#Creignou92 https://doi.org/10.1007/3-540-56992-8_9 Michael Bauland Daniel Le Berre Olaf Beyersdorff Sarah Blind Elmar Böhler Philippe Chapdelaine Victor Chepoi Hervé Daudé Oscar Defrain Olivier Dubois 0002 Arnaud Durand 0001 Uwe Egly John V. Franco Nicola Galesi Matthias Galota Adrian Haret Jean-Jacques Hébrard Miki Hermann Sanjeev Khanna Phokion G. Kolaitis Andrei A. Krokhin Markus Kröll Raïda Ktari Oliver Kullmann Arne Meier Malika More Julian-Steffen Müller Frédéric Olive Odile Papini Reinhard Pichler Steffen Reith Raphaël Rossignol Stefan Rümmele Gernot Salzer Johannes Schmidt 0001 Henning Schnoor Ilka Schnoor Martina Seidl Sebastian Skritek Madhu Sudan 0001 Michael Thomas 0001 Simon Vilmin Heribert Vollmer Stefan Woltran Bruno Zanuttini