معرفی
Dr. Oliver Kullmann is an Associate Professor in the Department of Computer Science at Swansea University, Faculty of Science and Engineering. His work focuses on theoretical computer science, particularly in satisfiability (SAT) solving, constraint satisfaction problems, and algorithm design. He has contributed to advancements in SAT-solving techniques like Cube-and-Conquer and has published extensively on topics such as quantified Boolean formulas, minimal unsatisfiable subformulas (MUSes), and parallel computing.
Research Interests: Dr. Kullmann’s research spans algorithmic approaches to SAT and CSP, including the development of efficient solving methods, formal verification, and parallel computing optimizations. His work emphasizes practical applications of theoretical results, such as the Boolean Pythagorean Triples problem and GPU-accelerated algorithms for combinatorial problems like the N-Queens puzzle.
Publications highlight his contributions to SAT theory and applications, with a focus on foundational aspects like autarkies, clause-set minimization, and hypergraph-based techniques. His work also integrates interdisciplinary methods, such as leveraging linear algebra and graph theory for SAT decision problems.
Dr. Kullmann supervises PhD and MRes students in areas including SAT solving algorithms, general-purpose programming languages, and verification tools. He teaches modules such as Algorithms (CS-270) and the Logic and Computation Project (CS-700). His research platform, the OKlibrary, supports holistic SAT-solving research.
