Principles of Constraint Programming

Couverture
Cambridge University Press, 28 août 2003 - 407 pages
Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis. This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence
 

Table des matières

II
1
IV
3
V
5
VI
6
VIII
8
IX
9
X
11
XI
16
XCV
221
XCVI
222
XCVII
224
XCVIII
225
XCIX
231
C
234
CI
236
CII
240

XII
19
XIII
21
XIV
43
XV
47
XVI
48
XVII
51
XVIII
52
XIX
54
XX
55
XXI
58
XXII
59
XXIII
60
XXIV
61
XXVI
64
XXVII
66
XXVIII
70
XXIX
71
XXX
74
XXXI
80
XXXII
81
XXXIII
82
XXXIV
83
XXXV
84
XXXVI
87
XXXVII
92
XXXVIII
93
XXXIX
94
XL
95
XLI
98
XLII
99
XLIII
103
XLIV
107
XLVI
110
XLVII
111
XLVIII
112
XLIX
115
L
118
LI
121
LIII
122
LIV
123
LV
124
LVI
131
LVIII
132
LIX
133
LX
135
LXI
136
LXII
138
LXIII
143
LXIV
144
LXV
147
LXVI
155
LXVII
157
LXVIII
164
LXIX
166
LXX
170
LXXI
175
LXXIII
176
LXXV
178
LXXVI
180
LXXVII
181
LXXVIII
184
LXXIX
185
LXXX
186
LXXXI
187
LXXXII
189
LXXXIII
190
LXXXIV
192
LXXXV
194
LXXXVI
197
LXXXVII
198
LXXXVIII
199
LXXXIX
200
XC
204
XCI
209
XCII
211
XCIII
215
XCIV
219
CIII
243
CIV
246
CV
249
CVI
252
CVII
254
CIX
259
CX
262
CXI
266
CXII
267
CXIII
269
CXIV
271
CXV
273
CXVI
275
CXVII
279
CXVIII
281
CXIX
284
CXX
285
CXXI
288
CXXII
289
CXXIII
293
CXXIV
295
CXXV
297
CXXVI
299
CXXVII
301
CXXVIII
302
CXXIX
306
CXXX
308
CXXXI
311
CXXXII
313
CXXXIV
317
CXXXV
319
CXXXVI
322
CXXXVII
323
CXXXVIII
325
CXXXIX
327
CXL
328
CXLI
330
CXLIII
331
CXLIV
332
CXLV
333
CXLVIII
335
CXLIX
337
CLI
339
CLII
341
CLIII
342
CLIV
345
CLVI
346
CLVII
347
CLVIII
349
CLIX
350
CLXI
351
CLXII
354
CLXIII
356
CLXIV
357
CLXV
358
CLXVI
360
CLXVII
361
CLXVIII
362
CLXIX
364
CLXXI
365
CLXXII
366
CLXXIII
367
CLXXV
368
CLXXVI
369
CLXXVII
370
CLXXVIII
373
CLXXIX
376
CLXXX
377
CLXXXI
378
CLXXXII
379
CLXXXIII
381
CLXXXIV
382
CLXXXVI
385
CLXXXVII
399
CLXXXVIII
402
Droits d'auteur

Autres éditions - Tout afficher

Expressions et termes fréquents

Fréquemment cités

Page 385 - Unification theory, in: Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 2, Deduction Methodologies, DM Gabbay, CJ Hogger.

Informations bibliographiques