Oliver Kullmann

Matthew Gwynne, Oliver Kullmann: Generalising and Unifying SLUR and Unit-Refutation Completeness. SOFSEM 2013: 220-232

Matthew Gwynne, Oliver Kullmann: Towards a theory of good SAT representations. CoRR abs/1302.4421 (2013)

Oliver Kullmann, Xishun Zhao: On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT 2012: 270-283

Oliver Kullmann, Xishun Zhao: On Davis-Putnam reductions for minimally unsatisfiable clause-sets. CoRR abs/1202.2600 (2012)

Matthew Gwynne, Oliver Kullmann: Generalising unit-refutation completeness and SLUR via nested input resolution. CoRR abs/1204.6529 (2012)

Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer: SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012)

Oliver Kullmann: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. Fundam. Inform. 109(1): 27-81 (2011)

Oliver Kullmann: Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. Fundam. Inform. 109(1): 83-119 (2011)

Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere: Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference 2011: 50-65

Oliver Kullmann, Xishun Zhao: On Variables with Few Occurrences in Conjunctive Normal Forms. SAT 2011: 33-46

Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily: On the van der Waerden numbers w(2;3,t). CoRR abs/1102.5433 (2011)

Oliver Kullmann: Constraint satisfaction problems in clausal form. CoRR abs/1103.3693 (2011)

Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce: The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250

Oliver Kullmann: Green-Tao Numbers and SAT. SAT 2010: 352-362

Oliver Kullmann: Exact Ramsey Theory: Green-Tao numbers and SAT. CoRR abs/1004.0653 (2010)

Oliver Kullmann, Xishun Zhao: On variables with few occurrences in conjunctive normal forms. CoRR abs/1010.5756 (2010)

Oliver Kullmann: Fundaments of Branching Heuristics. Handbook of Satisfiability 2009: 205-244

Hans Kleine Büning, Oliver Kullmann: Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401

Oliver Kullmann (Ed.): Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Lecture Notes in Computer Science 5584, Springer 2009, isbn 978-3-642-02776-5

Oliver Kullmann: Present and Future of Practical SAT Solving. Complexity of Constraints 2008: 283-319

Oliver Kullmann: Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT 2007: 314-327

Oliver Kullmann: Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Electronic Colloquium on Computational Complexity (ECCC) 14(055) (2007)

Oliver Kullmann: The SAT 2005 Solver Competition on Random Instances. JSAT 2(1-4): 61-102 (2006)

Oliver Kullmann: Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. Complexity of Constraints 2006

Oliver Kullmann, Inês Lynce, João Marques-Silva: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. SAT 2006: 22-35

Oliver Kullmann: Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. Ann. Math. Artif. Intell. 40(3-4): 303-352 (2004)

Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004

Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104

Oliver Kullmann: Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics 130(2): 209-249 (2003)

Oliver Kullmann: The Combinatorics of Conflicts between Clauses. SAT 2003: 426-440

Herbert Fleischner, Oliver Kullmann, Stefan Szeider: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002)

Oliver Kullmann: On the use of autarkies for satisfiability decision. Electronic Notes in Discrete Mathematics 9: 231-253 (2001)

Oliver Kullmann: Investigations on autark assignments. Discrete Applied Mathematics 107(1-3): 99-137 (2000)

Oliver Kullmann: An improved version of width restricted resolution. AMAI 2000

Oliver Kullmann: An Application of Matroid Theory to the SAT Problem. IEEE Conference on Computational Complexity 2000: 116-

Oliver Kullmann: An application of matroid theory to the SAT problem. Electronic Colloquium on Computational Complexity (ECCC) 7(18) (2000)

Oliver Kullmann: On a Generalization of Extended Resolution. Discrete Applied Mathematics 96-97: 149-176 (1999)

Oliver Kullmann: New Methods for 3-SAT Decision and Worst-case Analysis. Theor. Comput. Sci. 223(1-2): 1-72 (1999)

Oliver Kullmann: Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs. Electronic Colloquium on Computational Complexity (ECCC)(41) (1999)