The following papers will be presented at the 31st International Conference on Principles and Practice of Constraint Programming (CP'25):

  • Reducing Quantum Circuit Synthesis to #SAT
    Alfons Laarman, Dekel Zak, Jean-Marie Lagniez, Jingyi Mei

  • Practically Feasible Proof Logging for Pseudo-Boolean Optimization
    Andy Oertel, Daniel Le Berre, Jakob Nordström, Magnus O. Myreen, Marc Vinyals, Wietze Koops, Yong Kiam Tan

  • Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: a Constraint Programming Approach
    Christophe Lecoutre, Duc Anh Le, Stéphanie Roussel

The following paper will be presented at the 28th International Conference on Theory and Applications of Satisfiability Testing (SAT'25):

  • SAT-based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints
    Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura