Accepted Papers

  1. S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan and Prasanna Venkatraman. Functional significance checking in noisy gene regulatory networks
  2. Meinolf Sellmann, Kevin Tierney and Stefan Kuhlemann. Exploiting Counterfactuals for Scalable Stochastic Optimization
  3. Patrick Spracklen, Nguyen Dang, Özgür Akgün and Ian Miguel. Automatic Streamlining for Constrained Optimisation
  4. Alexander Schiendorfer and Wolfgang Reif. Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems
  5. Cristian Galleguillos, Zeynep Kiziltan, Alina Sirbu and Ozalp Babaoglu. Constraint Programming-based Job Dispatching for Modern HPC Applications
  6. Alex Mattenet, Ian Davidson, Siegfried Nijssen and Pierre Schaus. Generic Constraint-based Block Modeling using Constraint Programming
  7. Mohd Hafiz Hasan and Pascal Van Hentenryck. The Flexible and Real-Time Commute Trip Sharing Problems
  8. Peter J. Stuckey and Guido Tack. Compiling Conditional Constraints
  9. Md Solimul Chowdhury, Martin Mueller and Jia-Huai You. Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics
  10. John Hooker. Improved Job Sequencing Bounds from Decision Diagrams
  11. Supratik Chakraborty, Aditya A. Shrotri and Moshe Y. Vardi. On Symbolic Approaches for Computing the Matrix Permanent
  12. Gael Glorian, Jean Marie Lagniez, Valentin Montmirail and Nicolas Szczepanski. An Incremental SAT-Based Approach for Graph Colouring Problem
  13. Nadeem Alkurdi, Benjamin Pillot, Carmen Gervet and Laurent Linguet. Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach
  14. Emir Demirović and Peter J. Stuckey. Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search
  15. Buser Say, Scott Sanner and Sylvie Thiébaux. Reward Potentials for Planning with Learned Neural Network Transition Models
  16. Ciaran McCreesh, William Pettersson and Patrick Prosser. Understanding the Empirical Hardness of Random Optimisation Problems
  17. Sara Frimodig and Christian Schulte. Models for Radiation Therapy Patient Scheduling
  18. Nicolas Isoart and Jean-Charles Regin. Integration of structural constraints into TSP models
  19. Stanislav Murín and Hana Rudová. Scheduling of Mobile Robots using Constraint Programming
  20. Ferdinando Fioretto and Pascal Van Hentenryck. Differential Privacy of Hierarchical Census Data: An Optimization Approach
  21. Dimosthenis C. Tsouros, Kostas Stergiou and Christian Bessiere. Structure-driven Multiple Constraint Acquisition
  22. Marijn Heule. Trimming Formulas by Trimming Proofs
  23. Johannes K. Fichte, Markus Hecher and Markus Zisser. An Improved GPU-based SAT Model Counter
  24. Mohamed Sami Cherif and Djamal Habet. Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience
  25. Rocsildes Canoy and Tias Guns. Vehicle routing by learning from historical solutions
  26. Gustav Björdal, Pierre Flener, Justin Pearson and Peter J. Stuckey. Exploring Declarative Local-Search Neighbourhoods with Constraint Programming
  27. John M. Betts, David L. Dowe, Daniel Guimarans, Daniel Harabor, Heshan Kumarage, Peter J. Stuckey and Michael Wybrow. Rail Demand Shifting with Passenger Incentives
  28. Giovanni Lo Bianco, Xavier Lorca and Charlotte Truchet. Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition
  29. Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luís Esteban, Ian Miguel, Peter Nightingale, András Salamon, Josep Suy and Mateu Villaret. Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints
  30. Alexis de Colnet and Kuldeep S. Meel. Dual Hashing-based Algorithms for Discrete Integration
  31. Özgür Akgün, Nguyen Dang, Ian Miguel, Andras Z. Salamon and Christopher Stone. Instance Generation via Generator Instances
  32. Adriana Pacheco, Cédric Pralet and Stephanie Roussel. Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems
  33. Pedro Orvalho, Miguel Terra-Neves, Miguel Ventura, Ruben Martins and Vasco Manquinho. Encodings for Enumeration-Based Program Synthesis
  34. Andreia P. Guerreiro, Miguel Terra-Neves, Ines Lynce, José Rui Figueira and Vasco Manquinho. Constraint-based Techniques in Stochastic Local Search MaxSAT Solving
  35. Weikun Yang, Grigory Fedyukovich and Aarti Gupta. Lemma Synthesis for Automating Induction over Algebraic Data Types
  36. Artem Kaznatcheev, David A. Cohen and Peter G. Jeavons. Representing fitness landscapes by valued constraints to understand the complexity of local search
  37. John Aoga, Siegfried Nijssen and Pierre Schaus. Modeling Pattern Set Mining using Logical Circuits
  38. Rodrigo Toro Icarte, León Illanes, Margarita Castro, Andre Cire, Sheila McIlraith and J. Christopher Beck. Training Binarized Neural Networks using MIP and CP
  39. Li-Cheng Chen and Jie-Hong Roland Jiang. A Cube Distribution Approach to QBF Solving and Certificate Minimization
  40. Grigory Fedyukovich and Aarti Gupta. Functional Synthesis with Examples
  41. David Mitchell. Guarded Constraint Models Define Treewidth Preserving Reductions
  42. Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper and Pierre Schaus. Learning Optimal Decision Trees using Constraint Programming
  43. Xavier Gillard, Pierre Schaus and Yves Deville. SolverCheck: Declarative Testing of Constraints
  44. Giacomo Da Col and Erich Teppan. Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers
  45. Robert Ganian, Sebastian Ordyniak and Stefan Szeider. A Join-Based Hybrid Parameter for Constraint Satisfaction
  46. Danuta Sorina Chisca, Michele Lombardi, Michela Milano and Barry O'Sullivan. Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem