Full name Familienname, Vorname
Creignou, Nadia
 

Results 1-20 of 24 (Search time: 0.004 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard ; Skritek, Sebastian ; Vollmer, Heribert A complexity theory for hard enumeration problemsArtikel Article 2019
2Haret, Adrian ; Creignou, Nadia ; Papini, Odile ; Woltran, Stefan Belief Update in the Horn FragmentKonferenzbeitrag Inproceedings 2018
3Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?Artikel Article 2018
4Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard ; Skritek, Sebastian ; Vollmer, Heribert On the Complexity of Hard Enumeration ProblemsKonferenzbeitrag Inproceedings2017
5Creignou, Nadia ; Papini, Odile ; Rümmele, Stefan ; Woltran, Stefan Belief Merging within Fragments of Propositional LogicArtikel Article 2016
6Creignou, Nadia ; Daudé, Hervé ; Egly, Uwe ; Rossignol, Raphaël Exact location of the phase transition for random (1,2)-QSATArtikel Article2015
7Creignou, Nadia ; Papini, Odile ; Rümmele, Stefan ; Woltran, Stefan Belief merging within fragments of propositional logicKonferenzbeitrag Inproceedings 2014
8Creignou, Nadia ; Papini, Odile ; Rümmele, Stefan ; Woltran, Stefan Belief merging within fragments of propositional logicKonferenzbeitrag Inproceedings 2014
9Creignou, Nadia ; Egly, Uwe ; Schmidt, Johannes Complexity Classifications for Logic-Based ArgumentationArtikel Article2014
10Creignou, Nadia ; Papini, Odile ; Pichler, Reinhard ; Woltran, Stefan Belief revision within fragments of propositional logicArtikel Article2014
11Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?Konferenzbeitrag Inproceedings 2013
12Egly, Uwe ; Creignou, Nadia ; Schmidt, Johannes Complexity Classifications for logic-based ArgumentationPreprint Preprint2013
13Egly, Uwe ; Creignou, Nadia ; Schmidt, Johannes Complexity of logic-based argumentation in Schaefer's frameworkKonferenzbeitrag Inproceedings 2012
14Creignou, Nadia ; Papini, Odile ; Pichler, Reinhard ; Woltran, Stefan Belief Revision within Fragments of Propositional LogicKonferenzbeitrag Inproceedings 2012
15Creignou, Nadia ; Egly, Uwe ; Seidl, Martina A Framework for the Specification of Random SAT and QSAT FormulasKonferenzbeitrag Inproceedings 2012
16Creignou, Nadia ; Schmidt, Johannes ; Thomas, Michael ; Woltran, Stefan Complexity of logic-based argumentation in Post's frameworkArtikel Article2011
17Creignou, Nadia ; Schmidt, Johannes ; Thomas, Michael ; Woltran, Stefan Sets of Boolean Connectives That Make Argumentation EasierKonferenzbeitrag Inproceedings 2010
18Chepoi, Victor ; Creignou, Nadia ; Hermann, Miki ; Salzer, Gernot The Helly Property and Satisfiability of Boolean Formulas Defined on Set FamiliesArtikel Article2010
19Creignou, Nadia ; Daudé, Hervé ; Egly, Uwe ; Rossignol, Raphaël (1,2)-QSAT: A Good Candidate for Understanding Phase Transitions MechanismsKonferenzbeitrag Inproceedings 2009
20Salzer, Gernot ; Chepoi, V ; Creignou, Nadia ; Hermann, Miki Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed LogicsKonferenzbeitrag Inproceedings 2008

Results 1-2 of 2 (Search time: 0.007 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Fichte, Johannes K. ; Meier, Arne ; Schindler, Irina Strong Backdoors for Default LogicKonferenzbeitrag Inproceedings 2016
2Seidl Martina - 2007 - A solver for quantified boolean formulas in negation...pdf.jpgSeidl, MartinaA solver for quantified boolean formulas in negation normal formThesis Hochschulschrift 2007