Yong Kiam (Nov 27 2024 at 01:05): Yong Kiam (Nov 27 2024 at 01:05):Hi, I was asked to advertise the following positions, which may be of interest:
Tenure-track assistant professorship in foundations of computer science with a focus on logic and automated reasoning (application deadline Jan 8)
The Department of Computer Science at Lund University invites applications for a tenure-track assistant professorship in the foundations of computer science with a focus on logic and automated reasoning.
The assistant professor will be working at the Department of Computer Science, where research into the foundations of computer science is conducted by professors Susanna de Rezende and Jakob Nordstrom. Jakob Nordstrom leads the research group Mathematical Insights into Algorithms for Optimization (https://jakobnordstrom.se/miao-group), which is also active at the University of Copenhagen. The research has a unique profile in that it spans a wide range of questions from the theoretical, mathematical foundations of efficient computation all the way to state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where the research projects do not only go deep into different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise.
This position focuses on algorithms for foundational problems within logic, automated reasoning, and combinatorial optimization. This includes design and implementation of algorithms for computational problems within Boolean satisfiability (SAT) solving, constraint programming, mixed integer linear programming, and/or satisfiability modulo theories (SMT) solving. In addition to algorithm construction, another topic of interest is to develop a scientific understanding of the practical performance of automated reasoning algorithms, and to investigate relations between empirical observations and theoretical results in algorithm analysis and computational complexity theory. Yet another related area concerns methods of ensuring that algorithms compute provably correct results, which can be used to develop trustworthy solvers for automated reasoning and combinatorial optimization.
The application deadline is January 8, 2025. See https://jakobnordstrom.se/openings/AsstProf-Lund-250108.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.
Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +46 70 742 21 98
https://jakobnordstrom.se
I'm looking for talented PostDocs to join the CertiFOX team. You will work on an exciting project in which we will bring certifying algorithms (proof logging) from low-level languages (such as SAT, where this approach is notoriously succesful) to high-level modelling languages. The grand goal we will work towards is to get end-to-end guarantees of correctness of runs of combinatorial optimization engines, all the way from human-readable input specifications to the produced answers.
I'm looking in particular for people with experience either in combinatorial optimization algorithms, or in using proof assistants.
If this triggers your scientific curiosity, have a look at the project webpage: https://bartbogaerts.eu/projects/CertiFOXInterested cadidates can apply at https://www.kuleuven.be/personeel/jobsite/jobs/60411819?hl=nl&lang=nl
Don't hesitate to send me an e-mail if you have any questions.
Prof. Bart Bogaerts
Declarative Languages and Artificial Intelligence section
Department of Computer Science
KU Leuven
Celestijnenlaan 200A, room 01.14
B-3001 Heverlee
Last updated: Dec 22 2024 at 08:21 UTC