000 06153cam a2200769 a 4500
001 ocn501312936
003 OCoLC
005 20240523125531.0
006 m o d
007 cr cn|||||||||
008 100122s2007 caua ob 001 0 eng d
040 _aDG1
_beng
_epn
_cDG1
_dOCLCQ
_dDG1
_dOCLCQ
_dOCLCF
_dOCLCO
_dN$T
_dYDXCP
_dIDEBK
_dE7B
_dNRC
_dNRU
_dB24X7
_dDEBSZ
_dOCLCQ
_dDEBBG
_dAZK
_dDG1
_dLIP
_dOCLCQ
_dAU@
_dU3W
_dOCLCQ
_dOCLCO
_dOCLCQ
_dSFB
_dOCLCO
_dOCLCL
019 _a343815842
_a642692519
_a647848866
_a961631462
_a992845307
_a1058186123
020 _a9780470612309
020 _a0470612304
020 _a9781847046475
_q(electronic bk.)
020 _a1847046479
_q(electronic bk.)
020 _z9781905209972
020 _z1905209975
024 7 _a10.1002/9780470612309
_2doi
029 1 _aAU@
_b000055724203
029 1 _aCHNEW
_b000934527
029 1 _aCHVBK
_b480148716
029 1 _aDEBBG
_bBV043390502
029 1 _aDEBSZ
_b400436000
029 1 _aDEBSZ
_b430365799
035 _a(OCoLC)501312936
_z(OCoLC)343815842
_z(OCoLC)642692519
_z(OCoLC)647848866
_z(OCoLC)961631462
_z(OCoLC)992845307
_z(OCoLC)1058186123
037 _a10.1002/9780470612309
_bWiley InterScience
_nhttp://www3.interscience.wiley.com
050 4 _aQA76.612
_b.T74 2007
072 7 _aCOM
_x051390
_2bisacsh
072 7 _aCOM
_x051440
_2bisacsh
072 7 _aCOM
_x051230
_2bisacsh
082 0 4 _a005.1/16
_222
049 _aMAIN
245 0 0 _aTrends in constraint programming /
_cedited by Frederic Benhamou, Narendra Jussien, Barry O'Sullivan.
260 _aNewport Beach, CA :
_bISTE USA,
_c2007.
300 _a1 online resource (408 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
504 _aIncludes bibliographical references and index.
520 _aConstraint programming is a constantly evolving field, something which is explored 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 those involved in this area can then use to develop their own work. This title provides an accessible overview of this by bringing together the best papers on a range of topics within this subject area, thus allowing those involved in constraint programming to benefit from the new innovations and results created as a res.
588 0 _aPrint version record.
505 0 _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
505 8 _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
505 8 _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?
505 8 _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
590 _aJohn Wiley and Sons
_bWiley Online Library: Complete oBooks
650 0 _aConstraint programming (Computer science)
650 6 _aProgrammation par contraintes.
650 7 _aCOMPUTERS
_xProgramming
_xOpen Source.
_2bisacsh
650 7 _aCOMPUTERS
_xSoftware Development & Engineering
_xTools.
_2bisacsh
650 7 _aCOMPUTERS
_xSoftware Development & Engineering
_xGeneral.
_2bisacsh
650 7 _aConstraint programming (Computer science)
_2fast
700 1 _aBenhamou, Fr�ed�eric.
700 1 _aJussien, Narendra.
700 1 _aO'Sullivan, B.
_q(Barry)
_1https://id.oclc.org/worldcat/entity/E39PCjJf9g6Y8Hwgyfq663m68C
758 _ihas work:
_aTrends in constraint programming (Text)
_1https://id.oclc.org/worldcat/entity/E39PCGKhy36vbyg8f8kC44KJ9P
_4https://id.oclc.org/worldcat/ontology/hasWork
776 0 8 _iPrint version:
_tTrends in constraint programming.
_dNewport Beach, CA : ISTE USA, 2007
_z9781905209972
_z1905209975
_w(DLC) 2007009430
_w(OCoLC)85783476
856 4 0 _uhttps://onlinelibrary.wiley.com/doi/book/10.1002/9780470612309
938 _aBooks 24x7
_bB247
_nbks00017557
938 _aEBSCOhost
_bEBSC
_n179261
938 _aYBP Library Services
_bYANK
_n3161127
938 _aYBP Library Services
_bYANK
_n2812280
938 _aYBP Library Services
_bYANK
_n3134143
994 _a92
_bINLUM
999 _c11406
_d11406