LIPIcs, Volume 235
CP 2022, July 31 to August 8, 2022, Haifa, Israel
Editors: Christine Solnon
Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
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-dev.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} }
Feedback for Dagstuhl Publishing