| Publication | Date of Publication | Type |
|---|
| Transforming quantified Boolean formulas using biclique covers | 2024-04-05 | Paper |
| Projection heuristics for binary branchings between sum and product | 2022-03-22 | Paper |
| On computing the union of MUSes | 2020-05-20 | Paper |
| Classification of minimally unsatisfiable 2-CNFs | 2020-03-07 | Paper |
| Minimal unsatisfiability and minimal strongly connected digraphs | 2018-08-10 | Paper |
| Minimal unsatisfiability and deficiency: recent developments | 2016-10-26 | Paper |
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
| Unsatisfiable hitting clause-sets with three more clauses than variables | 2016-04-05 | Paper |
Computing maximal autarkies with few and simple oracle queries
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Generalising unit-refutation completeness and SLUR via nested input resolution
Journal of Automated Reasoning | 2015-07-02 | Paper |
| Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses | 2015-05-09 | Paper |
Generalising and unifying SLUR and unit-refutation completeness
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Unified Characterisations of Resolution Hardness Measures
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
Discrete Applied Mathematics | 2014-08-22 | Paper |
| Bounds for variables with few occurrences in conjunctive normal forms | 2014-08-04 | Paper |
On SAT representations of XOR constraints
Language and Automata Theory and Applications | 2014-03-31 | Paper |
On SAT representations of XOR constraints
Language and Automata Theory and Applications | 2014-03-31 | Paper |
On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Theoretical Computer Science | 2014-01-10 | Paper |
On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Constraint satisfaction problems in clausal form. I: Autarkies and deficiency
Fundamenta Informaticae | 2012-07-04 | Paper |
Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure
Fundamenta Informaticae | 2012-07-04 | Paper |
On variables with few occurrences in conjunctive normal forms
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
The seventh QBF solvers evaluation (QBFEVAL'10)
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Green-Tao Numbers and SAT
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Present and Future of Practical SAT Solving
Complexity of Constraints | 2009-01-22 | Paper |
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
Lecture Notes in Computer Science | 2007-09-04 | Paper |
| scientific article; zbMATH DE number 5139164 (Why is no real title available?) | 2007-03-30 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics | 2003-09-15 | Paper |
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theoretical Computer Science | 2003-01-21 | Paper |
| On the use of autarkies for satisfiability decision | 2001-09-24 | Paper |
Investigations on autark assignments
Discrete Applied Mathematics | 2001-07-26 | Paper |
On a generalization of extended resolution
Discrete Applied Mathematics | 2000-08-03 | Paper |
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1113996 (Why is no real title available?) | 1998-06-14 | Paper |
