Nadia Creignou

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Belief contraction and erasure in fragments of propositional logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2022

Enumeration Classes Defined by Circuits.

[BibT_eX]

[DOI]

Arnaud Durand

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Locally definable vertex set properties are efficiently enumerable.

[BibT_eX]

[DOI]

Sarah Blind

Discret. Appl. Math., 2021

2019

A complexity theory for hard enumeration problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Parameterised Enumeration for Modification Problems.

[BibT_eX]

[DOI]

Algorithms, 2019

2018

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?

[BibT_eX]

[DOI]

Reinhard Pichler

Stefan Woltran

Log. Methods Comput. Sci., 2018

Belief Update within Propositional Fragments.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Belief Update in the Horn Fragment.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Paradigms for Parameterized Enumeration.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

On the Complexity of Hard Enumeration Problems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

Complexity of Model Checking for Cardinality-Based Belief Revision Operators.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

2016

Belief Merging within Fragments of Propositional Logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

SAT and Interactions (Dagstuhl Seminar 16381).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Belief Contraction Within Fragments of Propositional Logic.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Exact location of the phase transition for random (1, 2)-QSAT.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2015

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Parameterized Enumeration for Modification Problems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Complexity Classifications for Logic-Based Argumentation.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Belief revision within fragments of propositional logic.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

2013

Sensitivity of Boolean formulas.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Parameterized Enumeration with Ordering.

[BibT_eX]

[DOI]

CoRR, 2013

2012

The Complexity of Reasoning for Fragments of Autoepistemic Logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

Complexity Classifications for Propositional Abduction in Post's Framework.

[BibT_eX]

[DOI]

Michael Thomas

J. Log. Comput., 2012

SAT Interactions (Dagstuhl Seminar 12471).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

A Framework for the Specification of Random SAT and QSAT Formulas.

[BibT_eX]

[DOI]

Martina Seidl

Proceedings of the Tests and Proofs - 6th International Conference, 2012

Parameterized Complexity of Weighted Satisfiability Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Complexity of logic-based argumentation in Schaefer's framework.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2012

2011

Complexity of logic-based argumentation in Post's framework.

[BibT_eX]

[DOI]

Argument Comput., 2011

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Nonuniform Boolean constraint satisfaction problems with cardinality constraint.

[BibT_eX]

[DOI]

Henning Schnoor

Ilka Schnoor

ACM Trans. Comput. Log., 2010

The Helly property and satisfiability of Boolean formulas defined on set families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions.

[BibT_eX]

[DOI]

Michael Thomas

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Sets of Boolean Connectives That Make Argumentation Easier.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

2009

The SAT-UNSAT transition for random constraint satisfaction problems.

[BibT_eX]

[DOI]

Discret. Math., 2009

The threshold for random (1,2)-QSAT

[BibT_eX]

[DOI]

CoRR, 2009

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Complexity of Clausal Constraints Over Chains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Structure identification of Boolean relations and plain bases for co-clones.

[BibT_eX]

[DOI]

Bruno Zanuttini

J. Comput. Syst. Sci., 2008

New Results on the Phase Transition for Random Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Constraints, 2008

Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.

[BibT_eX]

[DOI]

Henning Schnoor

Ilka Schnoor

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

Phase Transition for Random Quantified XOR-Formulas.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2007

The Complexity of Problems for Quantified Constraints.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

2006

A Complete Classification of the Complexity of Propositional Abduction.

[BibT_eX]

[DOI]

Bruno Zanuttini

SIAM J. Comput., 2006

06401 Abstracts Collection - Complexity of Constraints.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

06401 Executive Summary - Complexity of Constraints.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

2005

Preferred representations of Boolean relations

[BibT_eX]

[DOI]

Bruno Zanuttini

Electron. Colloquium Comput. Complex., 2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

A sharp threshold for the renameable-Horn and the q-Horn properties.

[BibT_eX]

[DOI]

John V. Franco

Discret. Appl. Math., 2005

The complexity of Boolean constraint satisfaction local search problems.

[BibT_eX]

[DOI]

Philippe Chapdelaine

Ann. Math. Artif. Intell., 2005

2004

Combinatorial sharpness criterion and phase transition classification for random CSPs.

[BibT_eX]

[DOI]

Inf. Comput., 2004

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

2003

Generalized satisfiability problems: minimal elements and phase transitions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Smooth and sharp thresholds for random <i>k</i>-XOR-CNF satisfiability.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

Approximating The Satisfiability Threshold For Random K-Xor-Formulas.

[BibT_eX]

[DOI]

Olivier Dubois

Comb. Probab. Comput., 2003

2001

Complexity classifications of Boolean constraint satisfaction problems.

[BibT_eX]

Sanjeev Khanna

Madhu Sudan

SIAM monographs on discrete mathematics and applications 7, SIAM, ISBN: 978-0-89871-479-1, 2001

1999

Satisfiability Threshold for Random XOR-CNF Formulas.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Complexity Versus Stability for Classes of Propositional Formulas.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

1997

Complexity of Satisfiability Problems with Symmetric Polynomial Clauses.

[BibT_eX]

[DOI]

Malika More

J. Log. Comput., 1997

On Generating All Solutions of Generalized Satisfiability Problems.

[BibT_eX]

[DOI]

Jean-Jacques Hébrard

RAIRO Theor. Informatics Appl., 1997

1996

Complexity of Generalized Satisfiability Counting Problems.

[BibT_eX]

[DOI]

Miki Hermann

Inf. Comput., 1996

Exact Complexity of Problems of Incompletely Specified Automata.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1996

1995

The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

A Dichotomy Theorem for Maximum Generalized Satisfiability Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

1992

The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.

[BibT_eX]

[DOI]