CP/SAT Doctoral Program 2026

July 18-19, 2026, Lisbon, Portugal

News

Call for Doctoral Program Submissions

The Joint CP/SAT Doctoral Program (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 (July 18-19, 2026). The exact schedule is yet to be confirmed, but the currently planned structure of its content is outlined as follows:

Important Dates (anywhere on earth)

Abstract Deadline: May 5 7, 2026

Submission Deadline: May 12 14, 2026

Deadline for financial support requests: May 19, 2026

Review Deadline: May 28, 2026

Discussion: May 28 to June 1, 2026

Notification: June 2, 2026

Notification of Financial Support: June 2, 2026

Deadline of Camera Ready paper: June 9, 2026

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 2026 or SAT 2026 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 and extended abstracts must follow the LIPIcs guidelines of the main conferences and be in PDF format.

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 the FLoC 2026 submission system by selecting “New Submission” at https://submissions.floc26.org/dpcp/.

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 may be available to cover conference-related costs, such as registration fees, accommodation, and travel expenses. Decisions will be made on a case-by-case basis. Priority will be given to doctoral students who would otherwise be unable to attend the conference. To apply, students should submit:

Both documents should be sent by email to cpsatdp @ cs.uni-freiburg.de no later than May 19, 2026.

Program

Poster Sessions: Monday, 20th July, 10:00 - 10:30 & 16:00 - 17:00.
Time Saturday, 18th July Sunday, 19th July
09:00 - 10:00
Opening
André Schidler, Mohamed Siala

Student Talks
Chair: André Schidler

Reasoning about Constraint Formulations in Lean
Pablo Manrique, Stefan Szeider
Original Paper (10+3 min.)

Towards Continuous Constraint Programming for Sound Neural Network Verification
Yi-Nung Tsao, Pierre Talbot
Original Paper (10+3 min.)

Instance Space Analysis and Complexity Estimation for Scheduling Problems
Isabel Catalá Fort, Christian Pérez, Unai López, Miguel A. Salido
Extended Abstract (5+2 min.)

Invited Talk

KnowledgeCentric AI for Scientific Discovery
Carla P. Gomes

Student Talks

Cardinality Constraints are Hard for Resolution
Ion Mikel Liberal, Ilario Bonacina, Jordi Levy
Original Paper (10+3 min.)

10:00 - 11:00 Coffee Break Coffee Break
11:00 - 12:30

Chair: Arijit Shaw

A toolbox for hybrid metaheuristics: use cases
Khalil CHRIT, Pedro Patinho, Jean-François Baffier, Salvador Abreu
Original Paper (10+3 min.)

Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence
Hannah Van Santvliet, Ronald de Haan
Original Paper (10+3 min.)

Formal Verification of WebAssembly via LLVM IR
Aadil Riaz Sattar
Original Paper (10+3 min.)

An Offline Neuro-Symbolic Soccer Pattern Retrieval Approach Using Constraint Programming
Augustin Crespin, Pierre Schaus
Extended Abstract (5+2 min.)

An Automata-Based Constraint Programming Framework for Optimal Classical Planning
Damien Van Meerbeeck, Arnaud Lequen, Gilles Pesant, Jendrik Seipp
Extended Abstract (5+2 min.)

Satisfiability for Large Weight Syndrome Decoding
Carl Berton, Sami Cherif, Claire Delaplace
Extended Abstract (5+2 min.)

Constraint Programming for Curriculum-based High School Timetabling with Half-Blocks
Bérénice Dubois, Quentin Cappart, Stephen Walsh
Extended Abstract (5+2 min.)

Solving the Multiple Constant Multiplication Problem with Constraint Programming
Théo Cantaloube, Xiao Peng, Christine Solnon, Anastasia Volkova
Extended Abstract (5+2 min.)

Chair: Zachary Battleman

Constraint Solving with Quantum Annealing
Tristan Nuck, Sven Löffler, Petra Hofstedt
Original Paper (10+3 min.)

Towards Bound Consistency for the No-Overlap Constraint Using MDDs
Amaury Guichard, Laurent Michel, Hélène Verhaeghe, Pierre Schaus
Original Paper (10+3 min.)

Towards Distributed Constraint Solving with CRDT
Hakan Hasan, Pierre Talbot
Original Paper (10+3 min.)

Generalised Predicates in Lazy Clause Generation using Global Propagation
Julius Gvozdiovas, Emir Demirović
Original Paper (10+3 min.)

GRID: Graph-based Modelling Interface for Domain-Independent Dynamic Programming
Fabio Giordana, Zeynep Kiziltan, Ryo Kuroiwa
Extended Abstract (5+2 min.)

Augmenting the Cumulative Overload Check with Integral Resource Usage Reasoning
Samuel Cloutier, Claude-Guy Quimper
Extended Abstract (5+2 min.)

The Distance Constraint on Sequence Variables
Margaux Schmied, Augustin Delecluse, Jean-Charles Régin, Pierre Schaus
Extended Abstract (5+2 min.)

Linear-Memory Beam Search Algorithms in Domain-Independent Dynamic Programming
Yuxiao Chen, J. Christopher Beck
Extended Abstract (5+2 min.)

12:30 - 14:00 Lunch Break Lunch Break
14:00 - 15:30

Invited Talk

Research-to-Production: A Dual Academic-Industry Perspective on Enterprise AI
Serdar Kadıoğlu

Student Talks

Cardinality Cuts And Saturation
Jake Anderson, Marc Vinyals, Massimo Lauria, Wietze Koops
Original Paper (10+3 min.)

Synthesizing Feature Extractors of Algorithm Selection for Constraint Optimization
Hai Xia, Carlos Ansótegui, Stefan Szeider
Original Paper (10+3 min.)

Using reinforcement learning for constraint solving
Yoan Thomas
Original Paper (10+3 min.)

Not All Restarts Are Equal: MAB-Learning at the Right Time Scale for SAT
Jinghu LIANG, Sami Cherif, Chu-Min Li
Extended Abstract (5+2 min.)

Invited Talk

Responsible Use of Generative AI Tools in Research
Zeynep Kiziltan

Student Talks

Exploring Toda's Theorem as a QBF Solver
Gad E. Yaron, Dror Fried, Etay Segal
Original Paper (10+3 min.)

Scalable Computation of Abductive Explanations for Tree Ensembles
Teemu Koukkari, Jeremias Berg
Original Paper (10+3 min.)

15:30 - 16:30 Coffee Break Coffee Break
16:30 - 18:00
NobleCount: Revisiting a Forgotten Data Structure for Local Search in SAT
Yogev Shalmon, Alexander Nadel, Ofer Strichman
Original Paper (10+3 min.)

Efficient Volume Computation for SMT Formulas
Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel
Original Paper (10+3 min.)

Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT
Jialu Zhang, Chu-Min Li, Sami Cherif, Shuolin Li
Extended Abstract (5+2 min.)

Learning Unified Graph and Language Representations for SMT Algorithm Selection
Zhengyang Lu, Paul Sarnighausen-Cahn, Jiahao Chen, Arie Gurfinkel, Florin Manea, Vijay Ganesh
Extended Abstract (5+2 min.)

Revisiting GlucosER in a Modern Solver
Zachary Battleman, Florian Pollitt, Mathias Fleury, Yakir Vizel, Marijn J. H. Heule, Armin Biere, Randal E. Bryant
Extended Abstract (5+2 min.)

CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem.
Emma Legrand, Roger Kameugne, Pierre Schaus
Original Paper (10+3 min.)

Interactive hierarchical explanations in constraint solving
Wout Piessens, Ignace Bleukx, Tias Guns
Original Paper (10+3 min.)

Towards Smaller Explanations for Detectable Precedences in the Disjunctive Constraint
Andrei Ioniță, Imko Marijnissen, Emir Demirović
Original Paper (10+3 min.)

DSGNN: A Dual-Backbone Graph Surrogate for Makespan Prediction in Scheduling Problem
Alex Jimenez Medina
Original Paper (10+3 min.)

Modeling the p-dispersion problem with distance constraints
Panteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou, Dimosthenis C. Tsouros
Extended Abstract (5+2 min.)

On the Self-Stabilization of Dijkstra's Asynchronous Token Circulation
Asma Khoualdia, Sami Cherif, Stéphane Devismes, Léo Robert
Extended Abstract (5+2 min.)

Neurosymbolic Large Neighbourhood Search
Arnaud Delage-Reid, Gilles Pesant, Amal Zouaq
Extended Abstract (5+2 min.)

End-to-End Certified Graph Colouring
Wietze Koops, Simon Dold, George Katsirelos, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan
Extended Abstract (5+2 min.)

19:00-20:00

Reception

Location: giro' giro'
Casa Raul Lino, Jardim do Campo Grande Sul, 1700-094 Lisboa, Portugal

Venue

Room C1.03 - Behind the check-in counters.

Organization

                                                                                      
              André Schidler                            Mohamed Siala                             
              University of Freiburg                    INSA Toulouse and LAAS-CNRS               
              Chair of Computer Architecture            ROC Group                                 
              Homepage                                  Homepage