Publications

Journal Articles

  1. Heule, M., Kullmann, O. The science of brute force Communications of the ACM 60 8 70 79
  2. Ahmed, T., Kullmann, O., Snevily, H. On the van der Waerden numbers Discrete Applied Mathematics 174 27 51
  3. Gwynne, M., Kullmann, O. Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution Journal of Automated Reasoning 52 1 31 65
  4. Kullmann, O., Zhao, X. On Davis–Putnam reductions for minimally unsatisfiable clause-sets Theoretical Computer Science 492 70 87
  5. Kullmann, O. Constraint satisfaction problems in clausal form I: Autarkies and deficiency. Fundamenta Informaticae 109 1 27 81
  6. Kullmann, O. Constraint satisfaction problems in clausal form II: Minimal unsatisfiability and conflict structure. Fundamenta Informaticae 109 1 83 119
  7. Kullmann, O. The OKlibrary: Introducing a "holistic" research platform for (generalised) SAT solving Studies in Logic 2 1 20 53
  8. Kullmann, O. The SAT 2005 solver competition on random instances Journal on Satisfiability, Boolean Modeling and Computation 2 61 102
  9. Kullmann, O. Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems Annals of Mathematics and Artificial Intelligence 40 3/4 303
  10. Kullmann, O. Lean clause-sets: generalizations of minimally unsatisfiable clause-sets Discrete Applied Mathematics 130 2 209
  11. Fleischner, H., Kullmann, O., Szeider, S. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Theoretical Computer Science 289 1 503
  12. Kullmann, O., Kullmann, O. New methods for 3-SAT decision and worst-case analysis Theoretical Computer Science 223 1-2 1 72

Books

  1. Kullmann, O. Theory and Applications of Satisfiability Testing -- SAT 2009 (Ed.), Springer

Book Chapters

  1. Heule, M., Kullmann, O., Biere, A. Cube-and-Conquer for Satisfiability (Ed.), Handbook of Parallel Constraint Reasoning 31 59 Springer
  2. Kullmann, O., Marques-Silva, J. Computing Maximal Autarkies with Few and Simple Oracle Queries (Ed.), Theory and Applications of Satisfiability Testing -- SAT 2015 138 155
  3. Buening, H., Kullmann, O. Chapter 11: Minimal satisfiability and autarkies (Ed.), 339 401 IOS Press
  4. Kullmann, O. Chapter 7: Fundaments of branching heuristics (Ed.), Handbook of Satisfiability 205 244 Amsterdam IOS Press
  5. Kullmann, O. Present and Future of Practical SAT Solving (Ed.), Complexity of Constraints 283 Springer
  6. Kullmann, O. Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms (Ed.), Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996) 261 313 American Mathematical Society

Conference Contributions

  1. Mencía, C., Kullmann, O., Ignatiev, A., Marques-Silva, J. On Computing the Union of MUSes Theory and Applications of Satisfiability Testing – SAT 2019 11628 211 221
  2. Abbasizanjani, H., Kullmann, O. Minimal unsatisfiability and minimal strongly connected digraphs Theory and Applications of Satisfiability Testing - SAT 2018
  3. Kullmann, O. Autarkies for DQCNF Formal Methods in Computer-Aided Design (FMCAD 2019) 179 183
  4. Heule, M., Kullmann, O. Solving very hard problems: Cube-and-Conquer, a hybrid SAT solving method 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) 4864 4868
  5. Heule, M., Kullmann, O., Marek, V. Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer Theory and Applications of Satisfiability Testing – SAT 2016 9710 228 245
  6. Gwynne, M., Kullmann, O. On SAT Representations of XOR Constraints Language and Automata Theory and Applications 8370 420
  7. Beyersdorff, O., Kullmann, O. Unified Characterisations of Resolution Hardness Measures Theory and Applications of Satisfiability Testing – SAT 2014 8561 187
  8. Gwynne, M., Kullmann, O. Generalising and Unifying SLUR and Unit-Refutation Completeness SOFSEM 2013: Theory and Practice of Computer Science. LCNS 7741 220 232
  9. Kullmann, O., Zhao, X. On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets Theory and Applications of Satisfiability Testing – SAT 2012. LCNS 7317 270 283
  10. Heule, M., Kullmann, O., Wieringa, S., Biere, A. Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads Hardware and Software: Verification and Testing 7261 50 65
  11. Kullmann, O., Zhao, X. On Variables with Few Occurrences in Conjunctive Normal Forms Theory and Applications of Satisfiability Testing - SAT 2011 6695 33 46
  12. Kullmann, O. Green-Tao Numbers and SAT Theory and Applications of Satisfiability Testing – SAT 2010 LCNS 6175 352 362
  13. Peschiera, C., Pulina, L., Tacchella, A., Bubeck, U., Kullmann, O., Lynce, I. The Seventh QBF Solvers Evaluation (QBFEVAL’10) Theory and Applications of Satisfiability Testing – SAT 2010 LCNS 6175 237 250