Computer science KU Leuven in Belgium

3 Oct 2025
Job Information

Organisation/Company

KU LEUVEN

Research Field

Computer science » Modelling tools
Computer science » Informatics
Mathematics » Mathematical logic

Researcher Profile

Recognised Researcher (R2)

Country

Belgium

Application Deadline

31 Oct 2025 - 23:59 (UTC)

Type of Contract

Temporary

Job Status

Full-time

Offer Starting Date

1 Feb 2026

Is the job funded through the EU Research Framework Programme?

Horizon Europe - ERC

Reference Number

BAP-2025-595

Marie Curie Grant Agreement Number

101122653

Is the Job related to staff position within a Research Infrastructure?

No

Offer Description

The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description andautomatically 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 tremendousprogress in solving technology, we can now solve a wide variety of NP-hard (or worse) problems in practice. Moreover, these tools areincreasingly used in real-life applications, including high-value and life-affecting decisions. Therefore, it is of utmost importance that they becompletely 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 isnot proven relative to the human-understandable specification written by the user, but relative to the low-level translation that the solverreceives, meaning that there is no guarantee that the solver is solving the original problem. In this project, we will investigate end-to endguarantees 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 algorithmicimprovements.
An additional point of interest is investigating the link between proofs and (human-understandable) explanations.
The successful candidate will perform research that advances the state-of-the-art in proof logging in general, and in particular focus onbringing proof logging to human-understandable language. More information on the research topic can be found on the project website.The selected candidate is in this context expected to take up some mentoring responsibilities towards PhD students and MSc studentsworking on the project.

• 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.

The candidate should have strong expertise in combinatorial optimization algorithms (e.g., SAT solving, constraint solving, MaxSAT, SAT modulo theories, Answer Set Programming, (Mixed) Integer Programming, ...).

• 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 early 2026, but this is negotiable.  For more information please contact Prof. dr. Bart Bogaerts, tel.: +32 16 32 79 26, mail: [email protected] .

Where to apply

Website

https://www.kuleuven.be/personeel/jobsite/jobs/60562950?hl=en

Requirements

Research Field

Computer science

Education Level

PhD or equivalent

Languages

ENGLISH

Level

Excellent

Research Field

Computer science » Modelling tools

Years of Research Experience

4 - 10

Additional Information
Benefits

• 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 early 2026, but this is negotiable.

Eligibility criteria

• 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.

The candidate should have strong expertise in combinatorial optimization algorithms (e.g., SAT solving, constraint solving, MaxSAT, SAT modulo theories, Answer Set Programming, (Mixed) Integer Programming, ...).

Selection process

For more information please contact Prof. dr. Bart Bogaerts, tel.: +32 16 32 79 26, mail: [email protected] .

Website for additional job details

https://www.kuleuven.be/personeel/jobsite/jobs/60562950?hl=en

Work Location(s)

Number of offers available

1

Company/Institute

KU LEUVEN

Country

Belgium

City

Leuven

Geofield

Contact

City

Leuven

STATUS: EXPIRED

• X (formerly Twitter)
• Facebook
• LinkedIn
• Whatsapp
• 
  More share options
  • E-mail
  • Pocket
  • Viadeo
  • Gmail
  • Weibo
  • Blogger
  • Qzone
  • YahooMail