Amazon cover image
Image from Amazon.com

Principles and practice of constraint programming : 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings / edited by Barry O'Sullivan.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 8656. | LNCS sublibrary. SL 2, Programming and software engineering.Publisher: Cham : Springer, 2014Description: 1 online resource (xxvi, 944 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319104287
  • 3319104284
  • 3319104276
  • 9783319104270
Other title:
  • CP 2014
Subject(s): Genre/Form: Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1/16 23
LOC classification:
  • QA76.612
Online resources:
Contents:
Intro; Preface; Prize-Winning Papers; Tutorials and Workshops; Conference Organization; The Association for Constraint Programming; Table of Contents; Invited Talks; A Modular Architecture for Hybrid Planning with Theories; References; Teaching Constraint Programming; One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling; References; Concurrent Constraint Programming Research Programmes -- Redux; References; Best Technical Track Paper; On Broken Triangles; 1 Introduction; 2 Value Merging in Binary CSP Based on the BTP; 3 Experimental Trials
4 Generalising BTP-Merging to Constraints of Arbitrary Arity5 A Tractable Class of General-Arity CSP; 5.1 Directional General-Arity BTP; 5.2 Merging; 5.3 Tractability of DGABTP for a Known Variable Ordering; 5.4 Finding a DGABTP Variable Ordering Is NP-Hard; 6 Conclusion; References; Best Application Track Paper; Using CP in Automatic Test Generation for ABB Robotics' Paint Control System; 1 Introduction; 2 Robotized Painting; 2.1 Example of Robotized Painting; 3 Testing the IPS; 3.1 Continuous Integration; 3.2 Testing in a CI Environment; 4 CP Model of the IPS
4.1 Decision Variables and Domains4.2 Test Scenarios; 4.3 Avoiding Trivial and Enforcing Diversity; 4.4 Search and Optimization; 4.5 Search Heuristics; 5 Implementation and Exploitation; 5.1 Selection of CP and the CP Solver; 5.2 Overall Implementation; 5.3 Execution of the Model; 5.4 Using the Flexibility of CP; 5.5 Performance of Model; 6 Lessons Learned and Conclusions; 6.2 Actual Defects Found with the CP Model; 6.3 Return on Investment with the Use of CP; 6.4 Further Work; References; Best Student Paper; On Compiling CNF into Decision-DNNF; 1 Introduction; 2 Technical Preliminaries
3 Compiling CNFs into Decision-DNNFs3.1 Decision-DNNF; 3.2 Decision Vtrees; 3.3 A Compilation Algorithm; 3.4 Decision-Width; 3.5 Relationship to Treewidth; 4 Decision-DNNFs and Model Counters; 5 From Decision-DNNF to SDD; 6 Related Work; 7 Conclusion; References; Runner-Up Best Student Paper; A Complete Solver for Constraint Games; 1 Introduction; 2 Constraint Games; 3 Modeling with Constraint Games; 4 Pruning Techniques; 5 An Algorithm for Nash Equilibrium Enumeration; 6 Experiments; 7 Conclusion; References; Technical Track; Encoding Linear Constraints into SAT; 1 Introduction
2 Preliminaries2.1 SAT Solving; 2.2 LCG and LD Solvers; 2.3 Order and Logarithmic Encoding; 2.4 Multi Decision Diagrams; 3 Linear Integer Constraints; 4 Construction of the MDD; 5 Encoding MDDs into CNF; 6 Optimization Problems; 7 Improvements; 7.1 Grouping Identical Coefficients; 7.2 Removing Subsumed Clauses; 7.3 Solution Phase Saving; 7.4 Lazy Decomposition; 8 Related Work and Extensions; 9 Experimental Results; 9.1 Multiple Knapsack; 9.2 RCPSP; 9.3 Graph Coloring; 9.4 Sport Leagues Scheduling; 10 Conclusion; References; Efficient Application of Max-SAT Resolution on Inconsistent Subsets
In: Springer eBooksSummary: This book constitutes the refereed conference proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, CP 2014, held in Lyon, France, in September 2014. The 65 revised papers presented together with 4 invited talks were carefully selected from 108 submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, and agreement technologies.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

International conference proceedings.

Includes author index.

Online resource; title from PDF title page (SpringerLink, viewed August 26, 2014).

This book constitutes the refereed conference proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, CP 2014, held in Lyon, France, in September 2014. The 65 revised papers presented together with 4 invited talks were carefully selected from 108 submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, and agreement technologies.

Intro; Preface; Prize-Winning Papers; Tutorials and Workshops; Conference Organization; The Association for Constraint Programming; Table of Contents; Invited Talks; A Modular Architecture for Hybrid Planning with Theories; References; Teaching Constraint Programming; One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling; References; Concurrent Constraint Programming Research Programmes -- Redux; References; Best Technical Track Paper; On Broken Triangles; 1 Introduction; 2 Value Merging in Binary CSP Based on the BTP; 3 Experimental Trials

4 Generalising BTP-Merging to Constraints of Arbitrary Arity5 A Tractable Class of General-Arity CSP; 5.1 Directional General-Arity BTP; 5.2 Merging; 5.3 Tractability of DGABTP for a Known Variable Ordering; 5.4 Finding a DGABTP Variable Ordering Is NP-Hard; 6 Conclusion; References; Best Application Track Paper; Using CP in Automatic Test Generation for ABB Robotics' Paint Control System; 1 Introduction; 2 Robotized Painting; 2.1 Example of Robotized Painting; 3 Testing the IPS; 3.1 Continuous Integration; 3.2 Testing in a CI Environment; 4 CP Model of the IPS

4.1 Decision Variables and Domains4.2 Test Scenarios; 4.3 Avoiding Trivial and Enforcing Diversity; 4.4 Search and Optimization; 4.5 Search Heuristics; 5 Implementation and Exploitation; 5.1 Selection of CP and the CP Solver; 5.2 Overall Implementation; 5.3 Execution of the Model; 5.4 Using the Flexibility of CP; 5.5 Performance of Model; 6 Lessons Learned and Conclusions; 6.2 Actual Defects Found with the CP Model; 6.3 Return on Investment with the Use of CP; 6.4 Further Work; References; Best Student Paper; On Compiling CNF into Decision-DNNF; 1 Introduction; 2 Technical Preliminaries

3 Compiling CNFs into Decision-DNNFs3.1 Decision-DNNF; 3.2 Decision Vtrees; 3.3 A Compilation Algorithm; 3.4 Decision-Width; 3.5 Relationship to Treewidth; 4 Decision-DNNFs and Model Counters; 5 From Decision-DNNF to SDD; 6 Related Work; 7 Conclusion; References; Runner-Up Best Student Paper; A Complete Solver for Constraint Games; 1 Introduction; 2 Constraint Games; 3 Modeling with Constraint Games; 4 Pruning Techniques; 5 An Algorithm for Nash Equilibrium Enumeration; 6 Experiments; 7 Conclusion; References; Technical Track; Encoding Linear Constraints into SAT; 1 Introduction

2 Preliminaries2.1 SAT Solving; 2.2 LCG and LD Solvers; 2.3 Order and Logarithmic Encoding; 2.4 Multi Decision Diagrams; 3 Linear Integer Constraints; 4 Construction of the MDD; 5 Encoding MDDs into CNF; 6 Optimization Problems; 7 Improvements; 7.1 Grouping Identical Coefficients; 7.2 Removing Subsumed Clauses; 7.3 Solution Phase Saving; 7.4 Lazy Decomposition; 8 Related Work and Extensions; 9 Experimental Results; 9.1 Multiple Knapsack; 9.2 RCPSP; 9.3 Graph Coloring; 9.4 Sport Leagues Scheduling; 10 Conclusion; References; Efficient Application of Max-SAT Resolution on Inconsistent Subsets

English.

Powered by Koha