29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 1-808, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Proceedings{yap:LIPIcs.CP.2023, title = {{LIPIcs, Volume 280, CP 2023, Complete Volume}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {1--808}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023}, URN = {urn:nbn:de:0030-drops-190365}, doi = {10.4230/LIPIcs.CP.2023}, annote = {Keywords: LIPIcs, Volume 280, CP 2023, Complete Volume} }
29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{yap:LIPIcs.CP.2023.0, author = {Yap, Roland H. C.}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.0}, URN = {urn:nbn:de:0030-drops-190372}, doi = {10.4230/LIPIcs.CP.2023.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Maria Garcia de la Banda. Beyond Optimal Solutions for Real-World Problems (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{garciadelabanda:LIPIcs.CP.2023.1, author = {Garcia de la Banda, Maria}, title = {{Beyond Optimal Solutions for Real-World Problems}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.1}, URN = {urn:nbn:de:0030-drops-190384}, doi = {10.4230/LIPIcs.CP.2023.1}, annote = {Keywords: Combinatorial optimisation systems, usability, trust, maintenance} }
Jimmy H.M. Lee. A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{lee:LIPIcs.CP.2023.2, author = {Lee, Jimmy H.M.}, title = {{A Tale of Two Cities: Teaching CP with Story-Telling}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.2}, URN = {urn:nbn:de:0030-drops-190395}, doi = {10.4230/LIPIcs.CP.2023.2}, annote = {Keywords: Constraint Programming, MOOCs, Fable-based Learning} }
Laurent Perron, Frédéric Didier, and Steven Gay. The CP-SAT-LP Solver (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{perron_et_al:LIPIcs.CP.2023.3, author = {Perron, Laurent and Didier, Fr\'{e}d\'{e}ric and Gay, Steven}, title = {{The CP-SAT-LP Solver}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {3:1--3:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.3}, URN = {urn:nbn:de:0030-drops-190405}, doi = {10.4230/LIPIcs.CP.2023.3}, annote = {Keywords: Constraint Programming, Operations Research, Sat Solver} }
Thomas Schiex. Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 4:1-4:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{schiex:LIPIcs.CP.2023.4, author = {Schiex, Thomas}, title = {{Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {4:1--4:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.4}, URN = {urn:nbn:de:0030-drops-190415}, doi = {10.4230/LIPIcs.CP.2023.4}, annote = {Keywords: graphical models, deep learning, constraint programming, cost function networks, random Markov fields, decision-focused learning, protein design} }
Petr Vilím. CP Solver Design for Maximum CPU Utilization (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, p. 5:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{vilim:LIPIcs.CP.2023.5, author = {Vil{\'\i}m, Petr}, title = {{CP Solver Design for Maximum CPU Utilization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {5:1--5:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.5}, URN = {urn:nbn:de:0030-drops-190425}, doi = {10.4230/LIPIcs.CP.2023.5}, annote = {Keywords: Constraint Programming, Software Design, Efficient Code} }
Younes Aalian, Gilles Pesant, and Michel Gamache. Optimization of Short-Term Underground Mine Planning Using Constraint Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{aalian_et_al:LIPIcs.CP.2023.6, author = {Aalian, Younes and Pesant, Gilles and Gamache, Michel}, title = {{Optimization of Short-Term Underground Mine Planning Using Constraint Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6}, URN = {urn:nbn:de:0030-drops-190430}, doi = {10.4230/LIPIcs.CP.2023.6}, annote = {Keywords: Mine planning, Constraint Programming, Short-term planning, Underground mine, Scheduling} }
Josep Alòs, Carlos Ansótegui, Josep M. Salvia, and Eduard Torres. Exploiting Configurations of MaxSAT Solvers. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{alos_et_al:LIPIcs.CP.2023.7, author = {Al\`{o}s, Josep and Ans\'{o}tegui, Carlos and Salvia, Josep M. and Torres, Eduard}, title = {{Exploiting Configurations of MaxSAT Solvers}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.7}, URN = {urn:nbn:de:0030-drops-190443}, doi = {10.4230/LIPIcs.CP.2023.7}, annote = {Keywords: maximum satisfiability, maxsat evaluation, automatic configuration} }
João Araújo, Choiwah Chow, and Mikoláš Janota. Symmetries for Cube-And-Conquer in Finite Model Finding. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{araujo_et_al:LIPIcs.CP.2023.8, author = {Ara\'{u}jo, Jo\~{a}o and Chow, Choiwah and Janota, Mikol\'{a}\v{s}}, title = {{Symmetries for Cube-And-Conquer in Finite Model Finding}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.8}, URN = {urn:nbn:de:0030-drops-190455}, doi = {10.4230/LIPIcs.CP.2023.8}, annote = {Keywords: finite model enumeration, cube-and-conquer, symmetry-breaking, parallel algorithm, least number heuristic} }
Gilles Audemard, Christophe Lecoutre, and Charles Prud'homme. Guiding Backtrack Search by Tracking Variables During Constraint Propagation. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{audemard_et_al:LIPIcs.CP.2023.9, author = {Audemard, Gilles and Lecoutre, Christophe and Prud'homme, Charles}, title = {{Guiding Backtrack Search by Tracking Variables During Constraint Propagation}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.9}, URN = {urn:nbn:de:0030-drops-190461}, doi = {10.4230/LIPIcs.CP.2023.9}, annote = {Keywords: Variable Ordering Heuristics, Variable Weighting} }
Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, and Christel Vrain. Incremental Constrained Clustering by Minimal Weighted Modification. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 10:1-10:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{beauchamp_et_al:LIPIcs.CP.2023.10, author = {Beauchamp, Aymeric and Dao, Thi-Bich-Hanh and Loudni, Samir and Vrain, Christel}, title = {{Incremental Constrained Clustering by Minimal Weighted Modification}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {10:1--10:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.10}, URN = {urn:nbn:de:0030-drops-190478}, doi = {10.4230/LIPIcs.CP.2023.10}, annote = {Keywords: Incremental constrained clustering, Constrained optimization problem, User feedback} }
Ignace Bleukx, Jo Devriendt, Emilio Gamba, Bart Bogaerts, and Tias Guns. Simplifying Step-Wise Explanation Sequences. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bleukx_et_al:LIPIcs.CP.2023.11, author = {Bleukx, Ignace and Devriendt, Jo and Gamba, Emilio and Bogaerts, Bart and Guns, Tias}, title = {{Simplifying Step-Wise Explanation Sequences}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.11}, URN = {urn:nbn:de:0030-drops-190489}, doi = {10.4230/LIPIcs.CP.2023.11}, annote = {Keywords: explanation, deduction, constraint programming, propagation} }
Yi Chu, Shaowei Cai, Chuan Luo, Zhendong Lei, and Cong Peng. Towards More Efficient Local Search for Pseudo-Boolean Optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chu_et_al:LIPIcs.CP.2023.12, author = {Chu, Yi and Cai, Shaowei and Luo, Chuan and Lei, Zhendong and Peng, Cong}, title = {{Towards More Efficient Local Search for Pseudo-Boolean Optimization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.12}, URN = {urn:nbn:de:0030-drops-190490}, doi = {10.4230/LIPIcs.CP.2023.12}, annote = {Keywords: Pseudo-Boolean Optimization, Stochastic Local Search, Scoring Function, Weighting Scheme} }
Vianney Coppé, Xavier Gillard, and Pierre Schaus. Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{coppe_et_al:LIPIcs.CP.2023.13, author = {Copp\'{e}, Vianney and Gillard, Xavier and Schaus, Pierre}, title = {{Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.13}, URN = {urn:nbn:de:0030-drops-190500}, doi = {10.4230/LIPIcs.CP.2023.13}, annote = {Keywords: Discrete Optimization, Decision Diagrams, Aggregate Dynamic Programming} }
Arnaud Deza, Chang Liu, Pashootan Vaezipoor, and Elias B. Khalil. Fast Matrix Multiplication Without Tears: A Constraint Programming Approach. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{deza_et_al:LIPIcs.CP.2023.14, author = {Deza, Arnaud and Liu, Chang and Vaezipoor, Pashootan and Khalil, Elias B.}, title = {{Fast Matrix Multiplication Without Tears: A Constraint Programming Approach}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.14}, URN = {urn:nbn:de:0030-drops-190518}, doi = {10.4230/LIPIcs.CP.2023.14}, annote = {Keywords: fast matrix multiplication, computer-assisted proofs, constraint programming, constraint satisfaction problem} }
Alexandre Dubray, Pierre Schaus, and Siegfried Nijssen. Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dubray_et_al:LIPIcs.CP.2023.15, author = {Dubray, Alexandre and Schaus, Pierre and Nijssen, Siegfried}, title = {{Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.15}, URN = {urn:nbn:de:0030-drops-190520}, doi = {10.4230/LIPIcs.CP.2023.15}, annote = {Keywords: Model Counting, Bayesian Networks, Probabilistic Networks} }
Yousra El Ghazi, Djamal Habet, and Cyril Terrioux. A CP Approach for the Liner Shipping Network Design Problem. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 16:1-16:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{elghazi_et_al:LIPIcs.CP.2023.16, author = {El Ghazi, Yousra and Habet, Djamal and Terrioux, Cyril}, title = {{A CP Approach for the Liner Shipping Network Design Problem}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {16:1--16:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.16}, URN = {urn:nbn:de:0030-drops-190532}, doi = {10.4230/LIPIcs.CP.2023.16}, annote = {Keywords: Constraint optimization problem, modeling, solving, industrial application} }
Arnoosh Golestanian, Giovanni Lo Bianco, Chengyu Tao, and J. Christopher Beck. Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{golestanian_et_al:LIPIcs.CP.2023.17, author = {Golestanian, Arnoosh and Bianco, Giovanni Lo and Tao, Chengyu and Beck, J. Christopher}, title = {{Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.17}, URN = {urn:nbn:de:0030-drops-190542}, doi = {10.4230/LIPIcs.CP.2023.17}, annote = {Keywords: Pickup and delivery, Dial-a-ride problem, Optimization} }
Christoph Jabs, Jeremias Berg, Hannes Ihalainen, and Matti Järvisalo. Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jabs_et_al:LIPIcs.CP.2023.18, author = {Jabs, Christoph and Berg, Jeremias and Ihalainen, Hannes and J\"{a}rvisalo, Matti}, title = {{Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.18}, URN = {urn:nbn:de:0030-drops-190553}, doi = {10.4230/LIPIcs.CP.2023.18}, annote = {Keywords: maximum satisfiability, multi-objective combinatorial optimization, preprocessing, redundancy} }
Carla Juvin, Emmanuel Hebrard, Laurent Houssin, and Pierre Lopez. An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{juvin_et_al:LIPIcs.CP.2023.19, author = {Juvin, Carla and Hebrard, Emmanuel and Houssin, Laurent and Lopez, Pierre}, title = {{An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.19}, URN = {urn:nbn:de:0030-drops-190568}, doi = {10.4230/LIPIcs.CP.2023.19}, annote = {Keywords: Constraint Programming, Scheduling, Preemptive Resources} }
Roger Kameugne, Sévérine Fetgo Betmbe, Thierry Noulamo, and Clémentin Tayou Djamegni. Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kameugne_et_al:LIPIcs.CP.2023.20, author = {Kameugne, Roger and Betmbe, S\'{e}v\'{e}rine Fetgo and Noulamo, Thierry and Djamegni, Cl\'{e}mentin Tayou}, title = {{Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.20}, URN = {urn:nbn:de:0030-drops-190574}, doi = {10.4230/LIPIcs.CP.2023.20}, annote = {Keywords: Horizontally Elastic Scheduling, Edge Finder Rule, Profile, TimeTable, Resource-Constrained Project Scheduling Problem} }
Matthias Klapperstueck, Frits de Nijs, Ilankaikone Senthooran, Jack Lee-Kopij, Maria Garcia de la Banda, and Michael Wybrow. Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert Views. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{klapperstueck_et_al:LIPIcs.CP.2023.21, author = {Klapperstueck, Matthias and de Nijs, Frits and Senthooran, Ilankaikone and Lee-Kopij, Jack and Garcia de la Banda, Maria and Wybrow, Michael}, title = {{Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert Views}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.21}, URN = {urn:nbn:de:0030-drops-190584}, doi = {10.4230/LIPIcs.CP.2023.21}, annote = {Keywords: Facility Location, Hydrogen Supply Chain, Human-Centric Optimisation} }
Petr Kučera. Binary Constraint Trees and Structured Decomposability. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kucera:LIPIcs.CP.2023.22, author = {Ku\v{c}era, Petr}, title = {{Binary Constraint Trees and Structured Decomposability}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {22:1--22:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.22}, URN = {urn:nbn:de:0030-drops-190595}, doi = {10.4230/LIPIcs.CP.2023.22}, annote = {Keywords: Binary CSP, Binary Constraint Tree, Structured Decomposability, Strucured DNNF, Polynomial Equivalence} }
Ryo Kuroiwa and J. Christopher Beck. Large Neighborhood Beam Search for Domain-Independent Dynamic Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 23:1-23:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kuroiwa_et_al:LIPIcs.CP.2023.23, author = {Kuroiwa, Ryo and Beck, J. Christopher}, title = {{Large Neighborhood Beam Search for Domain-Independent Dynamic Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {23:1--23:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.23}, URN = {urn:nbn:de:0030-drops-190605}, doi = {10.4230/LIPIcs.CP.2023.23}, annote = {Keywords: Large Neighborhood Search, Dynamic Programming, State Space Search, Combinatorial Optimization} }
Steve Malalel, Arnaud Malapert, Marie Pelleau, and Jean-Charles Régin. MDD Archive for Boosting the Pareto Constraint. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{malalel_et_al:LIPIcs.CP.2023.24, author = {Malalel, Steve and Malapert, Arnaud and Pelleau, Marie and R\'{e}gin, Jean-Charles}, title = {{MDD Archive for Boosting the Pareto Constraint}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.24}, URN = {urn:nbn:de:0030-drops-190610}, doi = {10.4230/LIPIcs.CP.2023.24}, annote = {Keywords: Constraint Programming, Global Constraint, MDD, Multi-Objective Problem, Pareto Constraint} }
Tom Marty, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, and Quentin Cappart. Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 25:1-25:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{marty_et_al:LIPIcs.CP.2023.25, author = {Marty, Tom and Fran\c{c}ois, Tristan and Tessier, Pierre and Gautier, Louis and Rousseau, Louis-Martin and Cappart, Quentin}, title = {{Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {25:1--25:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.25}, URN = {urn:nbn:de:0030-drops-190625}, doi = {10.4230/LIPIcs.CP.2023.25}, annote = {Keywords: Branching heuristic, Deep reinforcement learning} }
Matthew J. McIlree and Ciaran McCreesh. Proof Logging for Smart Extensional Constraints. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{mcilree_et_al:LIPIcs.CP.2023.26, author = {McIlree, Matthew J. and McCreesh, Ciaran}, title = {{Proof Logging for Smart Extensional Constraints}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.26}, URN = {urn:nbn:de:0030-drops-190633}, doi = {10.4230/LIPIcs.CP.2023.26}, annote = {Keywords: Constraint programming, proof logging, extensional constraints} }
Gioni Mexi, Timo Berthold, Ambros Gleixner, and Jakob Nordström. Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{mexi_et_al:LIPIcs.CP.2023.27, author = {Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Nordstr\"{o}m, Jakob}, title = {{Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {27:1--27:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.27}, URN = {urn:nbn:de:0030-drops-190641}, doi = {10.4230/LIPIcs.CP.2023.27}, annote = {Keywords: Integer programming, pseudo-Boolean solving, conflict analysis, cutting planes proof system, mixed integer rounding, division, saturation} }
Xiao Peng and Christine Solnon. Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{peng_et_al:LIPIcs.CP.2023.28, author = {Peng, Xiao and Solnon, Christine}, title = {{Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.28}, URN = {urn:nbn:de:0030-drops-190650}, doi = {10.4230/LIPIcs.CP.2023.28}, annote = {Keywords: Benzenoid Generation Problem, Canonical Code, Hexagon Graph} }
Guillaume Perez, Gaël Glorian, Wijnand Suijlen, and Arnaud Lallouet. Distribution Optimization in Constraint Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 29:1-29:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{perez_et_al:LIPIcs.CP.2023.29, author = {Perez, Guillaume and Glorian, Ga\"{e}l and Suijlen, Wijnand and Lallouet, Arnaud}, title = {{Distribution Optimization in Constraint Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {29:1--29:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.29}, URN = {urn:nbn:de:0030-drops-190664}, doi = {10.4230/LIPIcs.CP.2023.29}, annote = {Keywords: Constraint Programming, Optimization, Stochastic Optimization} }
Nikolaos Ploskas, Kostas Stergiou, and Dimosthenis C. Tsouros. The p-Dispersion Problem with Distance Constraints. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 30:1-30:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{ploskas_et_al:LIPIcs.CP.2023.30, author = {Ploskas, Nikolaos and Stergiou, Kostas and Tsouros, Dimosthenis C.}, title = {{The p-Dispersion Problem with Distance Constraints}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {30:1--30:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.30}, URN = {urn:nbn:de:0030-drops-190679}, doi = {10.4230/LIPIcs.CP.2023.30}, annote = {Keywords: Facility location, distance constraints, optimization} }
Guillaume Povéda, Nahum Alvarez, and Christian Artigues. Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 31:1-31:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{poveda_et_al:LIPIcs.CP.2023.31, author = {Pov\'{e}da, Guillaume and Alvarez, Nahum and Artigues, Christian}, title = {{Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {31:1--31:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.31}, URN = {urn:nbn:de:0030-drops-190689}, doi = {10.4230/LIPIcs.CP.2023.31}, annote = {Keywords: Large-scale scheduling problem, partial preemption, multi-skill, multi-mode, resource calendars, constraint programming, large neighborhood search} }
Stéphanie Roussel, Thomas Polacsek, and Anouck Chan. Assembly Line Preliminary Design Optimization for an Aircraft. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 32:1-32:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{roussel_et_al:LIPIcs.CP.2023.32, author = {Roussel, St\'{e}phanie and Polacsek, Thomas and Chan, Anouck}, title = {{Assembly Line Preliminary Design Optimization for an Aircraft}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {32:1--32:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.32}, URN = {urn:nbn:de:0030-drops-190690}, doi = {10.4230/LIPIcs.CP.2023.32}, annote = {Keywords: Assembly line design, Constraint Programming, Multi-objective, Industry 4.0} }
Pouya Shati, Eldan Cohen, and Sheila McIlraith. SAT-Based Learning of Compact Binary Decision Diagrams for Classification. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 33:1-33:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{shati_et_al:LIPIcs.CP.2023.33, author = {Shati, Pouya and Cohen, Eldan and McIlraith, Sheila}, title = {{SAT-Based Learning of Compact Binary Decision Diagrams for Classification}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.33}, URN = {urn:nbn:de:0030-drops-190700}, doi = {10.4230/LIPIcs.CP.2023.33}, annote = {Keywords: Binary Decision Diagram, Classification, Compactness, Numeric Data, MaxSAT} }
Pierre Talbot, Tingting Hu, and Nicolas Navet. Constraint Programming with External Worst-Case Traversal Time Analysis. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 34:1-34:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{talbot_et_al:LIPIcs.CP.2023.34, author = {Talbot, Pierre and Hu, Tingting and Navet, Nicolas}, title = {{Constraint Programming with External Worst-Case Traversal Time Analysis}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {34:1--34:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.34}, URN = {urn:nbn:de:0030-drops-190713}, doi = {10.4230/LIPIcs.CP.2023.34}, annote = {Keywords: Constraint programming, external function, multi-objective optimization, network analysis, worst-case traversal time analysis, abstract interpretation} }
Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman. Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 35:1-35:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{trinh_et_al:LIPIcs.CP.2023.35, author = {Trinh, Van-Giang and Benhamou, Belaid and Soliman, Sylvain}, title = {{Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {35:1--35:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.35}, URN = {urn:nbn:de:0030-drops-190720}, doi = {10.4230/LIPIcs.CP.2023.35}, annote = {Keywords: Computational systems biology, Boolean network, Fixed point, Answer set programming} }
Dimosthenis C. Tsouros, Senne Berden, and Tias Guns. Guided Bottom-Up Interactive Constraint Acquisition. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 36:1-36:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{tsouros_et_al:LIPIcs.CP.2023.36, author = {Tsouros, Dimosthenis C. and Berden, Senne and Guns, Tias}, title = {{Guided Bottom-Up Interactive Constraint Acquisition}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {36:1--36:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.36}, URN = {urn:nbn:de:0030-drops-190734}, doi = {10.4230/LIPIcs.CP.2023.36}, annote = {Keywords: Constraint acquisition, Constraint learning, Active learning, Modelling} }
Sameela Suharshani Wijesundara, Maria Garcia de la Banda, and Guido Tack. Addressing Problem Drift in UNHCR Fund Allocation. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{wijesundara_et_al:LIPIcs.CP.2023.37, author = {Wijesundara, Sameela Suharshani and Garcia de la Banda, Maria and Tack, Guido}, title = {{Addressing Problem Drift in UNHCR Fund Allocation}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.37}, URN = {urn:nbn:de:0030-drops-190740}, doi = {10.4230/LIPIcs.CP.2023.37}, annote = {Keywords: Fund Allocation, Problem Drift, Domain Specific Languages, MiniZinc} }
Jinqiang Yu, Alexey Ignatiev, and Peter J. Stuckey. From Formal Boosted Tree Explanations to Interpretable Rule Sets. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 38:1-38:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{yu_et_al:LIPIcs.CP.2023.38, author = {Yu, Jinqiang and Ignatiev, Alexey and Stuckey, Peter J.}, title = {{From Formal Boosted Tree Explanations to Interpretable Rule Sets}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {38:1--38:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.38}, URN = {urn:nbn:de:0030-drops-190758}, doi = {10.4230/LIPIcs.CP.2023.38}, annote = {Keywords: Decision set, interpretable model, gradient boosted tree, BT compilation} }
Tianwei Zhang and Stefan Szeider. Searching for Smallest Universal Graphs and Tournaments with SAT. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 39:1-39:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{zhang_et_al:LIPIcs.CP.2023.39, author = {Zhang, Tianwei and Szeider, Stefan}, title = {{Searching for Smallest Universal Graphs and Tournaments with SAT}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {39:1--39:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.39}, URN = {urn:nbn:de:0030-drops-190760}, doi = {10.4230/LIPIcs.CP.2023.39}, annote = {Keywords: Constrained-based combinatorics, synthesis problems, symmetry breaking, SAT solving, subgraph isomorphism, tournament, directed graphs} }
Kexin Zheng, Ang Li, Han Zhang, and T. K. Satish Kumar. FastMapSVM for Predicting CSP Satisfiability. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 40:1-40:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{zheng_et_al:LIPIcs.CP.2023.40, author = {Zheng, Kexin and Li, Ang and Zhang, Han and Kumar, T. K. Satish}, title = {{FastMapSVM for Predicting CSP Satisfiability}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.40}, URN = {urn:nbn:de:0030-drops-190775}, doi = {10.4230/LIPIcs.CP.2023.40}, annote = {Keywords: Constraint Satisfaction Problems, Machine Learning, FastMapSVM} }
Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, and Minghao Yin. Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 41:1-41:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{zhou_et_al:LIPIcs.CP.2023.41, author = {Zhou, Wenbo and Zhao, Yujiao and Wang, Yiyuan and Cai, Shaowei and Wang, Shimao and Wang, Xinyu and Yin, Minghao}, title = {{Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {41:1--41:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.41}, URN = {urn:nbn:de:0030-drops-190784}, doi = {10.4230/LIPIcs.CP.2023.41}, annote = {Keywords: Local Search, Pseudo-Boolean Optimization, Deep Optimization} }
Vincent Barbosa Vaz, James Bailey, Christopher Leckie, and Peter J. Stuckey. Predict-Then-Optimise Strategies for Water Flow Control (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 42:1-42:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{barbosavaz_et_al:LIPIcs.CP.2023.42, author = {Barbosa Vaz, Vincent and Bailey, James and Leckie, Christopher and J. Stuckey, Peter}, title = {{Predict-Then-Optimise Strategies for Water Flow Control}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {42:1--42:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.42}, URN = {urn:nbn:de:0030-drops-190795}, doi = {10.4230/LIPIcs.CP.2023.42}, annote = {Keywords: Water Flow Control, Optimization, Machine Learning} }
Kyle E. C. Booth. Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 43:1-43:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{booth:LIPIcs.CP.2023.43, author = {Booth, Kyle E. C.}, title = {{Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {43:1--43:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.43}, URN = {urn:nbn:de:0030-drops-190805}, doi = {10.4230/LIPIcs.CP.2023.43}, annote = {Keywords: Qubit routing, quantum computing, constraint programming, combinatorial optimization} }
Manuel Combarro Simón, Pierre Talbot, Grégoire Danoy, Jedrzej Musial, Mohammed Alswaitti, and Pascal Bouvry. Constraint Model for the Satellite Image Mosaic Selection Problem (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 44:1-44:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{combarrosimon_et_al:LIPIcs.CP.2023.44, author = {Combarro Sim\'{o}n, Manuel and Talbot, Pierre and Danoy, Gr\'{e}goire and Musial, Jedrzej and Alswaitti, Mohammed and Bouvry, Pascal}, title = {{Constraint Model for the Satellite Image Mosaic Selection Problem}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {44:1--44:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.44}, URN = {urn:nbn:de:0030-drops-190815}, doi = {10.4230/LIPIcs.CP.2023.44}, annote = {Keywords: constraint modeling, satellite imaging, set covering, polygon covering} }
Nicolas Golenvaux, Xavier Gillard, Siegfried Nijssen, and Pierre Schaus. Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 45:1-45:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{golenvaux_et_al:LIPIcs.CP.2023.45, author = {Golenvaux, Nicolas and Gillard, Xavier and Nijssen, Siegfried and Schaus, Pierre}, title = {{Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {45:1--45:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.45}, URN = {urn:nbn:de:0030-drops-190825}, doi = {10.4230/LIPIcs.CP.2023.45}, annote = {Keywords: Regionalization, Redcap, Skater, Multivalued Decision Diagrams} }
Chungjae Lee, Wirattawut Boonbandansook, Vahid Eghbal Akhlaghi, Kevin Dalmeijer, and Pascal Van Hentenryck. Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 46:1-46:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{lee_et_al:LIPIcs.CP.2023.46, author = {Lee, Chungjae and Boonbandansook, Wirattawut and Akhlaghi, Vahid Eghbal and Dalmeijer, Kevin and Van Hentenryck, Pascal}, title = {{Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {46:1--46:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.46}, URN = {urn:nbn:de:0030-drops-190835}, doi = {10.4230/LIPIcs.CP.2023.46}, annote = {Keywords: Constraint Programming, Autonomous Trucking, Tranfer Hub Network} }
Renee Mirka, Laura Greenstreet, Marc Grimson, and Carla P. Gomes. A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 47:1-47:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{mirka_et_al:LIPIcs.CP.2023.47, author = {Mirka, Renee and Greenstreet, Laura and Grimson, Marc and Gomes, Carla P.}, title = {{A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {47:1--47:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.47}, URN = {urn:nbn:de:0030-drops-190849}, doi = {10.4230/LIPIcs.CP.2023.47}, annote = {Keywords: Spatially balanced Latin squares, partially spatially balanced Latin rectangles, minimum edge weight clique, combinatorial optimization, mixed integer programming, imbalance, cliques} }
Vaidyanathan Peruvemba Ramaswamy and Stefan Szeider. Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 48:1-48:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{peruvembaramaswamy_et_al:LIPIcs.CP.2023.48, author = {Peruvemba Ramaswamy, Vaidyanathan and Szeider, Stefan}, title = {{Proven Optimally-Balanced Latin Rectangles with SAT}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {48:1--48:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.48}, URN = {urn:nbn:de:0030-drops-190855}, doi = {10.4230/LIPIcs.CP.2023.48}, annote = {Keywords: combinatorial design, SAT encodings, certified optimality, arithmetic constraints, spatially balanced Latin rectangles} }
Andreas Plank, Sibylle Möhle, and Martina Seidl. Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 49:1-49:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{plank_et_al:LIPIcs.CP.2023.49, author = {Plank, Andreas and M\"{o}hle, Sibylle and Seidl, Martina}, title = {{Enumerative Level-2 Solution Counting for Quantified Boolean Formulas}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {49:1--49:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.49}, URN = {urn:nbn:de:0030-drops-190867}, doi = {10.4230/LIPIcs.CP.2023.49}, annote = {Keywords: QBF, Second-Level Model Counting} }
Feedback for Dagstuhl Publishing