SOFT — PROGRAM
Days: Friday, 24 July 2026
Friday, 24 July 2026
09:00-10:00
Invited talk
Soft
Session Chair:
Location:
C3.02
| 09:00-10:00 |
Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities (abstract) 60 min
1 UCLouvain and Polytechnique Montréal
|
10:00-10:30
Coffee Break
Soft
Location:
C3.02
10:30-12:00
Session 1
Soft
Session Chair:
Location:
C3.02
| 10:30-11:00 |
On the use of ML and LLM for hard scheduling problems (abstract) 30 min
1 Airbus SAS
|
| 11:00-11:30 |
Learning Unified Graph and Language Representations for SMT Algorithm Selection (abstract) 30 min
1 University of Waterloo
2 University of Göttingen and CIDAS
3 Georgia Institute of Technology
|
| 11:30-12:00 |
Efficiently Solving Constraint Optimization Problems Using Learning-Based Techniques (abstract) 30 min
1 GREYC, CNRS, Normandie Univ, ENSICAEN, Universit\'e de Caen Normandie, Caen, France
2 TASC (LS2N-CNRS), IMT Atlantique, 44307, Nantes, France
|
12:00-14:00
Lunch
Soft
Location:
C3.02
14:00-15:30
Session 2
Soft
Session Chair:
Location:
C3.02
| 14:00-14:30 |
Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress) (abstract) 30 min
1 Technion & NVIDIA
|
| 14:30-15:00 |
Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization (abstract) 30 min
1 University of Copenhagen and Lund University
2 Shanghai University of Finance and Economics
3 Lund University and University of Copenhagen
4 Shanghai University of Finance and Economics and Huawei Taylor Lab
5 University of Auckland
|
| 15:00-15:30 |
Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT (abstract) 30 min
1 MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
2 Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France
|
15:30-16:00
Coffee Break
Soft
Location:
C3.02
16:00-17:30
Session 3
Soft
Session Chair:
Location:
C3.02
| 16:00-16:30 |
Fair Constraint Satisfaction: An Approximate Algorithm and Preliminary Results (abstract) 30 min
1 UPC Barcelona
|
| 16:30-17:00 |
Pseudo-Boolean Conflict Analysis (abstract) 30 min
1 University of Copenhagen and Lund University
2 Lund University and University of Copenhagen
3 Bool AI, Berlin
|
| 17:00-17:30 |
Quadratic Assignment Problems in Cost Function Networks (abstract) 30 min
1 INRAE Toulouse
2 IMT Atlantique
3 INRAE Paris-Saclay
|