Dr Oliver Kullmann
Associate Professor
Computer Science
Telephone: (01792) 513369
Email: JavaScript is required to view this email address.
Room: Office - 408
Fourth Floor
Computational Foundry
Bay Campus


  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. Heule, M., Kullmann, O., Biere, A. Cube-and-Conquer for Satisfiability (Ed.), Handbook of Parallel Constraint Reasoning 31 59 Springer
  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. The science of brute force Communications of the ACM 60 8 70 79

See more...


  • CS-270 Algorithms

    This module introduces students to the formal concepts of algorithms and data structures and will enable them to understand how the selection of different algorithms and data types affects the performance and efficiency of a program. Particular attention will be paid to the fundamental problems of searching, sorting, and graph traversal.

  • CS-700 Logic and Computation Project

    The research project will provide students with the opportunity of exploring a particular topic in computer science in some considerable depth. The project may involve the development of a software system in which case the student will experience the major phases of the life-cycle of a practical IT-project: Specification, design, implementation, testing, verification and validation. The project will enhance the students' competence in algorithm or system analysis, as well as informal and formal mathematical reasoning. It will give students an intellectual challenge to their abilities to learn new subjects without instruction and to further develop their abilities in literature researching, report writing, verbal presentation, project planning and time management.

  • CS-M05 Advanced Topics in logic and computation

    This module provides a broad overview of current research. Students will write reports and give talks on general research topics in theoretical computer science.

  • CS-M41 Programming in Java

    This intensive course provides a solid introduction to the Java programming language and development process.

  • CSCM41 Programming in Java

    This intensive course provides a solid introduction to the Java programming language and development process.


  • Synthesis of Solving Procedures (current)

    Other supervisor: Dr Monika Seisenberger
  • The combinatorics of minimal unsatisfiability (current)

    Other supervisor: Prof Arnold Beckmann
  • Covering systems via generalised SAT. (current)

    Other supervisor: Dr Edwin Beggs
  • Complexity of Counting N-Queens (awarded 2019)

    Other supervisor: Dr Arno Pauly