E-LIB Suche - Ergebnisse für: Creignou, Nadia

1

Belief contraction and erasure in fragments of propositiona..:

Creignou, Nadia ; Ktari, RaÏda ; Papini, Odile
Journal of Logic and Computation. 32 (2022) 7 - p. 1436-1468 , 2022

Link: https://doi.org/10.1093/..

2

Locally definable vertex set properties are efficiently enu..:

Blind, Sarah ; Creignou, Nadia ; Olive, Frédéric
Discrete Applied Mathematics. 303 (2021) - p. 186-202 , 2021

Link: https://doi.org/10.1016/..

3

A complexity theory for hard enumeration problems:

Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard..
Discrete Applied Mathematics. 268 (2019) - p. 191-209 , 2019

Link: https://doi.org/10.1016/..

4

Parameterised Enumeration for Modification Problems:

Creignou, Nadia ; Ktari, Raïda ; Meier, Arne...
Algorithms. 12 (2019) 9 - p. 189 , 2019

Link: https://doi.org/10.3390/..

5

Theory and Applications of Satisfiability Testing – SAT 201

19th International Conference, Bordeaux, France, July 5-8, ... Lecture Notes in Computer Science ; 9710;Theoretical Computer Science and General Issues ; 9710;SpringerLink, Bücher;Springer eBook Collection, Computer Science

Creignou, Nadia ; Le Berre, Daniel , 2016

Link: https://doi.org/10.1007/..

6

Belief Merging within Fragments of Propositional Logic:

Creignou, Nadia ; Papini, Odile ; Rümmele, Stefan.
ACM Transactions on Computational Logic (TOCL). 17 (2016) 3 - p. 1-28 , 2016

Link: https://dl.acm.org/doi/1..

7

Paradigms for Parameterized Enumeration:

Creignou, Nadia ; Meier, Arne ; Müller, Julian-Steffen..
Theory of Computing Systems. 60 (2016) 4 - p. 737-758 , 2016

Link: https://doi.org/10.1007/..

8

Belief Merging within Fragments of Propositional Logic:

Creignou, Nadia ; Papini, Odile ; Rümmele, Stefan.
ACM Transactions on Computational Logic. 17 (2016) 3 - p. 1-28 , 2016

Link: https://doi.org/10.1145/..

9

Complexity Classifications for Logic-Based Argumentation:

Creignou, Nadia ; Egly, Uwe ; Schmidt, Johannes
ACM Transactions on Computational Logic. 15 (2014) 3 - p. 1-20 , 2014

Link: https://doi.org/10.1145/..

10

Complexity Classifications for Logic-Based Argumentation:

Creignou, Nadia ; Egly, Uwe ; Schmidt, Johannes
ACM Transactions on Computational Logic (TOCL). 15 (2014) 3 - p. 1-20 , 2014

Link: https://dl.acm.org/doi/1..

11

Belief revision within fragments of propositional logic:

Creignou, Nadia ; Papini, Odile ; Pichler, Reinhard.
Journal of Computer and System Sciences. 80 (2014) 2 - p. 427-449 , 2014

Link: https://doi.org/10.1016/..

12

Sensitivity of Boolean formulas:

Creignou, Nadia ; Daudé, Hervé
European Journal of Combinatorics. 34 (2013) 5 - p. 793-805 , 2013

Link: https://doi.org/10.1016/..

13

The Complexity of Reasoning for Fragments of Autoepistemic ..:

Creignou, Nadia ; Meier, Arne ; Vollmer, Heribert.
ACM Transactions on Computational Logic. 13 (2012) 2 - p. 1-22 , 2012

Link: https://doi.org/10.1145/..

14

The Complexity of Reasoning for Fragments of Autoepistemic ..:

Creignou, Nadia ; Meier, Arne ; Vollmer, Heribert.
ACM Transactions on Computational Logic (TOCL). 13 (2012) 2 - p. 1-22 , 2012

Link: https://dl.acm.org/doi/1..

15

The Helly property and satisfiability of Boolean formulas d..:

Chepoi, Victor ; Creignou, Nadia ; Hermann, Miki.
European Journal of Combinatorics. 31 (2010) 2 - p. 502-516 , 2010

Link: https://doi.org/10.1016/..