professor profile picture

Bart Bogaerts

Prof. dr. at KU Leuven

KU Leuven

Country flag

Canada

Has open position

This profile is automatically generated from trusted academic sources.

Google Scholar

.

ORCID

.

LinkedIn

Social connections

How do I reach out?

Sign in for free to see their profile details and contact information.

Meet Kite AI

Contact this professor

LinkedIn
ORCID
Google Scholar

Research Interests

Artificial Intelligence

10%

Mathematics

20%

Combinatorial Optimization

20%

Computer Science

20%

Knowledge Representation

20%

Information Technology

10%

Ask ApplyKite AI

Start chatting
How can you help me contact this professor?
What are this professor's research interests?
How should I write an email to this professor?

Positions2

Publisher
source

Bart Bogaerts

University Name
.

KU Leuven

Fully-funded PhD position in Explanations for Combinatorial Optimization

KU Leuven is offering a fully funded PhD position in Explanations for Combinatorial Optimization within Bart Bogaerts’ research group on Knowledge Representation and Combinatorial Optimization, part of the Declarative Languages and Artificial Intelligence (DTAI) section of the Department of Computer Science. The project sits at the intersection of combinatorial optimization, logic, and trustworthy AI. The research team studies how high-level, human-readable problem specifications are translated into solver-ready forms, and how to provide stronger guarantees that the solver has correctly addressed the original problem. A central theme is the development of explanation methods for decisions made by combinatorial optimizers: explaining infeasibility, optimality, uniqueness, and how a user could have inferred a result. The position will contribute specifically to this explanation-focused research line, with possible directions including the relationship between proofs and explanations, abstraction levels for explanations, solver modifications that make explanations easier to extract, and domain-specific explanation methods. The posting highlights the relevance of proof logging, auditability, debugging, and accountability in high-impact applications, including compliance with requirements such as GDPR-style accountability for AI systems affecting people’s lives. The research environment is highly academic and method-oriented, with references to the CertiFOX project and ZebraTutor examples as inspiration. This is a PhD opening , not a postdoc or master’s position. The successful candidate must hold an MSc degree in computer science or a closely related field such as mathematics before the start date. Applicants should be genuinely interested in declarative problem solving, combinatorial optimization, knowledge representation, and/or logic-based methods, and should have strong scientific curiosity, solid programming skills, and English proficiency. The position is fully funded for an expected duration of four years, with scholarship funding competitive with Belgian salaries and a travel budget for conferences, workshops, and summer schools. The expected start is around the beginning of 2027, though this is negotiable. The application deadline is 2026-09-30 . For further information, contact Prof. dr. Bart Bogaerts at [email protected] and apply through the KU Leuven job application link.

just-published

Publisher
source

Bart Bogaerts

University Name
.

KU Leuven

Postdoc in Combinatorial Search & Optimization (SAT / CP / SMT / MIP)

Postdoc in Combinatorial Search & Optimization (SAT / CP / SMT / MIP) at KU Leuven , Belgium, in the research group of Prof. dr. Bart Bogaerts within the Knowledge Representation and Combinatorial Optimization group of the Declarative Languages and Artificial Intelligence (DTAI) section, Department of Computer Science. The position focuses on research in combinatorial optimization and declarative problem solving, with an emphasis on building reliable tools that translate high-level problem descriptions into solver-ready formulations and then compute optimal solutions correctly. The project highlights recent advances in proof logging and machine-verifiable certificates, aiming for end-to-end correctness guarantees relative to the original user specification, not just the translated model. A second major theme is explainability: developing human-understandable explanations for why a solution is optimal, why no solution exists, or why a problem has a unique solution. This is a strong fit for researchers interested in SAT solving, constraint programming, MaxSAT, SMT, Answer Set Programming, mixed integer programming, and related areas of combinatorial search and optimization. The advertised work also connects to auditability, debugging, rigorous evaluation of algorithms, and trustworthy AI-style decision support in high-impact applications. The role is a fully funded postdoc position with an expected duration of 2 years (negotiable) and includes sufficient travel budget . Applicants must hold a PhD in computer science or a closely related field before the start date and have strong expertise in combinatorial optimization algorithms. Proficiency in English is required. Application deadline: 2026-10-30. How to apply: submit your application through the KU Leuven job portal using the provided application link. For questions, contact Prof. dr. Bart Bogaerts at [email protected].

just-published