Principles and practice of constraint programming : 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008 : proceedings

• Main Authors: International Conference on Principles and Practice of Constraint Programming, Stuckey, Peter J.
• Format: eBook Book
• Language: English
• Published: Berlin Springer 2008; Springer Berlin / Heidelberg
• Edition: 1
• Series: Lecture notes in computer science
• Subjects: Computer science; Congresses; Constraint programming (Computer science); Constraint programming (Computer science)-Congresses

This volume contains the proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008) held in Sydney, Australia, September 14-18, 2008. The conference was held in conjunction with the International Conference on Automated Planning and Scheduling (IC...

Table of Contents:

• Intro -- Preface -- Organization -- Table of Contents -- Back to the Complexity of Universal Programs -- A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine -- Planning and Scheduling the Operation of a Very Large Oil Pipeline Network -- Search Strategies for Rectangle Packing -- Solving a Telecommunications Feature Subscription Configuration Problem -- Protein Structure Prediction with Large Neighborhood Constraint Programming Search -- An Application of Constraint Programming to Superblock Instruction Scheduling -- Classes of Submodular Constraints Expressible by Graph Cuts -- Optimization of Simple Tabular Reduction for Table Constraints -- Universal Booleanization of Constraint Models -- Flow-Based Propagators for the SEQUENCE and Related Global Constraints -- Guiding Search in QCSP+ with Back-Propagation -- A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions -- A Branch and Bound Algorithm for Numerical MAX-CSP -- A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules -- Cost-Based Domain Filtering for Stochastic Constraint Programming -- Dichotomic Search Protocols for Constrained Optimization -- Length-Lex Bounds Consistency for Knapsack Constraints -- A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems -- From High Girth Graphs to Hard Instances -- Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT -- CPBPV: A Constraint-Programming Framework for Bounded Program Verification -- Exploiting Common Subexpressions in Numerical CSPs -- A Soft Constraint of Equality: Complexity and Approximability -- Structural Tractability of Propagated Constraints -- Connecting ABT with Arc Consistency
• Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies -- Reformulating Positive Table Constraints Using Functional Dependencies -- Relaxations for Compiled Over-Constrained Problems -- Approximate Compilation of Constraints into Multivalued Decision Diagrams -- Quantified Constraint Optimization -- Exploiting Decomposition in Constraint Optimization Problems -- A Coinduction Rule for Entailment of Recursively Defined Properties -- Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints -- Perfect Constraints Are Tractable -- Efficiently Solving Problems Where the Solutions Form a Group -- Approximate Solution Sampling (and Counting) on AND/OR Spaces -- Model Restarts for Structural Symmetry Breaking -- An Elimination Algorithm for Functional Constraints -- Crossword Puzzles as a Constraint Problem -- Recent Hybrid Techniques for the Multi-Knapsack Problem -- Edge Matching Puzzles as Hard SAT/CSP Benchmarks -- Test Strategy Generation Using Quantified CSPs -- Perfect Derived Propagators -- Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems -- Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation -- Semi-automatic Generation of CHR Solvers for Global Constraints -- Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions -- Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm -- Computing All Optimal Solutions in Satisfiability Problems with Preferences -- On the Efficiency of Impact Based Heuristics -- Probabilistically Estimating Backbones and Variable Bias: Experimental Overview -- A New Empirical Study of Weak Backdoors -- Adding Search to Zinc -- Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms
• Search Space Reduction for Constraint Optimization Problems -- Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem -- Author Index
• Solving a Telecommunications Feature Subscription Configuration Problem -- Introduction -- Configuring Feature Subscriptions in DFC -- Formal Definitions -- A Constraint Programming Approach -- Formulation -- Solution Technique -- Other Approaches -- PartialWeighted Maximum Boolean Satisfiability -- Integer Linear Programming -- Experimental Results -- Problem Generation and Solvers -- Maintaining Different Levels of Consistency in CP -- Comparison between the Alternative Approaches -- Conclusions -- References -- Protein Structure Prediction with Large Neighborhood Constraint Programming Search -- Introduction -- Problem Formalization -- Related Work -- Why Constraint Programming? -- The Implementation -- The CP Model -- The Search Procedure -- Strengthening the Model during Search -- Large Neighborhood Search -- Experimental Results -- Conclusions and Future Work -- References -- An Application of Constraint Programming to Superblock Instruction Scheduling -- TheProblem -- WhyCP? -- HowCP? -- Basic Model -- Improving the Model and Solving Approach -- Experimental Evaluation -- Added Value of CP? -- Conclusions -- References -- Classes of Submodular Constraints Expressible by Graph Cuts -- Introduction -- Definitions -- Valued Constraint Satisfaction and Expressibility -- Submodular Functions and Polynomials -- Binary Submodular Constraints -- Negative Higher Degree Terms, {0, 1}-Valued andTernary Submodular Constraints -- Submodular Constraints of Arity 4 and Higher -- 4-ary Constraints -- The General Case -- Conclusion -- References -- Optimization of Simple Tabular Reduction for Table Constraints -- Introduction -- Technical Background -- Related Work on GAC for Table Constraints -- Simple Tabular Reduction -- Optimizing STR -- Experimental Results -- Conclusion -- References -- Universal Booleanization of Constraint Models -- Introduction
• A Branch and Bound Algorithm for Numerical MAX-CSP -- Introduction -- A Motivating Example -- The Max-CSP Framework -- Interval Analysis for Numerical CSPs -- Intervals, Interval Vectors and Interval Arithmetic -- Interval Contractors -- The Algorithm -- SU-Boxes -- The Function Infer \SU_outer -- The Function Infer\SU_inner -- The Function Infer\LSU_type -- The Branch and Bound Algorithm -- Related Work -- Experiments -- Camera Control Problem -- The Facility Location Problem -- Parameter Estimation with Bounded Error Measurements -- Conclusion -- References -- A Geometric Constraint over \k-Dimensional Objects and Shapes Subject to Business Rules -- Introduction -- The Rule Language: Syntax and Features -- QFPA Core Fragment -- Rewriting into QFPA -- Compiling to an Efficient Run-Time Representation -- Necessary Conditions -- Pruning Rules -- \k-Indexicals -- Compilation -- Filtering Algorithm -- Experimental Results -- Discussion -- Conclusion -- References -- Cost-Based Domain Filtering for Stochastic Constraint Programming -- Introduction -- Formal Background -- Value of Stochastic Solutions -- Global Optimization Chance-Constraints -- Expectation-Based Relaxation for Stochastic Variables -- Relaxing the Expected Value Problem -- Cost-Based Filtering -- Finding Good Feasible Solutions -- Experimental Results -- Static Stochastic Knapsack Problem -- Stochastic Sequencing with Release Times and Deadlines -- Related Work -- Conclusions -- References -- Dichotomic Search Protocols for Constrained Optimization -- Introduction -- SkewedBinarySearch -- Skewed Dichotomic Search for Constrained Optimization -- The Streeter-Smith Strategy -- Parameter Tuning Based on Skewed Binary Search Protocols -- Numerical Results -- Conclusions -- References -- Length-Lex Bounds Consistency for Knapsack Constraints -- Introduction
• Domain Representations for Set-Variables -- The Knapsack Problem -- Exact Pseudo-polynomial Algorithms for Knapsack -- Approximated Length-Lex Bounds Consistency for Knapsack Constraints -- Fast Heuristic Filtering Algorithms for Knapsacks with Bounded Cardinalities -- Lagrangian Relaxation-Based Cardinality Bounds -- Redundant Knapsack Constraints -- Experimental Results -- Conclusions -- References -- A Framework for Hybrid Tractability Results inBoolean Weighted Constraint Satisfaction Problems -- Introduction -- Background Results in Graph Theory -- Projections of MinimumWeighted Vertex Cover Problems onto Independent Sets -- Weighted Constraints as Projections: The Idea of the CCG -- Graphical Representations for BooleanWeighted Constraints -- Hybrid Computational Properties of the CCG -- CCG Captures the Topological Structure of the Constraint Network -- CCG Captures the Numerical Structure of the Weighted Constraints -- Conclusions and FutureWork -- References -- From High Girth Graphs to Hard Instances -- Introduction -- Preliminaries -- Related Work -- Expansion of Random Graphs -- Related Results in SAT Community -- Related Results in CSP Community -- Hard SAT and n-ary CSP Instances -- Expansion, Balance, and Girth -- High Girth Bipartite Graphs -- Experimental Investigation -- Hard \k-SAT Instances -- Hard \n-ary CSP Instances -- Conclusions -- References -- Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT -- Introduction -- Review of Algorithms adaptG^{2}WSAT+, RSAPS,VW, and Hybrid -- Motivation -- A New Switching Criterion -- Evenness or Unevenness of Distribution of ClauseWeights -- Algorithm \NCVW -- Evaluation -- Groups of Instances -- Default Values of Parameters in \NCVW -- Comparison of Performance -- Justification for Switching Strategy Used in \NCVW -- Conclusion
• References
• Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Back to the Complexity of Universal Programs -- Preface -- Around 1985 -- Around 1990 -- Around 2000 -- Introduction -- Machines -- Basic Definitions -- How a Machine Operates -- Example: Turing Machines -- Example: Indirect Addressing Arithmetic Machine -- Universal Program and Universal Coding -- Universal Pair -- Introspection Coefficient -- Existence and Value of the Introspection Coefficient -- Universal Pair for the Turing Machine -- The Universal Pair -- Coding Function of the Universal Pair -- Operation of the Universal Pair -- Introspection Coefficient of Our Pair for the Turing Machine -- Universal Pair for the Indirect Addressing Arithmetic Machine -- The Universal Pair -- Operation of the Universal Pair -- Introspection Coefficient of Our Pair for the Indirect Addressing Machine -- Conclusion -- References -- A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine -- Introduction -- TheProblem -- Cell BE Hardware Architecture -- The Target Application -- WhyCP -- HowCP -- Decomposition Based Approach -- Pure CP Model -- Computational Efficiency -- Conclusions -- References -- Planning and Scheduling the Operation of a Very Large Oil Pipeline Network -- Introduction -- Why CP and Related Work -- HowCP? -- Results -- Added Value and Conclusions -- References -- Search Strategies for Rectangle Packing -- Introduction -- Constraint Programming Model -- Problem Decomposition -- Symmetry Removal -- Search Strategies -- Naive -- X Then Y -- Disjunctive -- Semantic Disjunctive -- Dual -- Forcing Obligatory Parts -- Model Improvements -- Empty Strip Dominance -- Ignoring Size 1 Squares -- Ignoring Size 2 Squares -- Results -- Incomplete Heuristics -- Conclusion -- References
• Basis for Universal Booleanization -- An Itemized Procedure -- Booleanization of Variable Declarations -- Booleanization of Constraints -- Booleanization of \Solve and \Output Items -- Complexity of the Encoding -- Weaknesses and Strengths -- Experimental Results -- Related Work and Conclusion -- References -- Flow-Based Propagators for the \SEQUENCE and Related Global Constraints -- Introduction -- Background -- The \SEQUENCE Constraint -- Flow-Based Propagator for the \SEQUENCE Constraint -- Soft \SEQUENCE Constraint -- Generalized \SEQUENCE Constraint -- A \SLIDINGSUM Constraint -- Experimental Results -- The \SEQUENCE Constraint -- The Soft \SEQUENCE Constraint -- Conclusion -- References -- Guiding Search in QCSP+ with Back-Propagation -- Introduction -- Definitions -- CSP and QCSP -- Restricted Quantification -- Solvinga \QCSP+ -- Back-Propagation -- Removing Values in Domains -- An Illustrative Example -- General Behavior -- Back-Propagation Does Not Work in General -- Goal-Driven Heuristic -- Value Heuristics -- The Aim of the Goal-Driven Heuristic -- The Algorithm -- Experiments -- Conclusion -- References -- A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions -- Introduction -- A Motivating Example -- Contractions and Bisections Using Box Domains -- From a Box Domain to a Parallelepiped Domain -- Contracting Parallelepiped Domains -- Bisecting Parallelepiped Domains -- Interval Analysis for NCSP Resolution -- Interval Arithmetic -- Interval Contractors -- Description of the Algorithm -- Changing the Shape of a Parallelepiped -- Contracting a Parallelepiped Domain -- Bisecting a Parallelepiped Domain -- Experiments -- Intersection of Surfaces -- Two Dimensional Implicit Plot -- The Layne-Watson Exponential Cosine Curve -- The Parametrized Broyden Tridiagonal -- Discussion -- References