# Principles and Practice of Constraint Programming - CP'96: Second International Conference, CP '96, Cambridge, MA, USA, August 19 - 22, 1996. Proceedings / Edition 1

Paperback (Print)
$106.91 (Save 23%) Used and New from Other Sellers Used and New from Other Sellers from$17.44
Usually ships in 1-2 business days
(Save 87%)
Other sellers (Paperback)
• All (12) from $17.44 • New (5) from$52.52
• Used (7) from \$17.44

### Overview

This book constitutes the refereed proceedings of the Second International Conference on Principles and Practice of Constraint Programming, CP '96, held in Cambridge, MA, USA in August 1996.
The 36 revised full papers presented in the volume were selected from over 100 submissions; also included are abstracts of 22 selected poster presentations and 3 special lectures. CP is the flagship conference series on constraint processing with a number of satellite activities; thus the volume reflects the state of the art in the field.

### Product Details

• ISBN-13: 9783540615514
• Publisher: Springer Berlin Heidelberg
• Publication date: 9/26/1996
• Series: Lecture Notes in Computer Science Series , #1118
• Edition description: 1996
• Edition number: 1
• Pages: 579
• Product dimensions: 9.21 (w) x 6.14 (h) x 1.24 (d)

On confluence of Constraint Handling Rules.- A labelling arc consistency method for functional constraints.- Constraint satisfaction in optical routing for passive wavelength-routed networks.- Using CSP look-back techniques to solve exceptionally hard SAT instances.- MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems.- The independence property of a class of set constraints.- Speeding up constraint propagation by redundant modeling.- A constraint-based interactive train rescheduling tool.- Local search and the number of solutions.- Derivation of constraints and database relations.- Constraint programming: an efficient and practical approach to solving the job-shop problem.- An instance of adaptive constraint propagation.- An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem.- Empirical studies of heuristic local search for constraint solving.- Defeasibility in CLP( $$\mathcal{Q}$$ ) through generalized slack variables.- Inference duality as a basis for sensitivity analysis.- Generalized local propagation: A framework for solving constraint hierarchies.- Transformations between HCLP and PCSP.- A test for tractability.- Combination of constraint systems II: Rational amalgamation.- Tractable disjunctions of linear constraints.- Exploiting the use of DAC in MAX-CSP.- A new approach for Weighted Constraint Satisfaction: Theoretical and computational results.- Towards a more efficient shastic constraint solver.- A view of local search in constraint programming.- From quasi-solutions to solution: An Evolutionary algorithm to solve CSP.- Existential variables and local consistency in finite domain constraint problems.- Logical semantics of concurrent constraint programming.- Solving non-binary convex CSPs in continuous domains.- An experimental comparison of three modified DeltaBlue algorithms.- Constraint Logic Programming over unions of Constraint theories.- Analysis of Hybrid systems in CLP( $$\mathcal{R}$$ ).- On query languages for linear queries definable with polynomial constraints.- Analysis of heuristic methods for partial constraint satisfaction problems.- Solving satisfiability problems using field programmable gate arrays: First results.- A constraint program for solving the job-shop problem.- PSAP — A planning system for aircraft production (extended abstract).- Using partial arc consistency in a database environment.- Functional constraint hierarchies in CLP.- Towards an open finite domain constraint solver.- Efficient constraint propagation with good space complexity.- Anytime temporal reasoning: Preliminary report (extended abstract).- From constraint minimization to goal optimization in CLP languages.- Looking at full looking ahead.- The arc and path consistency phase transitions.- Experiences with combining constraint programming and discrete event simulation.- Hill-climbing with local consistency for solving distributed CSPs.- Approximate algorithms for maximum utility problems.- A meta constraint logic programming architecture (extended abstract).- N-ary consistencies and constraint-based backtracking.- Global behaviour for complex constraints.- To guess or to think? Hybrid algorithms for SAT (extended abstract).- A local simplification scheme for cc programs.- From evaluating upper bounds of the complexity of solving CSPs to finding all the solutions of CSPs.- Modeling and solving distributed constraint satisfaction problems (DCSPs).- Scheduling an Asynchronously Shared Resource.- The Generalized Railroad Crossing: Its symbolic analysis in CLP ( $$\mathcal{R}$$ ).- A shastic approach to solving fuzzy constraint satisfaction problems.- Branch- and-price for solving integer programs with a huge number of variables: Methods and applications.- Constraint Databases.- Complexity-theoretic aspects of programming language design.

## Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

(0)

(0)

(0)

(0)

### 1 Star

(0)

Your Name: Create a Pen Name or

### Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

### Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

### What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

### Reviews should not contain any of the following:

• - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
• - Time-sensitive information such as tour dates, signings, lectures, etc.
• - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
• - Comments focusing on the author or that may ruin the ending for others
• - Phone numbers, addresses, URLs
• - Pricing and availability information or alternative ordering information

### Reminder:

• - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
• - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
Search for Products You'd Like to Recommend

### Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?