Table of Contents

• A Modular Architecture for Hybrid Planning with TheoriesMaria Fox. 1-2 [doi]
• Teaching Constraint ProgrammingPatrick Prosser. 3 [doi]
• One Problem, Two Structures, Six Solvers, and Ten Years of Personnel SchedulingLouis-Martin Rousseau. 4-5 [doi]
• Concurrent Constraint Programming Research Programmes - ReduxVijay Saraswat. 6-8 [doi]
• On Broken TrianglesMartin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini. 9-24 [doi]
• Using CP in Automatic Test Generation for ABB Robotics' Paint Control SystemMorten Mossige, Arnaud Gotlieb, Hein Meling. 25-41 [doi]
• On Compiling CNF into Decision-DNNFUmut Oztok, Adnan Darwiche. 42-57 [doi]
• A Complete Solver for Constraint GamesThi-Van-Anh Nguyen, Arnaud Lallouet. 58-74 [doi]
• Encoding Linear Constraints into SATIgnasi Abío, Peter J. Stuckey. 75-91 [doi]
• Efficient Application of Max-SAT Resolution on Inconsistent SubsetsAndré Abramé, Djamal Habet. 92-107 [doi]
• Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization SolversRoberto Amadini, Peter J. Stuckey. 108-124 [doi]
• Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism ProblemGilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Porumbel. 125-141 [doi]
• Linking Prefixes and Suffixes for Constraints Encoded Using Automata with AccumulatorsNicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson. 142-157 [doi]
• The Propagation Depth of Local ConsistencyChristoph Berkholz. 158-173 [doi]
• The Balance Constraint FamilyChristian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Émilie Picard-Cantin, Claude-Guy Quimper, Toby Walsh. 174-189 [doi]
• Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm SelectorLoïc Blet, Samba Ndojh Ndiaye, Christine Solnon. 190-206 [doi]
• Solving Intensional Weighted CSPs by Incremental Optimization with BDDsMiquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret. 207-223 [doi]
• On Backdoors to Tractable Constraint LanguagesClément Carbonnel, Martin C. Cooper, Emmanuel Hebrard. 224-239 [doi]
• Nested Constraint ProgramsGeoffrey Chu, Peter J. Stuckey. 240-255 [doi]
• Beyond Consistency and SubstitutabilityMartin C. Cooper. 256-271 [doi]
• Subexponential Time Complexity of CSP with Global ConstraintsRonald de Haan, Iyad A. Kanj, Stefan Szeider. 272-288 [doi]
• A New Characterization of Relevant Intervals for Energetic ReasoningAlban Derrien, Thierry Petit. 289-297 [doi]
• A Declarative Paradigm for Robust Cumulative SchedulingAlban Derrien, Thierry Petit, Stéphane Zampelli. 298-306 [doi]
• Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization ProblemsFerdinando Fioretto, Tiep Le, William Yeoh, Enrico Pontelli, Tran Cao Son. 307-323 [doi]
• Constraint-Based Lagrangian RelaxationDaniel Fontaine, Laurent D. Michel, Pascal Van Hentenryck. 324-339 [doi]
• Loop UntanglingKathryn Francis, Peter J. Stuckey. 340-355 [doi]
• Discriminating Instance Generation for Automated Constraint Model SelectionIan P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Glenna F. Nightingale, Peter Nightingale. 356-365 [doi]
• Aggregating CP-nets with Unfeasible OutcomesUmberto Grandi, Hang Luo, Nicolas Maudet, Francesca Rossi. 366-381 [doi]
• The StockingCost ConstraintVinasétan Ratheil Houndji, Pierre Schaus, Laurence Wolsey, Yves Deville. 382-397 [doi]
• Scalable Parallel Numerical CSP SolverDaisuke Ishii, Kazuki Yoshizoe, Toyotaro Suzumura. 398-406 [doi]
• Tree-Decompositions with Connected Clusters for Solving Constraint NetworksPhilippe Jégou, Cyril Terrioux. 407-423 [doi]
• CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment ProblemWen-Yang Ku, Thiago Pinheiro, J. Christopher Beck. 424-439 [doi]
• On the Erdős Discrepancy ProblemRonan Le Bras, Carla P. Gomes, Bart Selman. 440-448 [doi]
• Towards Practical Infinite Stream Constraint Programming: Applications and ImplementationJasper C. H. Lee, Jimmy H. M. Lee. 449-464 [doi]
• An Increasing-Nogoods Global Constraint for Symmetry Breaking During SearchJimmy H. M. Lee, Zichen Zhu. 465-480 [doi]
• Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical ModelsLevi H. S. Lelis, Lars Otten, Rina Dechter. 481-496 [doi]
• Higher-Order Consistencies through GAC on Factor VariablesChavalit Likitvivatanavong, Wei Xia, Roland H. C. Yap. 497-513 [doi]
• Incremental QBF SolvingFlorian Lonsing, Uwe Egly. 514-530 [doi]
• Incremental Cardinality Constraints for MaxSATRuben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce. 531-548 [doi]
• Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique ProblemCiaran McCreesh, Patrick Prosser. 549-563 [doi]
• Core-Guided MaxSAT with Soft Cardinality ConstraintsAntonio Morgado, Carmine Dodaro, Joao Marques-Silva. 564-573 [doi]
• The IntSat Method for Integer Linear ProgrammingRobert Nieuwenhuis. 574-589 [doi]
• Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression EliminationPeter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel. 590-605 [doi]
• Improving GAC-4 for Table and MDD ConstraintsGuillaume Perez, Jean-Charles Régin. 606-621 [doi]
• Improvement of the Embarrassingly Parallel Search for Data CentersJean-Charles Régin, Mohamed Rezgui, Arnaud Malapert. 622-635 [doi]
• Stochastic MiniZincAndrea Rendl, Guido Tack, Peter J. Stuckey. 636-645 [doi]
• Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint OptimizationEmma Rollon, Javier Larrosa. 646-654 [doi]
• Insights into Parallelism with Intensive Knowledge SharingAshish Sabharwal, Horst Samulowitz. 655-671 [doi]
• The Non-overlapping Constraint between Objects Described by Non-linear InequalitiesIgnacio Salas, Gilles Chabert, Alexandre Goldsztejn. 672-687 [doi]
• Improving Relational Consistency Algorithms Using Dynamic Relation PartitioningAnthony Schneider, Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere. 688-704 [doi]
• Domain Views for Constraint ProgrammingPascal Van Hentenryck, Laurent D. Michel. 705-720 [doi]
• Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABTMohamed Wahbi, Kenneth N. Brown. 721-737 [doi]
• The Impact of Wireless Communication on Distributed Constraint SatisfactionMohamed Wahbi, Kenneth N. Brown. 738-754 [doi]
• Adaptive Parameterized Consistency for Non-binary CSPs by Counting SupportsRobert J. Woodward, Anthony Schneider, Berthe Y. Choueiry, Christian Bessiere. 755-764 [doi]
• Proactive Workload Dispatching on the EURORA SupercomputerAndrea Bartolini, Andrea Borghesi, Thomas Bridi, Michele Lombardi, Michela Milano. 765-780 [doi]
• Scheduling B2B MeetingsMiquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret. 781-796 [doi]
• Solving a Judge Assignment Problem Using Conjunctions of Global Cost FunctionsSimon de Givry, Jimmy Ho-Man Lee, Ka Lun Leung, Yu Wai Shum. 797-812 [doi]
• Worst-Case Scheduling of Software Tasks - A Constraint Optimization Model to Support Performance TestingStefano Di Alesio, Shiva Nejati, Lionel C. Briand, Arnaud Gotlieb. 813-830 [doi]
• Continuous Casting Scheduling with Constraint ProgrammingSteven Gay, Pierre Schaus, Vivian De Smedt. 831-845 [doi]
• Case Study: Constraint Programming in a System Level Synthesis FrameworkShuo Li, Ahmed Hemani. 846-861 [doi]
• Scheduling Agents Using Forecast Call Arrivals at Hydro-Québec's Call CentersMarie Pelleau, Louis-Martin Rousseau, Pierre L'Ecuyer, Walid Zegal, Louis Delorme. 862-869 [doi]
• Deployment of Mobile Wireless Sensor Networks for Crisis Management: A Constraint-Based Local Search ApproachCédric Pralet, Charles Lesire. 870-885 [doi]
• Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related ProblemsMirko Stojadinovic. 886-902 [doi]
• Optimization Bounds from Binary Decision Diagrams - (Extended Abstract)David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker. 903-907 [doi]
• Reformulation Based MaxSAT Robustness - (Extended Abstract)Miquel Bofill, Dídac Busquets, Mateu Villaret. 908-912 [doi]
• Probabilistic Constraints for Nonlinear Inverse Problems - (Extended Abstract)Elsa Carvalho, Jorge Cruz, Pedro Barahona. 913-917 [doi]
• Multivalued Decision Diagrams for Sequencing Problems - (Extended Abstract)Andre A. Ciré, Willem Jan van Hoeve. 918-922 [doi]
• Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract)Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber. 923-927 [doi]
• Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)Martin C. Cooper, Frederic Maris, Pierre Régnier. 928-932 [doi]
• Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract)Lars Otten, Rina Dechter. 933-937 [doi]
• View-Based Propagator Derivation - (Extended Abstract)Christian Schulte, Guido Tack. 938-942 [doi]