[DMANET] Postdoc in CS Focused on SAT Solving and Combinatorial Optimization at Lund University

The Department of Computer Science at Lund University invites applications for a postdoc position in computer science focused on SAT solving and combinatorial optimization.

The postdoctoral researcher will be working in the research group of Jakob Nordström, which is currently in transition from KTH to a combined location at Lund University and the University of Copenhagen on either side of the Oresund bridge.

Much of the activities of the research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers based on conflict-driven clause learning (CDCL). We are even more interested in exploring new algebraic or geometric techniques (such as Groebner bases or pseudo-Boolean solving) that could potentially yield exponential improvements over CDCL. We also believe that there should be ample room for technology transfer with related areas such as SMT solving, constraint programming (CP), and/or mixed integer linear programming (MIP), and therefore researchers in these or other related areas are more than welcome to apply.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

The application deadline is February 10, 2020. See http://www.csc.kth.se/~jakobn/openings/Postdoc-SAT-LTH-200210.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se or jn@di.ku.dk .



**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************