27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 1-1000, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{michel:LIPIcs.CP.2021, title = {{LIPIcs, Volume 210, CP 2021, Complete Volume}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {1--1000}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021}, URN = {urn:nbn:de:0030-drops-152907}, doi = {10.4230/LIPIcs.CP.2021}, annote = {Keywords: LIPIcs, Volume 210, CP 2021, Complete Volume} }
27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 0:i-0:xxii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{michel:LIPIcs.CP.2021.0, author = {Michel, Laurent D.}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {0:i--0:xxii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.0}, URN = {urn:nbn:de:0030-drops-152916}, doi = {10.4230/LIPIcs.CP.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, and M.Grazia Speranza. The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{archetti_et_al:LIPIcs.CP.2021.1, author = {Archetti, Claudia and Jabali, Ola and Mor, Andrea and Simonetto, Alberto and Speranza, M.Grazia}, title = {{The Bi-Objective Long-Haul Transportation Problem on a Road Network}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.1}, URN = {urn:nbn:de:0030-drops-152926}, doi = {10.4230/LIPIcs.CP.2021.1}, annote = {Keywords: Truck scheduling problem, hours of service regulations, fuel costs} }
Ferdinando Fioretto. Constrained-Based Differential Privacy (Invited Talk). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fioretto:LIPIcs.CP.2021.2, author = {Fioretto, Ferdinando}, title = {{Constrained-Based Differential Privacy}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.2}, URN = {urn:nbn:de:0030-drops-152931}, doi = {10.4230/LIPIcs.CP.2021.2}, annote = {Keywords: Optimization, Differential Privacy, Fairness} }
Defeng Liu and Andrea Lodi. Learning in Local Branching (Invited Talk). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{liu_et_al:LIPIcs.CP.2021.3, author = {Liu, Defeng and Lodi, Andrea}, title = {{Learning in Local Branching}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {3:1--3:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.3}, URN = {urn:nbn:de:0030-drops-152948}, doi = {10.4230/LIPIcs.CP.2021.3}, annote = {Keywords: Local search, learning, mixed-integer programming} }
João Araújo, Choiwah Chow, and Mikoláš Janota. Filtering Isomorphic Models by Invariants (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 4:1-4:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{araujo_et_al:LIPIcs.CP.2021.4, author = {Ara\'{u}jo, Jo\~{a}o and Chow, Choiwah and Janota, Mikol\'{a}\v{s}}, title = {{Filtering Isomorphic Models by Invariants}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {4:1--4:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.4}, URN = {urn:nbn:de:0030-drops-152956}, doi = {10.4230/LIPIcs.CP.2021.4}, annote = {Keywords: finite model enumeration, isomorphism, invariants, Mace4} }
Shaowei Cai, Chuan Luo, Xindi Zhang, and Jian Zhang. Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cai_et_al:LIPIcs.CP.2021.5, author = {Cai, Shaowei and Luo, Chuan and Zhang, Xindi and Zhang, Jian}, title = {{Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {5:1--5:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.5}, URN = {urn:nbn:de:0030-drops-152969}, doi = {10.4230/LIPIcs.CP.2021.5}, annote = {Keywords: Satisfiability, Local Search, Unit Propagation, Mathematical Problems} }
Markus Iser and Tomáš Balyo. Unit Propagation with Stable Watches (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 6:1-6:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{iser_et_al:LIPIcs.CP.2021.6, author = {Iser, Markus and Balyo, Tom\'{a}\v{s}}, title = {{Unit Propagation with Stable Watches}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {6:1--6:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.6}, URN = {urn:nbn:de:0030-drops-152973}, doi = {10.4230/LIPIcs.CP.2021.6}, annote = {Keywords: Unit Propagation, Two-Watched Literals, Literal Stability} }
Anissa Kheireddine, Etienne Renault, and Souheib Baarir. Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 7:1-7:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kheireddine_et_al:LIPIcs.CP.2021.7, author = {Kheireddine, Anissa and Renault, Etienne and Baarir, Souheib}, title = {{Towards Better Heuristics for Solving Bounded Model Checking Problems}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {7:1--7:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.7}, URN = {urn:nbn:de:0030-drops-152982}, doi = {10.4230/LIPIcs.CP.2021.7}, annote = {Keywords: Bounded model checking, SAT, Structural information, Linear Programming} }
Tuukka Korhonen and Matti Järvisalo. Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 8:1-8:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{korhonen_et_al:LIPIcs.CP.2021.8, author = {Korhonen, Tuukka and J\"{a}rvisalo, Matti}, title = {{Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {8:1--8:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.8}, URN = {urn:nbn:de:0030-drops-152992}, doi = {10.4230/LIPIcs.CP.2021.8}, annote = {Keywords: propositional model counting, decision heuristics, tree decompositions, empirical evaluation} }
Hongbo Li, Minghao Yin, and Zhanshan Li. Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 9:1-9:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.CP.2021.9, author = {Li, Hongbo and Yin, Minghao and Li, Zhanshan}, title = {{Failure Based Variable Ordering Heuristics for Solving CSPs}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {9:1--9:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.9}, URN = {urn:nbn:de:0030-drops-153002}, doi = {10.4230/LIPIcs.CP.2021.9}, annote = {Keywords: Constraint Satisfaction Problem, Variable Ordering Heuristic, Failure Rate, Failure Length} }
Guilherme de Azevedo Silveira. Generating Magical Performances with Constraint Programming (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deazevedosilveira:LIPIcs.CP.2021.10, author = {de Azevedo Silveira, Guilherme}, title = {{Generating Magical Performances with Constraint Programming}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.10}, URN = {urn:nbn:de:0030-drops-153018}, doi = {10.4230/LIPIcs.CP.2021.10}, annote = {Keywords: Constraint, generative design, computer aided design, constraint programming, generative magic, magical performance} }
Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby. Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ahmadi_et_al:LIPIcs.CP.2021.11, author = {Ahmadi, Saman and Tack, Guido and Harabor, Daniel and Kilby, Philip}, title = {{Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.11}, URN = {urn:nbn:de:0030-drops-153020}, doi = {10.4230/LIPIcs.CP.2021.11}, annote = {Keywords: Electric vehicle routing, pickup-and-delivery problem, vehicle dynamics} }
Carlos Ansótegui, Jesús Ojeda, and Eduard Torres. Building High Strength Mixed Covering Arrays with Constraints. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ansotegui_et_al:LIPIcs.CP.2021.12, author = {Ans\'{o}tegui, Carlos and Ojeda, Jes\'{u}s and Torres, Eduard}, title = {{Building High Strength Mixed Covering Arrays with Constraints}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.12}, URN = {urn:nbn:de:0030-drops-153036}, doi = {10.4230/LIPIcs.CP.2021.12}, annote = {Keywords: Combinatorial Testing, Covering Arrays, Maximum Satisfiability} }
Valentin Antuori, Tom Portoleau, Louis Rivière, and Emmanuel Hebrard. On How Turing and Singleton Arc Consistency Broke the Enigma Code. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{antuori_et_al:LIPIcs.CP.2021.13, author = {Antuori, Valentin and Portoleau, Tom and Rivi\`{e}re, Louis and Hebrard, Emmanuel}, title = {{On How Turing and Singleton Arc Consistency Broke the Enigma Code}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.13}, URN = {urn:nbn:de:0030-drops-153040}, doi = {10.4230/LIPIcs.CP.2021.13}, annote = {Keywords: Constraint Programming, Cryptography} }
Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, and Alain Nguyen. Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{antuori_et_al:LIPIcs.CP.2021.14, author = {Antuori, Valentin and Hebrard, Emmanuel and Huguet, Marie-Jos\'{e} and Essodaigui, Siham and Nguyen, Alain}, title = {{Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.14}, URN = {urn:nbn:de:0030-drops-153052}, doi = {10.4230/LIPIcs.CP.2021.14}, annote = {Keywords: Monte-Carlo Tree Search, Travelling Salesman Problem, Scheduling} }
Blair Archibald, Kyle Burns, Ciaran McCreesh, and Michele Sevegnani. Practical Bigraphs via Subgraph Isomorphism. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{archibald_et_al:LIPIcs.CP.2021.15, author = {Archibald, Blair and Burns, Kyle and McCreesh, Ciaran and Sevegnani, Michele}, title = {{Practical Bigraphs via Subgraph Isomorphism}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.15}, URN = {urn:nbn:de:0030-drops-153068}, doi = {10.4230/LIPIcs.CP.2021.15}, annote = {Keywords: bigraphs, subgraph isomorphism, constraint programming, rewriting systems} }
Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, and Helmut Simonis. The Hybrid Flexible Flowshop with Transportation Times. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{armstrong_et_al:LIPIcs.CP.2021.16, author = {Armstrong, Eddie and Garraffa, Michele and O'Sullivan, Barry and Simonis, Helmut}, title = {{The Hybrid Flexible Flowshop with Transportation Times}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.16}, URN = {urn:nbn:de:0030-drops-153075}, doi = {10.4230/LIPIcs.CP.2021.16}, annote = {Keywords: Constraint Programming, scheduling, hybrid flowshop} }
Yiwei Bai, Di Chen, and Carla P. Gomes. CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bai_et_al:LIPIcs.CP.2021.17, author = {Bai, Yiwei and Chen, Di and Gomes, Carla P.}, title = {{CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.17}, URN = {urn:nbn:de:0030-drops-153086}, doi = {10.4230/LIPIcs.CP.2021.17}, annote = {Keywords: Unsupervised Learning, Combinatorial Optimization} }
Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec. An Interval Constraint Programming Approach for Quasi Capture Tube Validation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bedouhene_et_al:LIPIcs.CP.2021.18, author = {Bedouhene, Abderahmane and Neveu, Bertrand and Trombettoni, Gilles and Jaulin, Luc and Le Menec, St\'{e}phane}, title = {{An Interval Constraint Programming Approach for Quasi Capture Tube Validation}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.18}, URN = {urn:nbn:de:0030-drops-153093}, doi = {10.4230/LIPIcs.CP.2021.18}, annote = {Keywords: Constraint satisfaction problem, Interval analysis, Dynamical systems, Contractor} }
Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, and Adrien Varet. Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{carissan_et_al:LIPIcs.CP.2021.19, author = {Carissan, Yannick and Hagebaum-Reignier, Denis and Prcovic, Nicolas and Terrioux, Cyril and Varet, Adrien}, title = {{Exhaustive Generation of Benzenoid Structures Sharing Common Patterns}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.19}, URN = {urn:nbn:de:0030-drops-153106}, doi = {10.4230/LIPIcs.CP.2021.19}, annote = {Keywords: Constraint satisfaction problem, modeling, pattern, application, theoretical chemistry} }
Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux. Combining VSIDS and CHB Using Restarts in SAT. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cherif_et_al:LIPIcs.CP.2021.20, author = {Cherif, Mohamed Sami and Habet, Djamal and Terrioux, Cyril}, title = {{Combining VSIDS and CHB Using Restarts in SAT}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.20}, URN = {urn:nbn:de:0030-drops-153110}, doi = {10.4230/LIPIcs.CP.2021.20}, annote = {Keywords: Satisfiability, Branching Heuristic, Restarts} }
Martin C. Cooper and João Marques-Silva. On the Tractability of Explaining Decisions of Classifiers. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cooper_et_al:LIPIcs.CP.2021.21, author = {Cooper, Martin C. and Marques-Silva, Jo\~{a}o}, title = {{On the Tractability of Explaining Decisions of Classifiers}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.21}, URN = {urn:nbn:de:0030-drops-153125}, doi = {10.4230/LIPIcs.CP.2021.21}, annote = {Keywords: machine learning, tractability, explanations, weighted constraint satisfaction} }
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, and Luis Quesada. A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cseh_et_al:LIPIcs.CP.2021.22, author = {Cseh, \'{A}gnes and Escamocher, Guillaume and Gen\c{c}, Beg\"{u}m and Quesada, Luis}, title = {{A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {22:1--22:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.22}, URN = {urn:nbn:de:0030-drops-153137}, doi = {10.4230/LIPIcs.CP.2021.22}, annote = {Keywords: Three-dimensional stable matching with cyclic preferences, 3DSM-cyc, Constraint Programming, fairness} }
Tomáš Dlask, Tomáš Werner, and Simon de Givry. Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dlask_et_al:LIPIcs.CP.2021.23, author = {Dlask, Tom\'{a}\v{s} and Werner, Tom\'{a}\v{s} and de Givry, Simon}, title = {{Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.23}, URN = {urn:nbn:de:0030-drops-153149}, doi = {10.4230/LIPIcs.CP.2021.23}, annote = {Keywords: Weighted CSP, Super-Reparametrization, Linear Programming, Constraint Propagation} }
Johannes K. Fichte, Markus Hecher, and Valentin Roland. Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fichte_et_al:LIPIcs.CP.2021.24, author = {Fichte, Johannes K. and Hecher, Markus and Roland, Valentin}, title = {{Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.24}, URN = {urn:nbn:de:0030-drops-153150}, doi = {10.4230/LIPIcs.CP.2021.24}, annote = {Keywords: Propositional Satisfiability, GPGPU, Model Counting, Treewidth, Tree Decomposition} }
Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, and Anas Shahab. Complications for Computational Experiments from Modern Processors. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 25:1-25:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fichte_et_al:LIPIcs.CP.2021.25, author = {Fichte, Johannes K. and Hecher, Markus and McCreesh, Ciaran and Shahab, Anas}, title = {{Complications for Computational Experiments from Modern Processors}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {25:1--25:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.25}, URN = {urn:nbn:de:0030-drops-153165}, doi = {10.4230/LIPIcs.CP.2021.25}, annote = {Keywords: Experimenting, Combinatorial Solving, Empirical Work} }
Cristian Galleguillos, Zeynep Kiziltan, and Ricardo Soto. A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{galleguillos_et_al:LIPIcs.CP.2021.26, author = {Galleguillos, Cristian and Kiziltan, Zeynep and Soto, Ricardo}, title = {{A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.26}, URN = {urn:nbn:de:0030-drops-153171}, doi = {10.4230/LIPIcs.CP.2021.26}, annote = {Keywords: Constraint programming, HPC systems, heterogeneous systems, large systems, on-line job dispatching, resource allocation} }
Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, and Laurent Simon. The Dungeon Variations Problem Using Constraint Programming. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{glorian_et_al:LIPIcs.CP.2021.27, author = {Glorian, Ga\"{e}l and Debesson, Adrien and Yvon-Paliot, Sylvain and Simon, Laurent}, title = {{The Dungeon Variations Problem Using Constraint Programming}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.27}, URN = {urn:nbn:de:0030-drops-153181}, doi = {10.4230/LIPIcs.CP.2021.27}, annote = {Keywords: constraint programming, video games, modelization, procedural generation} }
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. Refined Core Relaxation for Core-Guided MaxSAT Solving. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ihalainen_et_al:LIPIcs.CP.2021.28, author = {Ihalainen, Hannes and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Refined Core Relaxation for Core-Guided MaxSAT Solving}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {28:1--28:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.28}, URN = {urn:nbn:de:0030-drops-153197}, doi = {10.4230/LIPIcs.CP.2021.28}, annote = {Keywords: maximum satisfiability, MaxSAT, core-guided MaxSAT solving} }
Nicolas Isoart and Jean-Charles Régin. A Linear Time Algorithm for the k-Cutset Constraint. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{isoart_et_al:LIPIcs.CP.2021.29, author = {Isoart, Nicolas and R\'{e}gin, Jean-Charles}, title = {{A Linear Time Algorithm for the k-Cutset Constraint}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.29}, URN = {urn:nbn:de:0030-drops-153200}, doi = {10.4230/LIPIcs.CP.2021.29}, annote = {Keywords: k-Cutset, TSP, Linear algorithm, Constraint} }
Nicolas Isoart and Jean-Charles Régin. A k-Opt Based Constraint for the TSP. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{isoart_et_al:LIPIcs.CP.2021.30, author = {Isoart, Nicolas and R\'{e}gin, Jean-Charles}, title = {{A k-Opt Based Constraint for the TSP}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.30}, URN = {urn:nbn:de:0030-drops-153212}, doi = {10.4230/LIPIcs.CP.2021.30}, annote = {Keywords: TSP, k-opt, 1-tree, Constraint} }
Mikoláš Janota, António Morgado, José Fragoso Santos, and Vasco Manquinho. The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{janota_et_al:LIPIcs.CP.2021.31, author = {Janota, Mikol\'{a}\v{s} and Morgado, Ant\'{o}nio and Fragoso Santos, Jos\'{e} and Manquinho, Vasco}, title = {{The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.31}, URN = {urn:nbn:de:0030-drops-153220}, doi = {10.4230/LIPIcs.CP.2021.31}, annote = {Keywords: implicit hitting sets, minimal hitting set, MaxSAT, optimization} }
Peter Jonsson, Victor Lagerkvist, and Sebastian Ordyniak. Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jonsson_et_al:LIPIcs.CP.2021.32, author = {Jonsson, Peter and Lagerkvist, Victor and Ordyniak, Sebastian}, title = {{Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {32:1--32:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.32}, URN = {urn:nbn:de:0030-drops-153238}, doi = {10.4230/LIPIcs.CP.2021.32}, annote = {Keywords: Constraint Satisfaction Problems, Parameterised Complexity, Backdoors} }
Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent. Learning TSP Requires Rethinking Generalization. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 33:1-33:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{joshi_et_al:LIPIcs.CP.2021.33, author = {Joshi, Chaitanya K. and Cappart, Quentin and Rousseau, Louis-Martin and Laurent, Thomas}, title = {{Learning TSP Requires Rethinking Generalization}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {33:1--33:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.33}, URN = {urn:nbn:de:0030-drops-153248}, doi = {10.4230/LIPIcs.CP.2021.33}, annote = {Keywords: Combinatorial Optimization, Travelling Salesman Problem, Graph Neural Networks, Deep Learning} }
Markus Kirchweger and Stefan Szeider. SAT Modulo Symmetries for Graph Generation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 34:1-34:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kirchweger_et_al:LIPIcs.CP.2021.34, author = {Kirchweger, Markus and Szeider, Stefan}, title = {{SAT Modulo Symmetries for Graph Generation}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {34:1--34:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.34}, URN = {urn:nbn:de:0030-drops-153257}, doi = {10.4230/LIPIcs.CP.2021.34}, annote = {Keywords: symmetry breaking, SAT encodings, graph generation, combinatorial search, extremal graphs, CDCL} }
Anton Korikov and J. Christopher Beck. Counterfactual Explanations via Inverse Constraint Programming. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{korikov_et_al:LIPIcs.CP.2021.35, author = {Korikov, Anton and Beck, J. Christopher}, title = {{Counterfactual Explanations via Inverse Constraint Programming}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.35}, URN = {urn:nbn:de:0030-drops-153261}, doi = {10.4230/LIPIcs.CP.2021.35}, annote = {Keywords: Explanation, Inverse Optimization, Scheduling} }
Benjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, and Martin Gebser. Utilizing Constraint Optimization for Industrial Machine Workload Balancing. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kovacs_et_al:LIPIcs.CP.2021.36, author = {Kov\'{a}cs, Benjamin and Tassel, Pierre and Kohlenbrein, Wolfgang and Schrott-Kostwein, Philipp and Gebser, Martin}, title = {{Utilizing Constraint Optimization for Industrial Machine Workload Balancing}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {36:1--36:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.36}, URN = {urn:nbn:de:0030-drops-153276}, doi = {10.4230/LIPIcs.CP.2021.36}, annote = {Keywords: application, production planning, production scheduling, linear programming, constraint programming, greedy algorithm, benchmarking} }
Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, and Felix Winter. Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lackner_et_al:LIPIcs.CP.2021.37, author = {Lackner, Marie-Louise and Mrkvicka, Christoph and Musliu, Nysret and Walkiewicz, Daniel and Winter, Felix}, title = {{Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.37}, URN = {urn:nbn:de:0030-drops-153286}, doi = {10.4230/LIPIcs.CP.2021.37}, annote = {Keywords: Oven Scheduling Problem, Parallel Batch Processing, Constraint Programming, Integer Linear Programming} }
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, and Kun He. Combining Clause Learning and Branch and Bound for MaxSAT. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 38:1-38:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.CP.2021.38, author = {Li, Chu-Min and Xu, Zhenxing and Coll, Jordi and Many\`{a}, Felip and Habet, Djamal and He, Kun}, title = {{Combining Clause Learning and Branch and Bound for MaxSAT}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {38:1--38:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.38}, URN = {urn:nbn:de:0030-drops-153291}, doi = {10.4230/LIPIcs.CP.2021.38}, annote = {Keywords: MaxSAT, Branch\&Bound, CDCL} }
Bohan Li, Kai Wang, Yiyuan Wang, and Shaowei Cai. Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 39:1-39:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.CP.2021.39, author = {Li, Bohan and Wang, Kai and Wang, Yiyuan and Cai, Shaowei}, title = {{Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.39}, URN = {urn:nbn:de:0030-drops-153304}, doi = {10.4230/LIPIcs.CP.2021.39}, annote = {Keywords: Operations Research, NP-hard Problem, Local Search, Weighted Connected Dominating Set Problem} }
Luc Libralesso, François Delobel, Pascal Lafourcade, and Christine Solnon. Automatic Generation of Declarative Models For Differential Cryptanalysis. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 40:1-40:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{libralesso_et_al:LIPIcs.CP.2021.40, author = {Libralesso, Luc and Delobel, Fran\c{c}ois and Lafourcade, Pascal and Solnon, Christine}, title = {{Automatic Generation of Declarative Models For Differential Cryptanalysis}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.40}, URN = {urn:nbn:de:0030-drops-153314}, doi = {10.4230/LIPIcs.CP.2021.40}, annote = {Keywords: Constraint Programming, SAT, ILP, Differential Cryptanalysis} }
Xiangshuang Liu, Ziyu Chen, Dingding Chen, and Junsong Gao. A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 41:1-41:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{liu_et_al:LIPIcs.CP.2021.41, author = {Liu, Xiangshuang and Chen, Ziyu and Chen, Dingding and Gao, Junsong}, title = {{A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {41:1--41:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.41}, URN = {urn:nbn:de:0030-drops-153324}, doi = {10.4230/LIPIcs.CP.2021.41}, annote = {Keywords: DCOP, complete algorithms, search} }
Jayanta Mandi, Rocsildes Canoy, Víctor Bucarey, and Tias Guns. Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 42:1-42:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mandi_et_al:LIPIcs.CP.2021.42, author = {Mandi, Jayanta and Canoy, Rocsildes and Bucarey, V{\'\i}ctor and Guns, Tias}, title = {{Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.42}, URN = {urn:nbn:de:0030-drops-153339}, doi = {10.4230/LIPIcs.CP.2021.42}, annote = {Keywords: Vehicle routing, Neural network, Preference learning} }
Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, and Holger H. Hoos. Statistical Comparison of Algorithm Performance Through Instance Selection. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 43:1-43:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{matricon_et_al:LIPIcs.CP.2021.43, author = {Matricon, Th\'{e}o and Anastacio, Marie and Fijalkow, Nathana\"{e}l and Simon, Laurent and Hoos, Holger H.}, title = {{Statistical Comparison of Algorithm Performance Through Instance Selection}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {43:1--43:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.43}, URN = {urn:nbn:de:0030-drops-153346}, doi = {10.4230/LIPIcs.CP.2021.43}, annote = {Keywords: Performance assessment, early stopping, automated reasoning solvers} }
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 44:1-44:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{niskanen_et_al:LIPIcs.CP.2021.44, author = {Niskanen, Andreas and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.44}, URN = {urn:nbn:de:0030-drops-153354}, doi = {10.4230/LIPIcs.CP.2021.44}, annote = {Keywords: Constraint optimization, maximum satisfiability, MaxSAT, implicit hitting set approach} }
Xiao Peng, Christine Solnon, and Olivier Simonin. Solving the Non-Crossing MAPF with CP. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 45:1-45:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{peng_et_al:LIPIcs.CP.2021.45, author = {Peng, Xiao and Solnon, Christine and Simonin, Olivier}, title = {{Solving the Non-Crossing MAPF with CP}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {45:1--45:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.45}, URN = {urn:nbn:de:0030-drops-153367}, doi = {10.4230/LIPIcs.CP.2021.45}, annote = {Keywords: Constraint Programming (CP), Multi-Agent Path Finding (MAPF), Assignment Problems} }
Luis Quesada and Kenneth N. Brown. Positive and Negative Length-Bound Reachability Constraints. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 46:1-46:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{quesada_et_al:LIPIcs.CP.2021.46, author = {Quesada, Luis and Brown, Kenneth N.}, title = {{Positive and Negative Length-Bound Reachability Constraints}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {46:1--46:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.46}, URN = {urn:nbn:de:0030-drops-153372}, doi = {10.4230/LIPIcs.CP.2021.46}, annote = {Keywords: Reachability Constraints, Graph Connectivity, Constraint Programming} }
Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, and Alexey Ignatiev. Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 47:1-47:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{semenov_et_al:LIPIcs.CP.2021.47, author = {Semenov, Alexander and Chivilikhin, Daniil and Pavlenko, Artem and Otpuschennikov, Ilya and Ulyantsev, Vladimir and Ignatiev, Alexey}, title = {{Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {47:1--47:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.47}, URN = {urn:nbn:de:0030-drops-153381}, doi = {10.4230/LIPIcs.CP.2021.47}, annote = {Keywords: SAT solving, Boolean formula hardness, Backdoors, Evolutionary algorithms} }
Ilankaikone Senthooran, Pierre Le Bodic, and Peter J. Stuckey. Optimising Training for Service Delivery. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{senthooran_et_al:LIPIcs.CP.2021.48, author = {Senthooran, Ilankaikone and Le Bodic, Pierre and Stuckey, Peter J.}, title = {{Optimising Training for Service Delivery}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {48:1--48:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.48}, URN = {urn:nbn:de:0030-drops-153395}, doi = {10.4230/LIPIcs.CP.2021.48}, annote = {Keywords: Scheduling, Task Allocation, Training Optimisation} }
Ilankaikone Senthooran, Matthias Klapperstueck, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, and Maria Garcia de la Banda. Human-Centred Feasibility Restoration. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 49:1-49:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{senthooran_et_al:LIPIcs.CP.2021.49, author = {Senthooran, Ilankaikone and Klapperstueck, Matthias and Belov, Gleb and Czauderna, Tobias and Leo, Kevin and Wallace, Mark and Wybrow, Michael and de la Banda, Maria Garcia}, title = {{Human-Centred Feasibility Restoration}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {49:1--49:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.49}, URN = {urn:nbn:de:0030-drops-153408}, doi = {10.4230/LIPIcs.CP.2021.49}, annote = {Keywords: Combinatorial optimisation, modelling, human-centred, conflict resolution, feasibility restoration, explainable AI, soft constraints} }
Pouya Shati, Eldan Cohen, and Sheila McIlraith. SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 50:1-50:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{shati_et_al:LIPIcs.CP.2021.50, author = {Shati, Pouya and Cohen, Eldan and McIlraith, Sheila}, title = {{SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {50:1--50:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.50}, URN = {urn:nbn:de:0030-drops-153416}, doi = {10.4230/LIPIcs.CP.2021.50}, annote = {Keywords: Decision Tree, Classification, Numeric Data, Categorical Data, SAT, MaxSAT} }
Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. Pseudo-Boolean Optimization by Implicit Hitting Sets. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 51:1-51:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{smirnov_et_al:LIPIcs.CP.2021.51, author = {Smirnov, Pavel and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Pseudo-Boolean Optimization by Implicit Hitting Sets}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {51:1--51:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.51}, URN = {urn:nbn:de:0030-drops-153429}, doi = {10.4230/LIPIcs.CP.2021.51}, annote = {Keywords: constraint optimization, pseudo-Boolean optimization, implicit hitting sets} }
Boro Sofranac, Ambros Gleixner, and Sebastian Pokutta. An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 52:1-52:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sofranac_et_al:LIPIcs.CP.2021.52, author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian}, title = {{An Algorithm-Independent Measure of Progress for Linear Constraint Propagation}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {52:1--52:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.52}, URN = {urn:nbn:de:0030-drops-153430}, doi = {10.4230/LIPIcs.CP.2021.52}, annote = {Keywords: Bounds Propagation, Mixed Integer Programming} }
Shannon Sweitzer and T. K. Satish Kumar. Differential Programming via OR Methods. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sweitzer_et_al:LIPIcs.CP.2021.53, author = {Sweitzer, Shannon and Kumar, T. K. Satish}, title = {{Differential Programming via OR Methods}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.53}, URN = {urn:nbn:de:0030-drops-153445}, doi = {10.4230/LIPIcs.CP.2021.53}, annote = {Keywords: Differential Programming, Operations Research, B\'{e}zier Curves} }
Dimosthenis C. Tsouros and Kostas Stergiou. Learning Max-CSPs via Active Constraint Acquisition. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{tsouros_et_al:LIPIcs.CP.2021.54, author = {Tsouros, Dimosthenis C. and Stergiou, Kostas}, title = {{Learning Max-CSPs via Active Constraint Acquisition}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.54}, URN = {urn:nbn:de:0030-drops-153452}, doi = {10.4230/LIPIcs.CP.2021.54}, annote = {Keywords: Constraint acquisition, modeling, learning} }
Nils Merlin Ullmann, Tomáš Balyo, and Michael Klein. Parallelizing a SAT-Based Product Configurator. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 55:1-55:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ullmann_et_al:LIPIcs.CP.2021.55, author = {Ullmann, Nils Merlin and Balyo, Tom\'{a}\v{s} and Klein, Michael}, title = {{Parallelizing a SAT-Based Product Configurator}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {55:1--55:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.55}, URN = {urn:nbn:de:0030-drops-153464}, doi = {10.4230/LIPIcs.CP.2021.55}, annote = {Keywords: Configuration, Satisfiability, Parallel} }
Mathieu Vavrille, Charlotte Truchet, and Charles Prud'homme. Solution Sampling with Random Table Constraints. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 56:1-56:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{vavrille_et_al:LIPIcs.CP.2021.56, author = {Vavrille, Mathieu and Truchet, Charlotte and Prud'homme, Charles}, title = {{Solution Sampling with Random Table Constraints}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {56:1--56:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.56}, URN = {urn:nbn:de:0030-drops-153477}, doi = {10.4230/LIPIcs.CP.2021.56}, annote = {Keywords: solutions, sampling, table constraint} }
Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, and Ji Wang. Making Rigorous Linear Programming Practical for Program Analysis. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 57:1-57:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{wang_et_al:LIPIcs.CP.2021.57, author = {Wang, Tengbin and Chen, Liqian and Chen, Taoqing and Fan, Guangsheng and Wang, Ji}, title = {{Making Rigorous Linear Programming Practical for Program Analysis}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {57:1--57:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.57}, URN = {urn:nbn:de:0030-drops-153486}, doi = {10.4230/LIPIcs.CP.2021.57}, annote = {Keywords: Linear programming, rigorous linear programming, abstract interpretation, program analysis, Fourier-Mozkin elimination} }
Jiong Yang and Kuldeep S. Meel. Engineering an Efficient PB-XOR Solver. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 58:1-58:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{yang_et_al:LIPIcs.CP.2021.58, author = {Yang, Jiong and Meel, Kuldeep S.}, title = {{Engineering an Efficient PB-XOR Solver}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {58:1--58:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.58}, URN = {urn:nbn:de:0030-drops-153499}, doi = {10.4230/LIPIcs.CP.2021.58}, annote = {Keywords: PB-XOR Solving, Pseudo-Boolean, XOR, Gauss Jordan Elimination, SAT-Solving, Model Counting} }
Ghiles Ziat, Matthieu Dien, and Vincent Botbol. Automated Random Testing of Numerical Constrained Types. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 59:1-59:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ziat_et_al:LIPIcs.CP.2021.59, author = {Ziat, Ghiles and Dien, Matthieu and Botbol, Vincent}, title = {{Automated Random Testing of Numerical Constrained Types}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {59:1--59:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.59}, URN = {urn:nbn:de:0030-drops-153502}, doi = {10.4230/LIPIcs.CP.2021.59}, annote = {Keywords: Constraint Programming, Automated Random Testing, Abstract Domains, Constrained Types} }
Roie Zivan, Omer Perry, Ben Rachmut, and William Yeoh. The Effect of Asynchronous Execution and Message Latency on Max-Sum. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 60:1-60:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{zivan_et_al:LIPIcs.CP.2021.60, author = {Zivan, Roie and Perry, Omer and Rachmut, Ben and Yeoh, William}, title = {{The Effect of Asynchronous Execution and Message Latency on Max-Sum}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {60:1--60:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.60}, URN = {urn:nbn:de:0030-drops-153518}, doi = {10.4230/LIPIcs.CP.2021.60}, annote = {Keywords: Distributed constraints, Distributed problem solving} }