LEADER 05265nam 2200733 450 001 9910144653803321 005 20210209112916.0 010 $a1-280-84786-7 010 $a9786610847860 010 $a0-470-61230-4 010 $a0-470-39494-3 010 $a1-84704-647-9 035 $a(CKB)1000000000688251 035 $a(EBL)700769 035 $a(OCoLC)769341546 035 $a(SSID)ssj0000311994 035 $a(PQKBManifestationID)11211267 035 $a(PQKBTitleCode)TC0000311994 035 $a(PQKBWorkID)10330027 035 $a(PQKB)11452142 035 $a(MiAaPQ)EBC700769 035 $a(MiAaPQ)EBC4711304 035 $a(MiAaPQ)EBC275735 035 $a(Au-PeEL)EBL275735 035 $a(OCoLC)935261836 035 $a(EXLCZ)991000000000688251 100 $a20070305d2007 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aTrends in constraint programming /$fedited by Fre?de?ric Benhamou, Narendra Jussien, Barry O'Sullivan 205 $a1st ed. 210 1$aNewport Beach, CA :$cISTE USA,$d2007. 215 $a1 online resource (410 p.) 225 1 $aISTE ;$vv.123 300 $aDescription based upon print version of record. 311 $a1-905209-97-5 320 $aIncludes bibliographical references and index. 327 $aTrends in Constraint Programming; Contents; Introduction; Part I. The Past, Present and Future of Constraint Programming; Chapter 1. Constraint Programming as Declarative Algorithmics; 1.1. The CHIP project; 1.2. The Numerica project; 1.3. The OPL project; 1.4. The Comet project; 1.5. The future of constraint programming; Chapter 2. Constraint Programming Tools; 2.1. Introduction; 2.2. Invited talks; 2.2.1. The development of an industrial CP tool; 2.2.1.1. Design goals; 2.2.1.2. The future; 2.2.2. System design: taking informed decisions; 2.2.2.1. Search; 2.2.2.2. Constraint propagation 327 $a2.2.2.3. Variables2.3. System presentations; 2.3.1. ECLiPSe; 2.3.2. SICStus FD; 2.3.3. G12; 2.3.4. DiSolver; 2.3.5.MINION; 2.3.6. Choco; 2.3.7. Gecode; 2.3.8. Comet; 2.3.9. JaCoP; 2.3.10. Borderwijk; 2.4. Panels; 2.5. Conclusion; 2.6. References; Chapter 3. The Next 10 Years of Constraint Programming; 3.1. Pedro Barahona; 3.2. Christian Bessiere; 3.3. Peter Jeavons; 3.4. Pedro Meseguer; 3.5. Gilles Pesant; 3.6. Francesca Rossi; 3.7. Thomas Schiex; 3.8. Christian Schulte; 3.9. Meinolf Sellmann; 3.10. Mark Wallace; 3.11. Toby Walsh; 3.12. Roland Yap; 3.13. References 327 $aChapter 4. Constraint Propagation and Implementation4.1. Filtering algorithms for precedence and dependency constraints; 4.1.1. Problem description and related works; 4.1.2. Filtering rules for precedence and dependency constraints; 4.1.3. Summary; 4.2. A study of residual supports in arc consistency; 4.3. Maintaining singleton arc consistency; 4.3.1. Mixed consistency; 4.3.2. Checking existential-SAC; 4.3.3. Conclusion; 4.4. Probabilistic singleton arc consistency; 4.5. Simplification and extension of the SPREAD constraint; 4.5.1. Filtering of ?; 4.5.2. Filtering of X; 4.5.3. Conclusion 327 $a4.6. A new filtering algorithm for the graph isomorphism problem4.6.1. A global constraint for the graph isomorphism problem; 4.6.2. ILL-consistency and ILL-filtering; 4.6.3. Experimental results; 4.7. References; Chapter 5. On the First SAT/CP Integration Workshop; 5.1. The technical program; 5.1.1. The invited talk; 5.1.2. Contributions related to SMT and solver integration; 5.1.3. Contributions related to the use of SAT techniques to improve CSP/CP solvers; 5.1.4. Other contributions; 5.2. The panel session; 5.2.1. Are SAT and CP different or similar? 327 $a5.2.2. Why has SAT succeeded in reducing the tuning issue?5.2.3. How long can the current generation of SAT solvers evolve?; 5.2.4. Were performance issues correctly addressed by CP?; 5.2.5. Was CP too ambitious?; 5.2.6. Do we still need CP?; 5.3. Summary, future directions and conclusion; 5.4. References; Chapter 6. Constraint-Based Methods for Bioinformatics; 6.1. On using temporal logic with constraints to express biological properties of cell processes; 6.2. Modeling biological systems in stochastic concurrent constraint programming 327 $a6.3. Chemera: constraints in protein structural problems 330 $aThis title brings together the best papers on a range of topics raised at the annual International Conference on Principles and Practice of Constraint Programming. This conference provides papers and workshops which produce new insights, concepts and results which can then be used by those involved in this area to develop their own work. 410 0$aISTE 606 $aConstraint programming (Computer science) 608 $aElectronic books. 615 0$aConstraint programming (Computer science) 676 $a005.1 676 $a005.1/16 676 $a005.116 702 $aBenhamou$b Fre?de?ric 702 $aJussien$b Narendra 702 $aO'Sullivan$b B$g(Barry), 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144653803321 996 $aTrends in constraint programming$92231457 997 $aUNINA