[DMANET] Open PhD Position: Algorithms for Constraint Satisfaction

Linköping University advertises up to two (2) positions as
PhD student in Computer Science formally based at the Department
of Computer and Information Science (IDA) within the Wallenberg AI,
Autonomous Systems and Software Program (WASP). WASP is Sweden's
largest individual research program ever, and provides a platform for
academic research and education, fostering interaction with Sweden's
leading technology companies.

The PhD student(s) will join a research project on constraint satisfaction
problems (CSP) directed by prof. Peter Jonsson. This project is within
the WASP program for mathematical foundations of AI, and students within
this project will be part of the WASP graduate school. CSPs are a well-known and
important class of computational problems with a wide range of applications
within computer science, artificial intelligence, and mathematics. An instance
of the constraint satisfaction problem consists of a set of variables, a set
of possible variable values (known as the domain), and a set of constraints
which impose restrictions on value assignments to the variables. To solve
such a problem, a value has to be found for each variable so that all the
constraints are satisfied. The computational complexity of CSP problems has been
intensively studied during the last decades, and several breakthrough results have
recently been presented for the finite-domain case. These results are to a large
extent based on utilising methods from universal algebra and mathematical logic.
This project aims at developing new mathematical methods for analysing the
computational complexity of infinite-domain CSP problems---such problems have very interesting applications within computer science and AI (such as spatiotemporal reasoning, machine learning, scheduling, and bioinformatics). The project aim at constructing new algorithms with significantly better complexity than current algorithms. The work within this project
includes the construction of new algorithms, analysing their complexity, and identifiying general methods for the algorithm construction and analysis.

The application deadline is May 1, 2020.

For further information visit

https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=13594&rmlang=SE

or contact Peter Jonsson

peter.jonsson@liu.se


**********************************************************
*
* 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/
*
**********************************************************