Principles and Practice of Constraint Programming - CP 2007
Home > Computing and Information Technology > Computer programming / software engineering > Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings
Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings

Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

The 13th International Conference on Principles and Practice of Constraint Programming (CP 2007) was held in Providence, RI, USA, September 23–27, 2007, in conjunction with the International Conference on Automated Pl- ning and Scheduling (ICAPS). 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 conference - ries is organized by the Association for Constraint Programming (ACP). - formation 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 2007 launched two calls for contributions: a call for research papers, describing novel contributions in the ?eld, and a call for application papers, describing applications of constraint technology in the industrial world. The research track received 143 submissions and the application track received 22 submissions. Research papers were reviewed under a double-blind scheme. They received three reviews that the authors had the opportunity to see and to react tobeforethepapersandtheirreviewswerediscussedextensivelybythemembers of the ProgramCommittee. Application papers werereviewedby a separate- plication Committee. The Program Committee and the Application Committee then selected 43 researchpapers and 9 application papers to be published in full inthe proceedings,andanadditional14researchpapersto be publishedas short papers. The full papers were presented at the conference in two parallel tracks and the short papers were presented in a poster session.

Table of Contents:
Invited Lectures.- Caching in Backtracking Search.- Of Mousetraps and Men: A Cautionary Tale.- Application Papers.- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite.- Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques.- Solving the Salinity Control Problem in a Potable Water System.- Exploring Different Constraint-Based Modelings for Program Verification.- An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing.- An Efficient Model and Strategy for the Steel Mill Slab Design Problem.- Constraint-Based Temporal Reasoning for E-Learning with LODE.- Scheduling for Cellular Manufacturing.- Full Research Papers.- A Constraint Store Based on Multivalued Decision Diagrams.- GAC Via Unit Propagation.- Solution Directed Backjumping for QCSP.- Reformulating CSPs for Scalability with Application to Geospatial Reasoning.- A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects.- Local Symmetry Breaking During Search in CSPs.- Encodings of the Sequence Constraint.- On Inconsistent Clause-Subsets for Max-SAT Solving.- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming.- Tradeoffs in the Complexity of Backdoor Detection.- Model-Driven Visualizations of Constraint-Based Local Search.- Dealing with Incomplete Preferences in Soft Constraint Problems.- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure.- MUST: Provide a Finer-Grained Explanation of Unsatisfiability.- An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search.- Limitations of Restricted Branching in Clause Learning.- Dynamic Management of Heuristics for Solving Structured CSPs.- A Compression Algorithm for Large Arity Extensional Constraints.- Valid Inequality Based Lower Bounds for WCSP.- Advisors for Incremental Propagation.- Breaking Symmetry of Interchangeable Variables and Values.- Path Consistency by Dual Consistency.- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.- Scheduling Conditional Task Graphs.- Towards Robust CNF Encodings of Cardinality Constraints.- AND/OR Multi-valued Decision Diagrams for Constraint Optimization.- Parallelizing Constraint Programs Transparently.- MiniZinc: Towards a Standard CP Modelling Language.- Propagation = Lazy Clause Generation.- Boosting Probabilistic Choice Operators.- A Multi-engine Solver for Quantified Boolean Formulas.- Decomposing Global Grammar Constraints.- Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT.- Bound-Consistent Deviation Constraint.- Constructive Interval Disjunction.- An LP-Based Heuristic for Optimal Planning.- A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs.- On Universal Restart Strategies for Backtracking Search.- Hierarchical Hardness Models for SAT.- SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT.- Filtering for Subgraph Isomorphism.- Solution Counting Algorithms for Constraint-Centered Search Heuristics.- Min-Domain Ordering for Asynchronous Backtracking.- Short Research Papers.- Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario.- Uncertainty in Bipolar Preference Problems.- An Analysis of Slow Convergence in Interval Propagation.- The Expressive Power of Valued Constraints: Hierarchies and Collapses.- Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks.- The Log-Support Encoding of CSP into SAT.- Groupoids and Conditional Symmetry.- Sampling Strategies and Variable Selection in Weighted Degree Heuristics.- A Case for Simple SAT Solvers.- CP-Based Local Branching.- Strong Controllability of Disjunctive Temporal Problems with Uncertainty.- Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms.- Constraint Symmetry for the Soft CSP.- Breaking Value Symmetry.


Best Sellers


Product Details
  • ISBN-13: 9783540749691
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 887
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3540749691
  • Publisher Date: 06 Sep 2007
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!