The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Nadia Creignou" ( http://dblp.L3S.de/Authors/Nadia_Creignou )

URL (Homepage):  https://dl.acm.org/author_page.cfm?id=81100291924  Author page on DBLP  Author page in RDF  Community of Nadia Creignou in ASPL-2

Publication years (Num. hits)
1992-2004 (17) 2005-2008 (17) 2009-2011 (16) 2012-2014 (17) 2015-2018 (16)
Publication types (Num. hits)
article(52) book(1) inproceedings(27) proceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 9 keywords

Results
Found 84 publication records. Showing 83 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Nadia Creignou, Raïda Ktari, Odile Papini Belief Update within Propositional Fragments. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Reinhard Pichler, Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran Belief Update in the Horn Fragment. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Reinhard Pichler, Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer On the Complexity of Hard Enumeration Problems. Search on Bibsonomy LATA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Odile Papini Complexity of Model Checking for Cardinality-Based Belief Revision Operators. Search on Bibsonomy ECSQARU The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran Belief Merging within Fragments of Propositional Logic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer SAT and Interactions (Dagstuhl Seminar 16381). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer On the Complexity of Hard Enumeration Problems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Odile Papini Belief Contraction Within Fragments of Propositional Logic. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Daniel Le Berre (eds.) Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Heribert Vollmer Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Search on Bibsonomy Fundam. Inform. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol Exact location of the phase transition for random (1, 2)-QSAT. Search on Bibsonomy RAIRO - Theor. Inf. and Applic. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer Parameterized Enumeration for Modification Problems. Search on Bibsonomy LATA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Odile Papini Belief Update Within Propositional Fragments. Search on Bibsonomy ECSQARU The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Uwe Egly, Johannes Schmidt 0001 Complexity Classifications for Logic-Based Argumentation. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran Belief revision within fragments of propositional logic. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran Belief merging within fragments of propositional logic. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran Belief merging within fragments of propositional logic. Search on Bibsonomy ECAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé Sensitivity of Boolean formulas. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer Parameterized Enumeration with Ordering. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nadia Creignou, Uwe Egly, Johannes Schmidt 0001 Complexity Classifications for logic-based Argumentation Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer Paradigms for Parameterized Enumeration. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Reinhard Pichler, Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Search on Bibsonomy IJCAI The full citation details ... 2013 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas 0001 The Complexity of Reasoning for Fragments of Autoepistemic Logic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer SAT Interactions (Dagstuhl Seminar 12471). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001 Complexity Classifications for Propositional Abduction in Post's Framework. Search on Bibsonomy J. Log. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Heribert Vollmer Parameterized Complexity of Weighted Satisfiability Problems. Search on Bibsonomy SAT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Uwe Egly, Johannes Schmidt 0001 Complexity of logic-based argumentation in Schaefer's framework. Search on Bibsonomy COMMA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Uwe Egly, Martina Seidl A Framework for the Specification of Random SAT and QSAT Formulas. Search on Bibsonomy TAP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran Belief Revision within Fragments of Propositional Logic. Search on Bibsonomy KR The full citation details ... 2012 DBLP  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001, Stefan Woltran Complexity of logic-based argumentation in Post's framework. Search on Bibsonomy Argument & Computation The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly Phase Transition for Random Quantified XOR-Formulas Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Nadia Creignou, Frédéric Olive, Johannes Schmidt 0001 Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. Search on Bibsonomy SAT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Henning Schnoor, Ilka Schnoor Nonuniform Boolean constraint satisfaction problems with cardinality constraint. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer The Helly property and satisfiability of Boolean formulas defined on set families. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer The Complexity of Problems for Quantified Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Elmar 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 Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001 Complexity Classifications for Propositional Abduction in Post's Framework Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Nadia Creignou, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Autoepistemic Logic. Search on Bibsonomy Circuits, Logic, and Games The full citation details ... 2010 DBLP  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001, Stefan Woltran Sets of Boolean Connectives That Make Argumentation Easier. Search on Bibsonomy JELIA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001 Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. Search on Bibsonomy KR The full citation details ... 2010 DBLP  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol The threshold for random (1,2)-QSAT Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Nadia Creignou, Johannes Schmidt 0001, Michael Thomas 0001 Complexity of Propositional Abduction for Restricted Sets of Boolean Functions Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Nadia Creignou, Hervé Daudé The SAT-UNSAT transition for random constraint satisfaction problems. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini Structure identification of Boolean relations and plain bases for co-clones. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer Complexity of Clausal Constraints Over Chains. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Finite totally ordered domains, Clausal patterns, Dichotomy theorem, Complexity, Constraint satisfaction problems, Inequalities
1Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (eds.) Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Heribert Vollmer Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol New Results on the Phase Transition for Random Quantified Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. Search on Bibsonomy ISMVL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Helly property, complexity, satisfiability, many-valued logic, propositional logic
1Nadia Creignou, Henning Schnoor, Ilka Schnoor Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Uwe Egly Phase Transition for Random Quantified XOR-Formulas. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor The Complexity of Problems for Quantified Constraints. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Nadia Creignou, Bruno Zanuttini A Complete Classification of the Complexity of Propositional Abduction. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer 06401 Abstracts Collection - Complexity of Constraints. Search on Bibsonomy Complexity of Constraints The full citation details ... 2006 DBLP  BibTeX  RDF
1Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer 06401 Executive Summary - Complexity of Constraints. Search on Bibsonomy Complexity of Constraints The full citation details ... 2006 DBLP  BibTeX  RDF
1Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (eds.) Complexity of Constraints, 01.10. - 06.10.2006 Search on Bibsonomy Complexity of Constraints The full citation details ... 2006 DBLP  BibTeX  RDF
1Philippe Chapdelaine, Nadia Creignou The complexity of Boolean constraint satisfaction local search problems. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF PLS-complete, optimization, complexity, local search, satisfiability, PLS
1Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini Preferred representations of Boolean relations Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, John V. Franco A sharp threshold for the renameable-Horn and the q-Horn properties. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé Combinatorial sharpness criterion and phase transition classification for random CSPs. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. Search on Bibsonomy SAT The full citation details ... 2004 DBLP  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Olivier Dubois 0002 Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé Generalized satisfiability problems: minimal elements and phase transitions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé Smooth and sharp thresholds for random k-XOR-CNF satisfiability. Search on Bibsonomy ITA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Hervé Daudé, Olivier Dubois 0002 Approximating the satisfiability threshold for random k-XOR-formulas Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Nadia Creignou, Sanjeev Khanna, Madhu Sudan Complexity classifications of Boolean constraint satisfaction problems. Search on Bibsonomy 2001   RDF
1Nadia Creignou, Hervé Daudé Satisfiability Threshold for Random XOR-CNF Formulas. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Nadia Creignou Complexity Versus Stability for Classes of Propositional Formulas. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Jean-Jacques Hébrard On Generating All Solutions of Generalized Satisfiability Problems. Search on Bibsonomy ITA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Malika More Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. Search on Bibsonomy J. Log. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Nadia Creignou Exact Complexity of Problems of Incompletely Specified Automata. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Miki Hermann Complexity of Generalized Satisfiability Counting Problems. Search on Bibsonomy Inf. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nadia Creignou The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Nadia Creignou A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Nadia Creignou The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. Search on Bibsonomy CSL The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #83 of 83 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license