Logic List Mailing Archive

Postdoc position and PhD student position in SAT solving, Stockholm (Sweden), Deadline: 15 Jan 2017

Dear colleagues,

I would very much appreciate your assistance in spreading the information
that the Theory Group at KTH Royal Institute of Technology is looking for
one postdoc and one PhD student in SAT solving (with close connections to
proof complexity).

The positions are within the research group led by Jakob Nordstrom. Much of
the activities of this 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 --- in particular, solvers using
conflict-driven clause learning (CDCL). We are even more interested in
exploring new techniques that hold out the theoretical possibility of
exponential improvements over CDCL, but seem hard to implement efficiently
in practice, e.g., algebraic methods such as Groebner bases or geometric
methods such as pseudo-Boolean solving.

The application deadline is January 15, 2017. See
http://www.csc.kth.se/~jakobn/openings/D-2016-0872-Eng.php and
http://www.csc.kth.se/~jakobn/openings/D-2016-0833-Eng.php, respectively,
for full announcements with more information and instructions how to apply.
Informal enquiries are welcome and may be sent to jakobn@kth.se .

With best regards,
Jakob Nordstrom

Jakob Nordström, Associate Professor
KTH Royal Institute of Technology
Phone: +46 8 790 69 19 (office), +46 70 742 21 98 (cell)
http://www.csc.kth.se/~jakobn/
--
[LOGIC] mailing list
http://www.dvmlg.de/mailingliste.html
Archive: http://www.illc.uva.nl/LogicList/

provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam