HOME > 상세정보

상세정보

Principles of constraint programming

Principles of constraint programming (1회 대출)

자료유형
단행본
개인저자
Apt, Krzysztof R. , 1949-.
서명 / 저자사항
Principles of constraint programming / Krzysztof R. Apt.
발행사항
Cambridge ;   New York :   Cambridge University Press ,   2003   (2006 reprint)  
형태사항
xii, 407 p. : ill. ; 26 cm.
ISBN
0521825830 (hardback) 9780521825832
서지주기
Includes bibliographical references (p. 387-400) and indexes.
일반주제명
Constraint programming (Computer science)
000 00949camuu22002777a 4500
001 000045428373
005 20080321104656
008 030513s2003 enka b 001 0 eng
010 ▼a 2003278560
015 ▼a GBA3-W9703
020 ▼a 0521825830 (hardback)
020 ▼a 9780521825832
035 ▼a (KERIS)REF000009840543
040 ▼a UKM ▼c UKM ▼d IXA ▼d C#P ▼d DLC ▼d 211009
042 ▼a lccopycat
050 0 0 ▼a QA76.612 ▼b .A68 2003
082 0 4 ▼a 005.11 ▼2 22
090 ▼a 005.11 ▼b A655p
100 1 ▼a Apt, Krzysztof R. , ▼d 1949-.
245 1 0 ▼a Principles of constraint programming / ▼c Krzysztof R. Apt.
260 ▼a Cambridge ; ▼a New York : ▼b Cambridge University Press , ▼c 2003 ▼g (2006 reprint)
300 ▼a xii, 407 p. : ▼b ill. ; ▼c 26 cm.
504 ▼a Includes bibliographical references (p. 387-400) and indexes.
650 0 ▼a Constraint programming (Computer science)
945 ▼a KINS

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 005.11 A655p 등록번호 121167264 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차


CONTENTS
Acknowledgements = xi
1 Introduction = 1
 1.1 Basic characteristics of constraint programming = 1
 1.2 Applications of constraint programming = 3
 1.3 A very short history of the subject = 5
 1.4 Our approach = 6
 1.5 Organisation of the book = 6
2 Constraint satisfaction problems : examples = 8
 2.1 Basic concepts = 9
 2.2 Constraint satisfaction problems on integers = 11
 2.3 Constraint satisfaction problems on reals = 16
 2.4 Boolean constraint satisfaction problems = 19
 2.5 Symbolic constraint satisfaction problems = 21
 2.6 Constrained optimization problems = 43
 2.7 Summary = 47
 2.8 Exercises = 48
 2.9 Bibliographic remarks = 51
 2.10 References = 52
3 Constraint programming in a nutshell = 54
 3.1 Equivalence of CSPs = 55
 3.2 Basic framework for constraint programming = 58
  3.2.1 PREPROCESS = 59
  3.2.2 HAPPY = 60
  3.2.3 ATOMIC = 61
  3.2.4 SPLIT = 61
  3.2.5 PROCEED BY CASES = 64
  3.2.6 CONSTRAINT PROPAGATION = 66
  3.2.7 Constraint propagation algorithms = 70
 3.3 Example : Boolean constraints = 71
 3.4 Example : polynomial constraints on integer intervals = 74
 3.5 Summary = 80
 3.6 Bibliographic remarks = 81
4 Some complete constraint solvers = 82
 4.1 A proof theoretical framework = 83
  4.1.1 Proof rules = 84
  4.1.2 Derivations = 87
 4.2 Term equations = 92
  4.2.1 Terms = 93
  4.2.2 Substitutions = 94
  4.2.3 Unifiers and mgus = 95
  4.2.4 Unification problem and solving CSPs = 98
  4.2.5 The UNIF proof system = 99
  4.2.6 The MARTELLI-MONTANARI algorithm = 103
 4.3 Linear equations over reals = 107
  4.3.1 Linear expressions and linear euqations = 107
  4.3.2 Substitutions, unifiers and mgus = 110
  4.3.3 Linear quations and CSPs = 111
  4.3.4 The LIN proof system = 112
  4.3.5 The GAUSS-JORDAN ELIMINATION algorithm = 115
  4.3.6 The GAUSSIAN ELIMINATION algorithm = 118
 4.4 Linear inequalities over reals = 121
  4.4.1 Syntax = 121
  4.4.2 Linear inequalities and CSPs = 122
  4.4.3 The INEQ proof system = 123
  4.4.4 The FOURIER-MOTZKIN ELIMINATION algorithm = 124
 4.5 Summary = 131
 4.6 Exercises = 131
 4.7 Bibliographic remarks = 132
 4.8 References = 133
5 Local consistency notions = 135
 5.1 Node consistency = 136
 5.2 Arc consistency = 138
 5.3 Hyper-arc consistency = 143
 5.4 Directional arc consistency = 144
 5.5 Path consistency = 147
 5.6 Directional path consistency = 155
 5.7 k-consistency = 157
 5.8 Strong k-consistency = 164
 5.9 Relational consistency = 166
 5.10 Graphs and CSPs = 170
 5.11 Summary = 175
 5.12 Exercises = 175
 5.13 Bibliographic remarks = 176
 5.14 References = 176
6 Some incomplete constraint solvers = 178
 6.1 A useful lemma = 180
 6.2 Equality and disequality constraints = 181
 6.3 Boolean constraints = 184
  6.3.1 Transformation rules = 185
  6.3.2 Domain reduction rules = 186
  6.3.3 Example : full adder circuit = 188
  6.3.4 A characterisation of the system BOOL = 191
 6.4 Linear constraints on integer intervals = 192
  6.4.1 Domain reduction rules for inequality constraints = 194
  6.4.2 Domain reduction rules for equality constraints = 196
  6.4.3 Rules for disequality constraints = 199
  6.4.4 Rules for strict inequality constraints = 200
  6.4.5 Shifting from intervals to finite domains = 200
  6.4.6 Example : the SEND+MORE=MONEY puzzle = 201
  6.4.7 Bounds consistency = 202
  6.4.8 A characterization of the LINEAR EQUALITY rule = 206
 6.5 Arithmetic constraints on integer intervals = 211
  6.5.1 Domain reduction rules : first approach = 211
  6.5.2 Domain reduction rules : second approach = 213
  6.5.3 Domain reduction rules : third approach = 217
  6.5.4 Implementation of the third approach = 221
  6.5.5 Shifting from intervals to finite domains = 223
 6.6 Arithmetic constraints on reals = 224
  6.6.1 Interval arithmetic = 226
  6.6.2 Domain reduction rules = 227
  6.6.3 Implementation issues = 233
  6.6.4 Using floating-point intervals = 236
  6.6.5 Correctness and efficiency issues = 238
 6.7 Arithmetic equations over reals = 242
 6.8 Summary = 245
 6.9 Exercises = 245
 6.10 Bibliographic remarks = 248
 6.11 References = 251
7 Constraint propagation algorithms = 254
 7.1 Generic iteration algorithms = 256
  7.1.1 Iterations = 256
  7.1.2 Algorithms for arbitrary partial orderings = 261
  7.1.3 Algorithms for cartesian products of partial orderings = 264
 7.2 From partial orderings to CSPs = 268
 7.3 A node consistency algorithm = 269
 7.4 An arc consistency algorithm = 271
 7.5 A hyper-arc consistency algorithm = 273
 7.6 A directional arc consistency algorithm = 275
 7.7 A path consistency algorithm = 277
 7.8 A directional path consistency algorithm = 281
 7.9 A k-consistency algorithm = 283
 7.10 A relational consistency algorithm = 286
 7.11 Implementations of incomplete constraint solvers = 287
 7.12 Summary = 290
 7.13 Exercises = 291
 7.14 Bibliographic remarks = 295
 7.15 References = 297
8 Search = 299
 8.1 Search trees = 301
 8.2 Labeling trees = 303
  8.2.1 Complete labeling trees = 304
  8.2.2 Reduced labeling trees = 308
  8.2.3 prop labeling trees = 310
 8.3 An example : SEND+MORE=MONEY = 313
 8.4 Instances of prop labeling trees = 315
  8.4.1 Forward checking = 315
  8.4.2 Partial look ahead = 319
  8.4.3 Maintaining arc consistency(MAC) = 321
 8.5 Search algorithms for the labeling trees = 324
  8.5.1 Backtrack-free search = 325
  8.5.2 Backtrack-free search with constraint propagation = 327
  8.5.3 Backtracking = 329
  8.5.4 Backtracking with constraint propagation = 330
 8.6 Instances of backtracking with constraint propagation = 332
  8.6.1 Forward checking = 332
  8.6.2 Partial look ahead = 333
  8.6.3 Maintaining are consistency(MAC) = 334
  8.6.4 Searching for all solutions = 335
 8.7 Search algorithms for finite constrained optimization problems = 335
  8.7.1 Branch and bound = 337
  8.7.2 Branch and bound with constraint propagation = 339
  8.7.3 Branch and bound with constraint propagation and cost constraint = 339
 8.8 Heuristics for search algorithms = 341
  8.8.1 Variable selection = 341
  8.8.2 Value selection = 343
 8.9 An abstract branch and bound algorithm = 344
 8.10 Summary = 347
 8.11 Exercises = 347
 8.12 Bibliographic remarks = 348
 8.13 References = 349
9 Issues in constraint programming = 351
 9.1 Modeling = 352
  9.1.1 Choosing the right variables = 352
  9.1.2 Choosing the right constraints = 353
  9.1.3 Choosing the right representation = 356
  9.1.4 Global constraints = 358
 9.2 Constraint programming languages = 359
  9.2.1 Constraint logic programming = 360
  9.2.2 ILOG solver = 362
  9.2.3 Generation of constraints = 363
 9.3 Constraint propagation = 364
 9.4 Constraint solvers = 366
  9.4.1 Building constraint solvers = 366
  9.4.2 Incrementality = 367
  9.4.3 Simplification of constraints = 368
 9.5 Search = 369
  9.5.1 Search in modeling languages = 369
  9.5.2 Depth-first search : backtracking and branch and bound = 370
  9.5.3 Breadth-first search and limited discrepancy search = 371
  9.5.4 Local search = 372
  9.5.5 Search in constraint programming languages = 375
  9.5.6 Biology-inspired approaches = 378
 9.6 Over-constrained problems = 379
  9.6.1 Partial, weighted and fuzzy CSPs = 380
  9.6.2 Constraint hierarchies = 381
  9.6.3 Generalisations = 383
  9.6.4 Reified constraints = 383
 9.7 Summary = 384
 9.8 Bibliographic remarks = 384
Bibliography = 387
Author index = 401
Subject index = 404


관련분야 신착자료

Ramamurthy, Bina (2021)
윤관식 (2020)