Stephan Gocht is a PhD student at Lund University. His main research
interest is how to provide easily verifiable proofs for the
unsatisfiablity and optimality of combinatorial problems, especially
in the context of SAT solving and pseudo-Boolean solving, i.e., 0-1
linear programming. To verify such proofs, he developed and maintains
the proof verifier VeriPB.