Find Your Next Job
Postdoc In Certified Combinatorial Optimization
Posted on Nov. 26, 2024
- Leuven, Belgium
- No Salary information.
- Full Time
PostDoc in Certified Combinatorial Optimization
(ref. BAP-2024-727)
Laatst aangepast: 26/11/24
We are looking for an excellent researcher to strengthen Bart Bogaerts' research group on Knowledge Representation and Combinatorial
Optimization, which is part of the Declarative Languages and Artificial Intelligence (DTAI) section of the department of Computer Science of KU Leuven.
We are particularly looking for someone who can strengthen the recently-launched research line on proof logging (also known as certifying
algorithms) for combinatorial optimization, and in particular the CertiFOX project.
In this line of project, the goal is to develop methods and algorithms that can guarantee with 100% certainty that the answers produced by a
combinatorial optimizer are correct. The project page (see the link below) contains more information on this research direction.
Optimization, which is part of the Declarative Languages and Artificial Intelligence (DTAI) section of the department of Computer Science of KU Leuven.
We are particularly looking for someone who can strengthen the recently-launched research line on proof logging (also known as certifying
algorithms) for combinatorial optimization, and in particular the CertiFOX project.
In this line of project, the goal is to develop methods and algorithms that can guarantee with 100% certainty that the answers produced by a
combinatorial optimizer are correct. The project page (see the link below) contains more information on this research direction.
Website van de eenheid
Responsibilities
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-value and life-affecting decisions. Therefore, it is of utmost importance that they be
completely reliable. The central objective of the CertiFOX project is to develop methodologies and tools with which we can guarantee with 100%
certainty that the right problem has been solved correctly.
To achieve this ambitious objective, we will build on recent breakthroughs in proof logging, where solvers do not just output an answer,
but also a machine-verifiable proof (or certificate) of correctness. However, a major limitation of current techniques is that correctness is
not proven relative to the human-understandable specification written by the user, but relative to the low-level translation that the solver
receives, meaning that there is no guarantee that the solver is solving the original problem. In this project, we will investigate end-to end
guarantees of correctness. When successful, this will have a major impact on the way combinatorial optimization software is developed,
evaluated, and used: the proofs produced will enable (1) debugging, since proofs contain detailed information about where bugs occurred,
(2) auditability, since proofs can be stored and checked by an independent third party, and even (3) rigorous evaluation of algorithmic
improvements.
The successful candidate will perform research that advances the state-of-the-art in proof logging in general, and in particular focus on
bringing proof logging to human-understandable language. More information on the research topic can be found on the project website [5].
The selected candidate is in this context expected to take up some mentoring responsibilities towards PhD students and MSc students
working on the project.
Profile
- 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, there are two potential profiles that would strengthen our team:
-
Profile 1: a candidate with strong expertise in proof assistants (Lean/Coq/HOL/...) with an interest in combinatorial optimization.
Such a candidate would be responsible for the development of formally verified version of the proof checkers in the CertiFOX project -
Profile 2: a candidate with strong expertise in combinatorial optimization algorithms (e.g., SAT solving, constraint solving, MaxSAT,
SAT modulo theories, Answer Set Programming, (Mixed) Integer Programming, ...).
Offer
- We offer a fully-funded postdoc position, initially for 12 months, but renewable and with expected duration of two or three years.
- The position comes with a competitive salary (academic salaries in Belgium are very competitive) or an equivalent scholarship, as well as with travel budget.
- This is a pure research position, but it also comes with the possibility to participate in advanced teaching (while this is encouraged, it is not mandatory).
The start is foreseen to be around the summer of 2025, but this is negotiable.
Project webpage
Tutorials on proof logging
DTAI webpage
Interested?
For more information please contact Prof. dr. Bart Bogaerts, tel.: +32 16 32 79 26, mail: bart.bogaerts@kuleuven.be.
You can apply for this job no later than February 06, 2025 via the online application tool
KU Leuven strives for an inclusive, respectful and socially safe environment. We embrace diversity among individuals and groups as an asset. Open dialogue and differences in perspective are essential for an ambitious research and educational environment. In our commitment to equal opportunity, we recognize the consequences of historical inequalities. We do not accept any form of discrimination based on, but not limited to, gender identity and expression, sexual orientation, age, ethnic or national background, skin colour, religious and philosophical diversity, neurodivergence, employment disability, health, or socioeconomic status. For questions about accessibility or support offered, we are happy to assist you at this email address.
Heb je een vraag over de online sollicitatieprocedure? Raadpleeg onze veelgestelde vragen of stuur een e-mail naar solliciteren@kuleuven.be
Solliciteer voor deze functie
av_timer Tewerkstellingspercentage: Voltijds
location_city Locatie : Leuven
timer Solliciteren tot en met:
06/02/2025 23:59 CET
bookmarks Tags: Computerwetenschappen
Tailor Your Resume for this Job
Share with Friends!