( en | de | ru )

 

Disambiguation of "Creignou, Nadia"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Model Checking for Cardinality-Based Belief Revision Operators.

, , and . ECSQARU, volume 10369 of Lecture Notes in Computer Science, page 387-397. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nadia Kapernaum

Nadia Klein

Nadia Müller

Nadia Sallam

Nadia Rinaldi

 

Other publications of authors with the same name

On the Complexity of Hard Enumeration Problems., , , , and . LATA, volume 10168 of Lecture Notes in Computer Science, page 183-195. (2017)Parameterized Enumeration for Modification Problems., , , , , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 524-536. Springer, (2015)Smooth and sharp thresholds for random k-XOR-CNF satisfiability., and . RAIRO Theor. Informatics Appl., 37 (2): 127-147 (2003)Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?, , and . IJCAI, page 824-831. IJCAI/AAAI, (2013)Complexity of Reasoning with Cardinality Minimality Conditions., , and . AAAI, page 3932-3940. AAAI Press, (2023)Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics., , , and . ISMVL, page 100-105. IEEE Computer Society, (2008)Approximating The Satisfiability Threshold For Random K-Xor-Formulas., , and . Comb. Probab. Comput., 12 (2): 113-126 (2003)The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.. CSL, volume 702 of Lecture Notes in Computer Science, page 115-133. Springer, (1992)Belief Update within Propositional Fragments., , and . J. Artif. Intell. Res., (2018)Satisfiability Threshold for Random XOR-CNF Formulas., and . Discret. Appl. Math., (1999)