CP/SAT Doctoral Program 2025

August 10-11 2025, Glasgow, Scotland

News

A tentative program of the DP is now available. See Program for more details.

Call for Doctoral Program Submissions

The Joint CP/SAT Doctoral Programme (DP) is open to all research students, including past participants, who are conducting research related to constraint programming and satisfiability. The goal is to provide an informal environment for networking, presenting and discussing ongoing work, and receiving feedback from both fellow research students and experts in the field. Participation requires a paper submission to the DP, reviewing other submissions to the DP and attendance in person.

The DP is a two-day event (10-11 August 2025). The exact schedule is yet to be confirmed, but the currently planned structure of its content is outlined as follows:

Important Dates

Submission Deadline: June 8 2025 June 10 2025 (AoE)

Deadline for financial support requests: June 15 2025 June 25 2025

Review Deadline: June 22 2025

Notification: June 25 2025

Notification of Financial Support: June 28 2025

Deadline of Camera Ready paper: 15 July 2025 22 July 2025 (AoE)

Submission

To participate, students must submit a short paper. Papers must be primarily the work of the student and can be work in progress, completed work or recently published work. Students whose work has been accepted at CP 2025 or SAT 2025 can submit a two-page extended abstract summarising the key findings. Otherwise, students must submit an original paper of up to 8 pages describing completed or ongoing research or a summary of their research/PhD topic. Submissions can include up to one additional page of references.

The submission form must clearly specify the student as the first author and list all advisors and co-authors. Papers must follow the LIPIcs guidelines of the main conferences, be in PDF format and not include author information in the text or metadata. All papers will go through a double-blind reviewing process, meaning that authors and reviewers are mutually anonymous. For this reason, submitted papers should not contain author names, affiliations, or links to identifying websites. As the DP aims to develop academic maturity of young CP and SAT researchers, all reasonable submissions will be accepted.

All abstracts and papers should be submitted online through EasyChair by selecting “New Submission” at https://easychair.org/my/conference?conf=satcpdp25. (If you are submitting an abstract only, please still submit a PDF containing the title, authors and abstract.)

Accepted papers will be made available online but not published in formal printed proceedings. This allows the submitted work to be reused and/or extended for submission to other conferences and journals.

Invited Speakers

Financial Support

Financial support is granted on a case-by-case basis, depending on the merits and needs of the young researcher, as well as our financial capabilities.

To apply, please send an e-mail to the DP Chairs (with your advisor in CC) including the following information:

Please also indicate in the e-mail whether the student has benefited from similar financial support in the past.

Program (Tentative)

Time Sunday, 10th August Monday, 11th August
09:00 - 09:30
Machine Learning Model for Selecting Assignments of Variables for SAT Problems
Jonathan Oliva and Peter Nightingale
(Original Paper, 15+3 min)

Dependency-Curated Large Neighbourhood Search
Frej Knutar Lewander, Pierre Flener and Justin Pearson
(Extended Abstract, 7+2 min)
09:30 - 10:00
Do LLMs Understand Constraint Programming? Zero-Shot Constraint Programming Model Generation Using LLMs
Yuliang Song and Eldan Cohen
(Original Paper, 15+3 min)

Transformer-based Feature Learning for Algorithm Selection in Combinatorial Optimisation
Alessio Pellegrino, Özgür Akgün, Zeynep Kiziltan, Ian Miguel and Nguyen Dang
(Extended Abstract, 7+2 min)
10:00 - 10:30
Approximate SMT Counting Beyond Discrete Domains
Arijit Shaw and Kuldeep S. Meel
(Original Paper, 15+3 min)

Learning to Bound for Maximum Common Subgraph Algorithms
Buddhi Wathsala Kothalawala, Henning Koehler and Qing Wang
(Extended Abstract, 7+2 min)
10:30 - 11:00 Registration & Coffee Break Coffee Break
11:00 - 11:30
Opening
Mun See Chang, Katalin Fazekas

Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis
Orestis Lomis, Jo Devriendt, Hendrik Bierlee and Tias Guns
(Extended Abstract, 7+2 min)

Invited Talk

In the Reviewer’s Eye
Sophie Tourret
11:30 - 12:00
Practically Feasible Proof Logging for Pseudo-Boolean Optimization
Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan and Marc Vinyals
(Extended Abstract, 7+2 min)

Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization
Benjamin Bogø, Xiamin Chen, Wietze Koops, Pinyan Lu, Jakob Nordström, Marc Vinyals and Qingzhao Wu
(Original Paper, 15+3 min)
12:00 - 12:30
Efficient Certified Reasoning for Binarized Neural Networks
Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen and Kuldeep S. Meel
(Extended Abstract, 7+2 min)

Proof logging the Generalized Totalizer Encoding
Carlos Cantero, Bart Bogaerts and Dieter Vandesande
(Original Paper, 15+3 min)
Circuit Learning for Boolean Satisfiability Problem
Zhengyuan Shi and Qiang Xu
(Original Paper, 15+3 min)
12:30 - 13:00 Lunch Break Lunch Break
13:00 - 13:30
13:30 - 14:00

Invited Talk

How Not To Do It
Ian Gent
Problem Partitioning via Proof Prefixes
Zachary Battleman, Joseph Reeves and Marijn Heule
(Extended Abstract, 7+2 min)

Workload Balancing in a Food Distribution Center Comparing Constraint Programming and Mixed-Integer Linear Programming
Josep Maria Salvia Hornos, Ivet Rafegas Fonoll, Cèsar Fernandez Camón and Carles Mateu
(Original Paper, 15+3 min)
14:00 - 14:30
Streamlining Distributed SAT Solver Design
Niccolò Rigi-Luperti, Dominik Schreiber and Armin Biere
(Extended Abstract, 7+2 min)

Beyond Core-Guided MaxSAT
Ion Mikel Liberal, Jordi Levy and Ilario Bonacina
(Original Paper, 15+3 min)
14:30 - 15:00
Certified Grounding of Extensions of First-Order Logic
Daimy Van Caudenberg, Carlos Cantero, Markus Anders and Bart Bogaerts
(Original Paper, 15+3 min)
Enumerating All Boolean Matches
Yogev Shalmon and Alexander Nadel
(Extended Abstract, 7+2 min)

MaxSAT and pseudo-Boolean Solutions for the Multi-Skill Project Scheduling Problem
Wilber Bermeo, Mateu Villaret and Jordi Coll
(Original Paper, 15+3 min)
15:00 - 15:30 Coffee Break Coffee Break
15:30 - 16:00
Analyzing Self-stabilization of Synchronous Unison via Propositional Satisfiability
Asma Khoualdia, Sami Cherif, Stéphane Devismes and Léo Robert
(Extended Abstract, 7+2 min)

An Evaluation of Constraint-Based Approaches to Cumulative Scheduling with Delays
Antton Kasslin and Jeremias Berg
(Original Paper, 15+3 min)
Integer Linear Programming Preprocessing for Maximum Satisfiability
Jialu Zhang, Chu-Min Li, Sami Cherif, Shuolin Li and Zhifei Zheng
(Original Paper, 15+3 min)

Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas
Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky and Tony Tan
(Extended Abstract, 7+2 min)
16:00 - 16:30
Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize their Reusability
Manuel Chastenay, Xavier Zwingmann, Claude-Guy Quimper and Jonathan Gaudreault
(Extended Abstract, 7+2 min)

Improved Energetic Reasoning Checker for Cumulative Constraint with Profile
Rosaly Zoller Bodo Ngono, Yves Pascal Ndjopnang Wantiep and Roger Kameugne
(Original Paper, 15+3 min)
Symmetry Breaking in the Subgraph Isomorphism Problem
Joseph Loughney, Ruth Hoffmann and Mun See Chang
(Original Paper, 15+3 min)

Reencoding Unique Literal Clauses
Aeacus Sheng, Joseph Reeves and Marijn Heule
(Extended Abstract, 7+2 min)
16:30 - 17:00
Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs
Daniel Pekar and J. Christopher Beck
(Extended Abstract, 7+2 min)

Preemptive jobshop scheduling with maximum workload constraints
Tanguy Terrien and Cyrille Briand
(Original Paper, 15+3 min)
Modelling Multi-dimensional Arrays in Unified Planning
Carla Davesa Sureda, Joan Espasa Arxer, Ian Miguel and Mateu Villaret
(Original Paper, 15+3 min)

Learn to Unlearn
Florian Pollitt, Bernhard Gstrein, André Schidler, Mathias Fleury and Armin Biere
(Extended Abstract, 7+2 min)
17:00 - 19:30
19:30 - CP / SAT Doctoral Programme Dinner

Venue

The DP will be held at the University of Glasgow's Gilmorehill Campus in the west end of Glasgow, in the Boyd Orr Building and the James McCune Smith Learning Hub.

Diversity and Inclusion

The participants of the DP are encouraged to participate in the diversity and inclusion surveys organised by the conference.

Organization

                                                                                      
              Mun See Chang                             Katalin Fazekas
              University of St Andrews                  TU Wien
              School of Computer Science                Institute of Logic and Computation
              Homepage                                  Homepage