Job Description
Candidates should hold (before start-date of the position) a PhD degree in computer science (or a closely related field)Proficiency in English is required.Research-wise, strong expertise in combinatorial optimization algorithms (e.g., SAT solving, constraint solving, MaxSAT, SAT modulo theories, Answer Set Programming, (Mixed) Integer Programming, ...) is required. The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description and automatically compute an optimal solution to it. Often, users specify their problem in a high-level, human-understandable formal language. This specification is first translated into a low-level specification a solver understands and subsequently solved. Thanks to tremendous progress in solving technology, we can now solve a wide variety of NP-hard (or worse) problems in practice. Moreover, these tools are increasingly used in real-life applications, including high-valu...