| Publication | Date of Publication | Type |
|---|
Enumeration classes defined by circuits
ACM Transactions on Computation Theory | 2026-01-20 | Paper |
| Enumeration classes defined by circuits | 2024-08-06 | Paper |
Belief contraction and erasure in fragments of propositional logic
Journal Of Logic And Computation | 2022-11-01 | Paper |
Locally definable vertex set properties are efficiently enumerable
Discrete Applied Mathematics | 2021-09-15 | Paper |
A complexity theory for hard enumeration problems
Discrete Applied Mathematics | 2019-09-19 | Paper |
scientific article; zbMATH DE number 6970794 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-02 | Paper |
| Belief contraction within fragments of propositional logic | 2018-07-12 | Paper |
Belief Update within Propositional Fragments
Journal of Artificial Intelligence Research | 2018-05-02 | Paper |
| Complexity of model checking for cardinality-based belief revision operators | 2017-09-05 | Paper |
Paradigms for parameterized enumeration
Theory of Computing Systems | 2017-08-15 | Paper |
| Belief merging within fragments of propositional logic | 2017-07-18 | Paper |
Belief merging within fragments of propositional logic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
On the complexity of hard enumeration problems
Lecture Notes in Computer Science | 2017-06-01 | Paper |
Complexity versus stability for classes of propositional formulas
Information Processing Letters | 2016-06-09 | Paper |
Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
Fundamenta Informaticae | 2016-05-11 | Paper |
Parameterized enumeration for modification problems
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Belief update within propositional fragments
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Complexity Classifications for Logic-Based Argumentation
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Exact location of the phase transition for random \((1,2)\)-QSAT
RAIRO - Theoretical Informatics and Applications | 2015-04-15 | Paper |
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences | 2013-12-13 | Paper |
Paradigms for parameterized enumeration
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Parameterized complexity of weighted satisfiability problems
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Sensitivity of Boolean formulas
European Journal of Combinatorics | 2013-03-19 | Paper |
Complexity classifications for different equivalence and audit problems for Boolean circuits
Logical Methods in Computer Science | 2012-10-22 | Paper |
Enumerating all solutions of a Boolean CSP by non-decreasing weight
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
The complexity of problems for quantified constraints
Theory of Computing Systems | 2010-10-06 | Paper |
| Expected number of locally maximal solutions for random Boolean CSPs | 2010-08-02 | Paper |
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics | 2010-04-27 | Paper |
The SAT-UNSAT transition for random constraint satisfaction problems
Discrete Mathematics | 2009-06-19 | Paper |
scientific article; zbMATH DE number 5547881 (Why is no real title available?)
(available as arXiv preprint) | 2009-04-28 | Paper |
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
Complexity of Constraints | 2009-01-22 | Paper |
A dichotomy theorem for maximum generalized satisfiability problems.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
Computer Science Logic | 2008-11-20 | Paper |
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences | 2008-11-19 | Paper |
New Results on the Phase Transition for Random Quantified Boolean Formulas
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Complexity of clausal constraints over chains
Theory of Computing Systems | 2008-04-03 | Paper |
A Complete Classification of the Complexity of Propositional Abduction
SIAM Journal on Computing | 2006-06-01 | Paper |
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
Discrete Applied Mathematics | 2006-01-10 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
The complexity of Boolean constraint satisfaction local search problems
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2127760 (Why is no real title available?) | 2005-01-14 | Paper |
Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation | 2004-08-06 | Paper |
Generalized satisfiability problems: Minimal elements and phase transitions.
Theoretical Computer Science | 2003-08-17 | Paper |
Approximating the Satisfiability Threshold for Random k-XOR-formulas
Combinatorics, Probability and Computing | 2003-01-01 | Paper |
Complexity classifications of Boolean constraint satisfaction problems
SIAM Monographs on Discrete Mathematics and Applications | 2001-07-03 | Paper |
Satisfiability threshold for random XOR-CNF formulas
Discrete Applied Mathematics | 2000-01-17 | Paper |
On generating all solutions of generalized satisfiability problems
RAIRO - Theoretical Informatics and Applications | 1998-05-24 | Paper |
Complexity of satisfiability problems with symmetric polynomial clauses
Journal Of Logic And Computation | 1998-01-12 | Paper |
The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
Theoretical Computer Science | 1997-02-28 | Paper |
Complexity of generalized satisfiability counting problems
Information and Computation | 1997-01-02 | Paper |
Exact complexity of problems of incompletely specified automata
Annals of Mathematics and Artificial Intelligence | 1996-12-01 | Paper |
| scientific article; zbMATH DE number 515731 (Why is no real title available?) | 1994-08-21 | Paper |
On the enumeration of signatures of XOR-CNF's
(available as arXiv preprint) | N/A | Paper |
