28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 1-692, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{solnon:LIPIcs.CP.2022, title = {{LIPIcs, Volume 235, CP 2022, Complete Volume}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {1--692}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022}, URN = {urn:nbn:de:0030-drops-166285}, doi = {10.4230/LIPIcs.CP.2022}, annote = {Keywords: LIPIcs, Volume 235, CP 2022, Complete Volume} }
28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{solnon:LIPIcs.CP.2022.0, author = {Solnon, Christine}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.0}, URN = {urn:nbn:de:0030-drops-166292}, doi = {10.4230/LIPIcs.CP.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Donald E. Knuth. All Questions Answered (Invited Talk). In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{knuth:LIPIcs.CP.2022.1, author = {Knuth, Donald E.}, title = {{All Questions Answered}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.1}, URN = {urn:nbn:de:0030-drops-166305}, doi = {10.4230/LIPIcs.CP.2022.1}, annote = {Keywords: The Art of Computer Programming} }
Kristina Asimi, Libor Barto, and Silvia Butti. Fixed-Template Promise Model Checking Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{asimi_et_al:LIPIcs.CP.2022.2, author = {Asimi, Kristina and Barto, Libor and Butti, Silvia}, title = {{Fixed-Template Promise Model Checking Problems}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.2}, URN = {urn:nbn:de:0030-drops-166310}, doi = {10.4230/LIPIcs.CP.2022.2}, annote = {Keywords: Model Checking Problem, First-Order Logic, Promise Constraint Satisfaction Problem, Multi-Homomorphism} }
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik. Improved Sample Complexity Bounds for Branch-And-Cut. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balcan_et_al:LIPIcs.CP.2022.3, author = {Balcan, Maria-Florina and Prasad, Siddharth and Sandholm, Tuomas and Vitercik, Ellen}, title = {{Improved Sample Complexity Bounds for Branch-And-Cut}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {3:1--3:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.3}, URN = {urn:nbn:de:0030-drops-166321}, doi = {10.4230/LIPIcs.CP.2022.3}, annote = {Keywords: Automated algorithm configuration, integer programming, machine learning theory, tree search, branch-and-bound, branch-and-cut, cutting planes, sample complexity, generalization guarantees, data-driven algorithm design} }
Libor Barto and Silvia Butti. Weisfeiler-Leman Invariant Promise Valued CSPs. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barto_et_al:LIPIcs.CP.2022.4, author = {Barto, Libor and Butti, Silvia}, title = {{Weisfeiler-Leman Invariant Promise Valued CSPs}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {4:1--4:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.4}, URN = {urn:nbn:de:0030-drops-166332}, doi = {10.4230/LIPIcs.CP.2022.4}, annote = {Keywords: Promise Valued Constraint Satisfaction Problem, Linear programming relaxation, Distributed algorithms, Symmetric fractional polymorphisms, Color refinement algorithm} }
Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, and T. K. Satish Kumar. Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{basrur_et_al:LIPIcs.CP.2022.5, author = {Basrur, Chaithanya and Singh, Arambam James and Sinha, Arunesh and Kumar, Akshat and Kumar, T. K. Satish}, title = {{Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.5}, URN = {urn:nbn:de:0030-drops-166341}, doi = {10.4230/LIPIcs.CP.2022.5}, annote = {Keywords: Multi-Agent Path Coordination, Maritime Traffic Control} }
Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, and Claude-Guy Quimper. Acquiring Maps of Interrelated Conjectures on Sharp Bounds. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{beldiceanu_et_al:LIPIcs.CP.2022.6, author = {Beldiceanu, Nicolas and Cheukam-Ngouonou, Jovial and Douence, R\'{e}mi and Gindullin, Ramiz and Quimper, Claude-Guy}, title = {{Acquiring Maps of Interrelated Conjectures on Sharp Bounds}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.6}, URN = {urn:nbn:de:0030-drops-166353}, doi = {10.4230/LIPIcs.CP.2022.6}, annote = {Keywords: Acquisition of conjectures, digraphs, bounds} }
Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, and Simon de Givry. Parallel Hybrid Best-First Search. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 7:1-7:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{beldjilali_et_al:LIPIcs.CP.2022.7, author = {Beldjilali, Abdelkader and Montalbano, Pierre and Allouche, David and Katsirelos, George and de Givry, Simon}, title = {{Parallel Hybrid Best-First Search}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {7:1--7:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.7}, URN = {urn:nbn:de:0030-drops-166362}, doi = {10.4230/LIPIcs.CP.2022.7}, annote = {Keywords: Combinatorial Optimization, Parallel Branch-and-Bound, CFN} }
Senne Berden, Mohit Kumar, Samuel Kolb, and Tias Guns. Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{berden_et_al:LIPIcs.CP.2022.8, author = {Berden, Senne and Kumar, Mohit and Kolb, Samuel and Guns, Tias}, title = {{Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.8}, URN = {urn:nbn:de:0030-drops-166373}, doi = {10.4230/LIPIcs.CP.2022.8}, annote = {Keywords: Machine learning, constraint learning, MAX-SAT} }
Christian Bessiere, Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard. Complexity of Minimum-Size Arc-Inconsistency Explanations. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bessiere_et_al:LIPIcs.CP.2022.9, author = {Bessiere, Christian and Carbonnel, Cl\'{e}ment and Cooper, Martin C. and Hebrard, Emmanuel}, title = {{Complexity of Minimum-Size Arc-Inconsistency Explanations}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.9}, URN = {urn:nbn:de:0030-drops-166380}, doi = {10.4230/LIPIcs.CP.2022.9}, annote = {Keywords: Constraint programming, constraint propagation, minimum explanations, complexity} }
Raphaël Boudreault, Vanessa Simard, Daniel Lafond, and Claude-Guy Quimper. A Constraint Programming Approach to Ship Refit Project Scheduling. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{boudreault_et_al:LIPIcs.CP.2022.10, author = {Boudreault, Rapha\"{e}l and Simard, Vanessa and Lafond, Daniel and Quimper, Claude-Guy}, title = {{A Constraint Programming Approach to Ship Refit Project Scheduling}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.10}, URN = {urn:nbn:de:0030-drops-166396}, doi = {10.4230/LIPIcs.CP.2022.10}, annote = {Keywords: Ship refit, planning, project management, constraint programming, scheduling, optimization, resource-constrained project scheduling problem} }
Clément Carbonnel. On Redundancy in Constraint Satisfaction Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{carbonnel:LIPIcs.CP.2022.11, author = {Carbonnel, Cl\'{e}ment}, title = {{On Redundancy in Constraint Satisfaction Problems}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.11}, URN = {urn:nbn:de:0030-drops-166409}, doi = {10.4230/LIPIcs.CP.2022.11}, annote = {Keywords: Constraint satisfaction problem, redundancy, universal algebra, extremal combinatorics} }
Mohamed Sami Cherif, Djamal Habet, and Matthieu Py. From Crossing-Free Resolution to Max-SAT Resolution. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cherif_et_al:LIPIcs.CP.2022.12, author = {Cherif, Mohamed Sami and Habet, Djamal and Py, Matthieu}, title = {{From Crossing-Free Resolution to Max-SAT Resolution}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.12}, URN = {urn:nbn:de:0030-drops-166412}, doi = {10.4230/LIPIcs.CP.2022.12}, annote = {Keywords: Satisfiability, Proof, Max-SAT Resolution} }
Martin C. Cooper, Arnaud Lequen, and Frédéric Maris. Isomorphisms Between STRIPS Problems and Sub-Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cooper_et_al:LIPIcs.CP.2022.13, author = {Cooper, Martin C. and Lequen, Arnaud and Maris, Fr\'{e}d\'{e}ric}, title = {{Isomorphisms Between STRIPS Problems and Sub-Problems}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.13}, URN = {urn:nbn:de:0030-drops-166426}, doi = {10.4230/LIPIcs.CP.2022.13}, annote = {Keywords: planning, isomorphism, complexity, constraint propagation} }
Vianney Coppé, Xavier Gillard, and Pierre Schaus. Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{coppe_et_al:LIPIcs.CP.2022.14, author = {Copp\'{e}, Vianney and Gillard, Xavier and Schaus, Pierre}, title = {{Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.14}, URN = {urn:nbn:de:0030-drops-166433}, doi = {10.4230/LIPIcs.CP.2022.14}, annote = {Keywords: Discrete Optimization, Mixed-Integer Programming, Decision Diagrams, Constrained Single-Row Facility Layout Problem} }
Christopher Coulombe and Claude-Guy Quimper. Constraint Acquisition Based on Solution Counting. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{coulombe_et_al:LIPIcs.CP.2022.15, author = {Coulombe, Christopher and Quimper, Claude-Guy}, title = {{Constraint Acquisition Based on Solution Counting}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.15}, URN = {urn:nbn:de:0030-drops-166449}, doi = {10.4230/LIPIcs.CP.2022.15}, annote = {Keywords: Constraint acquisition, CSP, Model counting, Solution counting} }
Ágnes Cseh, Guillaume Escamocher, and Luis Quesada. Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cseh_et_al:LIPIcs.CP.2022.16, author = {Cseh, \'{A}gnes and Escamocher, Guillaume and Quesada, Luis}, title = {{Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {16:1--16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.16}, URN = {urn:nbn:de:0030-drops-166450}, doi = {10.4230/LIPIcs.CP.2022.16}, annote = {Keywords: Three-dimensional stable matching with cyclic preferences, 3dsm-cyc, Constraint Programming, relaxation, almost stable matching} }
Timothy Curry, Gabriel De Pace, Benjamin Fuller, Laurent Michel, and Yan (Lindsay) Sun. DUELMIPs: Optimizing SDN Functionality and Security. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{curry_et_al:LIPIcs.CP.2022.17, author = {Curry, Timothy and De Pace, Gabriel and Fuller, Benjamin and Michel, Laurent and Sun, Yan (Lindsay)}, title = {{DUELMIPs: Optimizing SDN Functionality and Security}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.17}, URN = {urn:nbn:de:0030-drops-166468}, doi = {10.4230/LIPIcs.CP.2022.17}, annote = {Keywords: Network security, mixed integer programming, large neighborhood search} }
Nguyen Dang, Özgür Akgün, Joan Espasa, Ian Miguel, and Peter Nightingale. A Framework for Generating Informative Benchmark Instances. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dang_et_al:LIPIcs.CP.2022.18, author = {Dang, Nguyen and Akg\"{u}n, \"{O}zg\"{u}r and Espasa, Joan and Miguel, Ian and Nightingale, Peter}, title = {{A Framework for Generating Informative Benchmark Instances}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.18}, URN = {urn:nbn:de:0030-drops-166479}, doi = {10.4230/LIPIcs.CP.2022.18}, annote = {Keywords: Instance generation, Benchmarking, Constraint Programming} }
Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence Variables for Routing Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{delecluse_et_al:LIPIcs.CP.2022.19, author = {Delecluse, Augustin and Schaus, Pierre and Van Hentenryck, Pascal}, title = {{Sequence Variables for Routing Problems}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.19}, URN = {urn:nbn:de:0030-drops-166485}, doi = {10.4230/LIPIcs.CP.2022.19}, annote = {Keywords: Constraint Programming, Dial-A-Ride, Patient Transportation, TSPTW, Vehicle Routing, Sequence Variables, Insertion Variables} }
Jan Dreier, Sebastian Ordyniak, and Stefan Szeider. CSP Beyond Tractable Constraint Languages. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dreier_et_al:LIPIcs.CP.2022.20, author = {Dreier, Jan and Ordyniak, Sebastian and Szeider, Stefan}, title = {{CSP Beyond Tractable Constraint Languages}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.20}, URN = {urn:nbn:de:0030-drops-166490}, doi = {10.4230/LIPIcs.CP.2022.20}, annote = {Keywords: CSP, backdoor depth, constraint language, tractable class, recursive backdoor} }
Alexander Ek, Andreas Schutt, Peter J. Stuckey, and Guido Tack. Explaining Propagation for Gini and Spread with Variable Mean. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ek_et_al:LIPIcs.CP.2022.21, author = {Ek, Alexander and Schutt, Andreas and Stuckey, Peter J. and Tack, Guido}, title = {{Explaining Propagation for Gini and Spread with Variable Mean}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.21}, URN = {urn:nbn:de:0030-drops-166503}, doi = {10.4230/LIPIcs.CP.2022.21}, annote = {Keywords: Spread constraint, Gini index, Filtering algorithm, Constraint programming, Lazy clause generation} }
Joan Espasa, Ian Miguel, and Mateu Villaret. Plotting: A Planning Problem with Complex Transitions. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{espasa_et_al:LIPIcs.CP.2022.22, author = {Espasa, Joan and Miguel, Ian and Villaret, Mateu}, title = {{Plotting: A Planning Problem with Complex Transitions}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.22}, URN = {urn:nbn:de:0030-drops-166514}, doi = {10.4230/LIPIcs.CP.2022.22}, annote = {Keywords: AI Planning, Modelling, Constraint Programming} }
Hélène Fargier, Jérôme Mengin, and Nicolas Schmidt. Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fargier_et_al:LIPIcs.CP.2022.23, author = {Fargier, H\'{e}l\`{e}ne and Mengin, J\'{e}r\^{o}me and Schmidt, Nicolas}, title = {{Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.23}, URN = {urn:nbn:de:0030-drops-166521}, doi = {10.4230/LIPIcs.CP.2022.23}, annote = {Keywords: Knowledge representation, knowledge compilation, ordered multivalued decision diagram} }
Rebecca Gentzel, Laurent Michel, and Willem-Jan van Hoeve. Heuristics for MDD Propagation in HADDOCK. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gentzel_et_al:LIPIcs.CP.2022.24, author = {Gentzel, Rebecca and Michel, Laurent and van Hoeve, Willem-Jan}, title = {{Heuristics for MDD Propagation in HADDOCK}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.24}, URN = {urn:nbn:de:0030-drops-166534}, doi = {10.4230/LIPIcs.CP.2022.24}, annote = {Keywords: Decision Diagrams} }
Stephan Gocht, Ciaran McCreesh, and Jakob Nordström. An Auditable Constraint Programming Solver. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 25:1-25:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gocht_et_al:LIPIcs.CP.2022.25, author = {Gocht, Stephan and McCreesh, Ciaran and Nordstr\"{o}m, Jakob}, title = {{An Auditable Constraint Programming Solver}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {25:1--25:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.25}, URN = {urn:nbn:de:0030-drops-166548}, doi = {10.4230/LIPIcs.CP.2022.25}, annote = {Keywords: Constraint programming, proof logging, auditable solving} }
Marijn J. H. Heule, Anthony Karahalios, and Willem-Jan van Hoeve. From Cliques to Colorings and Back Again. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 26:1-26:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{heule_et_al:LIPIcs.CP.2022.26, author = {Heule, Marijn J. H. and Karahalios, Anthony and van Hoeve, Willem-Jan}, title = {{From Cliques to Colorings and Back Again}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {26:1--26:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.26}, URN = {urn:nbn:de:0030-drops-166558}, doi = {10.4230/LIPIcs.CP.2022.26}, annote = {Keywords: Graph coloring, maximum clique, Boolean satisfiability} }
Amel Hidouri, Said Jabbour, and Badran Raddaoui. On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hidouri_et_al:LIPIcs.CP.2022.27, author = {Hidouri, Amel and Jabbour, Said and Raddaoui, Badran}, title = {{On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.27}, URN = {urn:nbn:de:0030-drops-166564}, doi = {10.4230/LIPIcs.CP.2022.27}, annote = {Keywords: Data Mining, High Utility Itemsets, Propositional Satisfiability} }
Ruth Hoffmann, Xu Zhu, Özgür Akgün, and Miguel A. Nacenta. Understanding How People Approach Constraint Modelling and Solving. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hoffmann_et_al:LIPIcs.CP.2022.28, author = {Hoffmann, Ruth and Zhu, Xu and Akg\"{u}n, \"{O}zg\"{u}r and Nacenta, Miguel A.}, title = {{Understanding How People Approach Constraint Modelling and Solving}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.28}, URN = {urn:nbn:de:0030-drops-166574}, doi = {10.4230/LIPIcs.CP.2022.28}, annote = {Keywords: Constraint Modelling, HCI, User Study, Grounded Theory} }
Mohit Kumar, Samuel Kolb, and Tias Guns. Learning Constraint Programming Models from Data Using Generate-And-Aggregate. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kumar_et_al:LIPIcs.CP.2022.29, author = {Kumar, Mohit and Kolb, Samuel and Guns, Tias}, title = {{Learning Constraint Programming Models from Data Using Generate-And-Aggregate}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.29}, URN = {urn:nbn:de:0030-drops-166580}, doi = {10.4230/LIPIcs.CP.2022.29}, annote = {Keywords: Constraint Learning, Constraint Programming, Model Synthesis} }
Daphné Lafleur, Sarath Chandar, and Gilles Pesant. Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lafleur_et_al:LIPIcs.CP.2022.30, author = {Lafleur, Daphn\'{e} and Chandar, Sarath and Pesant, Gilles}, title = {{Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.30}, URN = {urn:nbn:de:0030-drops-166594}, doi = {10.4230/LIPIcs.CP.2022.30}, annote = {Keywords: Constraint programming, reinforcement learning, RNN, music generation} }
Jimmy H. M. Lee and Allen Z. Zhong. Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lee_et_al:LIPIcs.CP.2022.31, author = {Lee, Jimmy H. M. and Zhong, Allen Z.}, title = {{Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.31}, URN = {urn:nbn:de:0030-drops-166607}, doi = {10.4230/LIPIcs.CP.2022.31}, annote = {Keywords: Constraint Optimization Problems, Dominance Breaking} }
Hongbo Li, Yaling Wu, Minghao Yin, and Zhanshan Li. A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 32:1-32:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{li_et_al:LIPIcs.CP.2022.32, author = {Li, Hongbo and Wu, Yaling and Yin, Minghao and Li, Zhanshan}, title = {{A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {32:1--32:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.32}, URN = {urn:nbn:de:0030-drops-166616}, doi = {10.4230/LIPIcs.CP.2022.32}, annote = {Keywords: Constraint Satisfaction Problem, Variable Ordering Heuristic, Adaptive Search Heuristic, Portfolio} }
Jheisson López, Alejandro Arbelaez, and Laura Climent. Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lopez_et_al:LIPIcs.CP.2022.33, author = {L\'{o}pez, Jheisson and Arbelaez, Alejandro and Climent, Laura}, title = {{Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.33}, URN = {urn:nbn:de:0030-drops-166625}, doi = {10.4230/LIPIcs.CP.2022.33}, annote = {Keywords: Constraint Programming, Large Neighbourhood Search, Robust Solutions} }
Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, and Quentin Cappart. Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{popovic_et_al:LIPIcs.CP.2022.34, author = {Popovic, Louis and C\^{o}t\'{e}, Alain and Gaha, Mohamed and Nguewouo, Franklin and Cappart, Quentin}, title = {{Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.34}, URN = {urn:nbn:de:0030-drops-166635}, doi = {10.4230/LIPIcs.CP.2022.34}, annote = {Keywords: Transmission maintenance scheduling, Electric power network, Constraint programming} }
Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau. Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 35:1-35:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rudich_et_al:LIPIcs.CP.2022.35, author = {Rudich, Isaac and Cappart, Quentin and Rousseau, Louis-Martin}, title = {{Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {35:1--35:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.35}, URN = {urn:nbn:de:0030-drops-166647}, doi = {10.4230/LIPIcs.CP.2022.35}, annote = {Keywords: decision diagrams, discrete optimization, branch-and-bound, sequencing, constraint programming} }
Mate Soos, Priyanka Golia, Sourav Chakraborty, and Kuldeep S. Meel. On Quantitative Testing of Samplers. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{soos_et_al:LIPIcs.CP.2022.36, author = {Soos, Mate and Golia, Priyanka and Chakraborty, Sourav and Meel, Kuldeep S.}, title = {{On Quantitative Testing of Samplers}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.36}, URN = {urn:nbn:de:0030-drops-166655}, doi = {10.4230/LIPIcs.CP.2022.36}, annote = {Keywords: SAT Sampling, Testing of Samplers, SAT Solvers} }
Fulya Trösser, Simon de Givry, and George Katsirelos. Structured Set Variable Domains in Bayesian Network Structure Learning. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 37:1-37:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{trosser_et_al:LIPIcs.CP.2022.37, author = {Tr\"{o}sser, Fulya and de Givry, Simon and Katsirelos, George}, title = {{Structured Set Variable Domains in Bayesian Network Structure Learning}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {37:1--37:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.37}, URN = {urn:nbn:de:0030-drops-166661}, doi = {10.4230/LIPIcs.CP.2022.37}, annote = {Keywords: Combinatorial Optimization, Bayesian Networks, Decision Trees} }
Felix Ulrich-Oltean, Peter Nightingale, and James Alfred Walker. Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ulricholtean_et_al:LIPIcs.CP.2022.38, author = {Ulrich-Oltean, Felix and Nightingale, Peter and Walker, James Alfred}, title = {{Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {38:1--38:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.38}, URN = {urn:nbn:de:0030-drops-166670}, doi = {10.4230/LIPIcs.CP.2022.38}, annote = {Keywords: Constraint programming, SAT encodings, machine learning, global constraints, pseudo-Boolean constraints, linear constraints} }
Jie Wang, Dingding Chen, Ziyu Chen, Xiangshuang Liu, and Junsong Gao. Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.CP.2022.39, author = {Wang, Jie and Chen, Dingding and Chen, Ziyu and Liu, Xiangshuang and Gao, Junsong}, title = {{Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.39}, URN = {urn:nbn:de:0030-drops-166685}, doi = {10.4230/LIPIcs.CP.2022.39}, annote = {Keywords: DCOP, Cache, Any-space Algorithms, Complete Search Algorithms} }
Ruiwei Wang and Roland H. C. Yap. CNF Encodings of Binary Constraint Trees. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 40:1-40:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.CP.2022.40, author = {Wang, Ruiwei and Yap, Roland H. C.}, title = {{CNF Encodings of Binary Constraint Trees}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {40:1--40:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.40}, URN = {urn:nbn:de:0030-drops-166698}, doi = {10.4230/LIPIcs.CP.2022.40}, annote = {Keywords: BCT, CNF, MDD, NFA / MDD constraint, propagation strength} }
Felix Winter, Sebastian Meiswinkel, Nysret Musliu, and Daniel Walkiewicz. Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 41:1-41:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{winter_et_al:LIPIcs.CP.2022.41, author = {Winter, Felix and Meiswinkel, Sebastian and Musliu, Nysret and Walkiewicz, Daniel}, title = {{Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {41:1--41:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.41}, URN = {urn:nbn:de:0030-drops-166701}, doi = {10.4230/LIPIcs.CP.2022.41}, annote = {Keywords: Parallel Machine Scheduling, Contamination Constraints, Constraint Programming, Mixed Integer Quadratic Progamming, Metaheuristics, Local Search, Simulated Annealing} }
Feedback for Dagstuhl Publishing