Principles and practice of constraint programming : 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008 : proceedings
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...
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin
Springer
2008
Springer Berlin / Heidelberg |
| Edition | 1 |
| Series | Lecture notes in computer science |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | 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 (ICAPS 2008) and the International Conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the CP conference series is the premier international conference on constraint programming. The conference focuses on all aspects of computing with constraints. The CP conf- ence series is organized by the Association for Constraint Programming (ACP). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about ACP can be found athttp://www. a4cp. org/. CP 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. The research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee. |
|---|---|
| AbstractList | 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 (ICAPS 2008) and the International Conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the CP conference series is the premier international conference on constraint programming. The conference focuses on all aspects of computing with constraints. The CP conf- ence series is organized by the Association for Constraint Programming (ACP). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about ACP can be found athttp://www. a4cp. org/. CP 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. The research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee. |
| Author | International Conference on Principles and Practice of Constraint Programming Stuckey, Peter J. |
| Author_xml | – sequence: 1 fullname: International Conference on Principles and Practice of Constraint Programming – sequence: 2 fullname: Stuckey, Peter J. |
| BackLink | https://cir.nii.ac.jp/crid/1130000797673273600$$DView record in CiNii |
| BookMark | eNqNkd9KwzAUhyv-wW3uHXIhiLBBkzRp6t0sUwcDB4q3JU1Pt7gumU2m7DV8YlMnemsuTsjh4ztJfv3oxFgDR1GfsiQWLGOCH_8dUnEW9YgQjKdZSs-joXOvcVgUZ4zwXvS5aLVRetuAQ9JUaNtK5bUCZGukrHG-ldr40LbLVm422izRDcKJX6GZ8dAa6bU1skG5NTW0YBSMUL5AJI7FCD3tKwP7EZrsOk-jZWjB1sOmhDZIxjgwHRmUYYACqILfXUSntWwcDH_2QfRyN33OH8bzx_tZPpmPZUJITMcE1xwIDaWGFJecx4JmUqUEZFJnkKkSy1jikjJSgUgYUZjVuFI14yCAAx1E1wexdGv4cCvbeFe8N1Bau3ZFlorfH8WBvTqw4aJvO3C--MYUmO5lxfQ25wxjztN_kDTmlFARyMsDabQulO4qxrRLJ2QVTCSlPCT1BU6rjH4 |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 005.116 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 3540859586 9783540859581 |
| Edition | 1 2008 |
| ExternalDocumentID | 9783540859581 EBC6511667 EBC3063238 BA91258662 |
| GroupedDBID | 089 0D6 0DA 2HV 38. A4J AABBV AAJYQ AATVQ AAUKK ABBUY ABBVZ ABCYT ABGTP ABMNI ACANT ACDTA ACDUY ACHXG ACKTP AEDXK AEHEY AEJLV AEKFX AETDV AEZAY AHNNE ALMA_UNASSIGNED_HOLDINGS ATJMZ AZZ BBABE CZZ IEZ IW- JJU MA. MMI MW~ NUU RYH SBO SVJCK TPJZQ TSXQS UR3 Z7R Z7S Z7U Z7X Z7Y Z7Z Z81 Z83 Z85 Z87 Z88 -7M -7Q -BG LDH NUC SAO Z5O Z8M Z8N Z8R Z8T Z8W Z92 |
| ID | FETCH-LOGICAL-a42203-21f6e23f6efe71b660839ac72ea4f9e9cb1a0a1b352de8452c15f1dcf56e8e6e3 |
| ISBN | 3540859578 9783540859574 |
| IngestDate | Fri Nov 08 03:50:49 EST 2024 Tue Aug 19 05:57:13 EDT 2025 Wed Jun 18 05:37:42 EDT 2025 Thu Jun 26 23:37:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA76.612 -- .C7 2008eb |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a42203-21f6e23f6efe71b660839ac72ea4f9e9cb1a0a1b352de8452c15f1dcf56e8e6e3 |
| Notes | Includes bibliographical references and index |
| OCLC | 288567973 |
| PQID | EBC3063238 |
| PageCount | 661 |
| ParticipantIDs | askewsholts_vlebooks_9783540859581 proquest_ebookcentral_EBC6511667 proquest_ebookcentral_EBC3063238 nii_cinii_1130000797673273600 |
| PublicationCentury | 2000 |
| PublicationDate | c2008 2008 2014-07-31 |
| PublicationDateYYYYMMDD | 2008-01-01 2014-07-31 |
| PublicationDate_xml | – year: 2008 text: 2008 |
| PublicationDecade | 2000 2010 |
| PublicationPlace | Berlin |
| PublicationPlace_xml | – name: Berlin – name: Berlin/Heidelberg – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture notes in computer science |
| PublicationYear | 2008 2014 |
| Publisher | Springer Springer Berlin / Heidelberg |
| Publisher_xml | – name: Springer – name: Springer Berlin / Heidelberg |
| SSID | ssj0000319526 |
| Score | 1.9198658 |
| Snippet | This volume contains the proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008) held in Sydney,... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer science Congresses Constraint programming (Computer science) Constraint programming (Computer science)-Congresses |
| TableOfContents | 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 |
| Title | Principles and practice of constraint programming : 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008 : proceedings |
| URI | https://cir.nii.ac.jp/crid/1130000797673273600 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3063238 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6511667 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540859581 |
| Volume | 5202 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1db9MwFLWgCIm9jE_tg00W4o1mqhPHiXnbqqKpApSHMe0tsl1HVLAO0YC0_Qx-Mfc6iZ0GBoIXq7WcG9knic899vUl5CU8IloyrSLMIRBxzW0ktakiaTGLtNIL66Jc370Xpx_4_CK9CIkLXXRJrY_MzW_jSv4HVagDXDFK9h-Q9UahAn4DvlACwlAOyK__24BbdBL5ug30b0Kdmj3ieCYs-Pt1t_fq0qkB6Pnz-uNAAgwBf04xLfCEwdwpoteLdh-YV0Nctf1SW8whAsYi5lriFc58mAs9T7_tZrhEMehD0evDNPShCH3wYlCNe0Gu_e7iV_OjDe0iH2gXnXa54dOiEIWHrjXJewaHYZ8cS2BkucBZ926WwWfs3vFs_vbcy2oYlJXGoo3icXby-17gauxukS21_gRzCMwv9RpIxWq5_GUqdvzi7CEZYczJI3LHrh6T7S7TBm0_vE_IjzBYFAaLdoDTq4oGwGkPcPqaItx0AwEaEBjTaUFxsMa0gXpMPdBQ1cFMHcxj1xJM9iB-Ss7fzM6mp1GbTSNSPI7hRYxZJWycQFHZjGkhgH1LZbLYKl5JK41maqKYBkq-sDlPY8PSii1MlQqbW2GTZ2S0ulrZHULThCdmIhVmPeNmopVmJgNHI5bw5uuM7ZIXvREuv392K__rsgdDDo0OYOBLs8SS4bIq8FVgx1kClBp4-C6hHSSlu77drlzOTqbg6CZANv_URIArIUS295e77JMH4cl8Tkb112_2AHhmrQ_bZ-snrYd5VQ |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Principles+and+practice+of+constraint+programming+%3A+14th+International+Conference%2C+CP+2008%2C+Sydney%2C+Australia%2C+September+14-18%2C+2008+%3A+proceedings&rft.au=International+Conference+on+Principles+and+Practice+of+Constraint+Programming&rft.au=Stuckey%2C+Peter+J.&rft.date=2008-01-01&rft.pub=Springer&rft.isbn=9783540859574&rft.externalDocID=BA91258662 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835408%2F9783540859581.jpg |