Programming with constraints
Subtitle: an introduction
By: Kim Marriott and Peter J. Stuckey.
Contributors: Stuckey, Peter J.
Publisher: MIT Press
Published: 1998
Place of publication: Cambridge, Mass
Language: eng
Format: Hardcover
Number of pages: 467
Subjects: Logic programming.; Constraint programming (Computer science)
Notes: Includes bibliographical references and index.
Table of contents: title: Table of Contents
pagenum: vii; title: Preface
pagenum: xi; title: Introduction
pagenum: 1; title: Notes
pagenum: 6; label: I
title: Constraints
pagenum: 9; label: 1
title: Constraints
pagenum: 11; label: 1.1
title: Constraints and Valuations
pagenum: 11; label: 1.2
title: Modelling with Constraints
pagenum: 15; label: 1.3
title: Constraint Satisfaction
pagenum: 18; label: 1.4
title: Tree Constraints
pagenum: 22; label: 1.5
title: Other Constraint Domains
pagenum: 27; label: 1.6
title: Properties of Constraint Solvers
pagenum: 33; label: 1.7
title: (*) Determined Variables and Local Propagation
pagenum: 35; label: 1.8
title: Summary
pagenum: 41; label: 1.9
title: Exercises
pagenum: 42; label: 1.10
title: Practical Exercises
pagenum: 43; label: 1.11
title: Notes
pagenum: 47; label: 2
title: Simplification, Optimization and Implication
pagenum: 51; label: 2.1
title: Constraint Simplification
pagenum: 51; label: 2.2
title: Projection
pagenum: 53; label: 2.3
title: Constraint Simplifiers
pagenum: 57; label: 2.4
title: Optimization
pagenum: 61; label: 2.5
title: The Simplex Algorithm
pagenum: 63; label: 2.6
title: (*) Canonical Form Simplifiers
pagenum: 72; label: 2.7
title: (*) Implication and Equivalence
pagenum: 75; label: 2.8
title: Summary
pagenum: 78; label: 2.9
title: Exercises
pagenum: 79; label: 2.10
title: Practical Exercises
pagenum: 80; label: 2.11
title: Notes
pagenum: 83; label: 3
title: Finite Constraint Domains
pagenum: 85; label: 3.1
title: Constraint Satisfaction Problems
pagenum: 86; label: 3.2
title: A Simple Backtracking Solver
pagenum: 88; label: 3.3
title: Node and Arc Consistency
pagenum: 91; label: 3.4
title: Bounds Consistency
pagenum: 97; label: 3.5
title: Generalized Consistency
pagenum: 109; label: 3.6
title: Optimization for Arithmetic CSPs
pagenum: 114; label: 3.7
title: Summary
pagenum: 120; label: 3.8
title: Exercises
pagenum: 122; label: 3.9
title: Practical Exercises
pagenum: 123; label: 3.10
title: Notes
pagenum: 127; label: II
title: Constraint Logic Programming
pagenum: 131; label: 4
title: Constraint Logic Programs
pagenum: 133; label: 4.1
title: User-Defined Constraints
pagenum: 137; label: 4.2
title: Programming with Rules
pagenum: 140; label: 4.3
title: Evaluation
pagenum: 143; label: 4.4
title: Derivation Trees and Finite Failure
pagenum: 146; label: 4.5
title: Goal Evaluation
pagenum: 149; label: 4.6
title: Simplified Derivation Trees
pagenum: 151; label: 4.7
title: The CLP Scheme
pagenum: 153; label: 4.8
title: (*) Independence from Rule Ordering and Literal Selection
pagenum: 158; label: 4.9
title: Summary
pagenum: 158; label: 4.10
title: Exercises
pagenum: 158; label: 4.11
title: Practical Exercises
pagenum: 160; label: 4.12
title: Notes
pagenum: 164; label: 5
title: Simple Modelling
pagenum: 167; label: 5.1
title: Simple Modelling
pagenum: 167; label: 5.2
title: Modelling Choice
pagenum: 169; label: 5.3
title: Iteration
pagenum: 174; label: 5.4
title: Optimization
pagenum: 179; label: 5.5
title: Summary
pagenum: 181; label: 5.6
title: Practical Exercises
pagenum: 181; label: 5.7
title: Notes
pagenum: 184; label: 6
title: Using Data Structures
pagenum: 185; label: 6.1
title: Records
pagenum: 186; label: 6.2
title: Lists
pagenum: 188; label: 6.3
title: Association Lists
pagenum: 193; label: 6.4
title: Binary Trees
pagenum: 198; label: 6.5
title: Hierarchical Modelling
pagenum: 201; label: 6.6
title: Tree Layout
pagenum: 203; label: 6.7
title: Summary
pagenum: 208; label: 6.8
title: Practical Exercises
pagenum: 208; label: 6.9
title: Notes
pagenum: 211; label: 7
title: Controlling Search
pagenum: 213; label: 7.1
title: Estimating the Efficiency of a CLP Program
pagenum: 213; label: 7.2
title: Controlling Search: An Example
pagenum: 217; label: 7.3
title: Rule Ordering
pagenum: 220; label: 7.4
title: Literal Ordering
pagenum: 220; label: 7.5
title: Adding Redundant Constraints
pagenum: 223; label: 7.6
title: Minimization
pagenum: 227; label: 7.7
title: Identifying Deterministic Subgoals
pagenum: 230; label: 7.8
title: An Extended Example: Bridge Building
pagenum: 235; label: 7.9
title: Summary
pagenum: 246; label: 7.10
title: Exercises
pagenum: 247; label: 7.11
title: Practical Exercises
pagenum: 248; label: 7.12
title: Notes
pagenum: 250; label: 8
title: Modelling with Finite Domain Constraints
pagenum: 251; label: 8.1
title: Domains and Labelling
pagenum: 252; label: 8.2
title: Complex Constraints
pagenum: 256; label: 8.3
title: Labelling
pagenum: 258; label: 8.4
title: Different Problem Modellings
pagenum: 266; label: 8.5
title: An Extended Example: Scheduling
pagenum: 272; label: 8.6
title: (*) Arc Consistency
pagenum: 281; label: 8.7
title: (*) Library Predicates
pagenum: 284; label: 8.8
title: Summary
pagenum: 285; label: 8.9
title: Practical Exercises
pagenum: 286; label: 8.10
title: Notes
pagenum: 291; label: 9
title: Advanced Programming Techniques
pagenum: 293; label: 9.1
title: Extending the Constraint Solver
pagenum: 293; label: 9.2
title: Combined Symbolic and Arithmetic Reasoning
pagenum: 298; label: 9.3
title: Programming Optimization
pagenum: 301; label: 9.4
title: Higher-order Predicates
pagenum: 307; label: 9.5
title: Negation
pagenum: 309; label: 9.6
title: CLP Languages with Dynamic Scheduling
pagenum: 313; label: 9.7
title: (*) Meta Programming
pagenum: 320; label: 9.8
title: (*) Library Predicates
pagenum: 324; label: 9.9
title: Summary
pagenum: 342; label: 9.10
title: Practical Exercises
pagenum: 343; label: 9.11
title: Notes
pagenum: 346; label: 10
title: CLP Systems
pagenum: 349; label: 10.1
title: Simple Backtracking Goal Evaluation
pagenum: 349; label: 10.2
title: Incremental Constraint Solving
pagenum: 352; label: 10.3
title: Efficient Saving and Restoring of the Constraint Store
pagenum: 358; label: 10.4
title: Implementing If-Then-Else, Once and Negation
pagenum: 361; label: 10.5
title: Optimization
pagenum: 366; label: 10.6
title: Other Incremental Constraint Solvers
pagenum: 369; label: 10.7
title: (*) Incremental Real Arithmetic Solving
pagenum: 376; label: 10.8
title: Summary
pagenum: 385; label: 10.9
title: Exercises
pagenum: 385; label: 10.10
title: Notes
pagenum: 387; label: III
title: Other Constraint Programming Languages
pagenum: 389; label: 11
title: Constraint Databases
pagenum: 391; label: 11.1
title: Modelling with Constraint Databases
pagenum: 391; label: 11.2
title: Bottom Up Evaluation
pagenum: 395; label: 11.3
title: Bottom-Up versus Top-Down
pagenum: 405; label: 11.4
title: Mimicking Top-Down Evaluation Bottom-Up
pagenum: 407; label: 11.5
title: (*) Improving Termination
pagenum: 412; label: 11.6
title: (*) Relationship with Relational Databases
pagenum: 416; label: 11.7
title: Summary
pagenum: 421; label: 11.8
title: Exercises
pagenum: 422; label: 11.9
title: Practical Exercises
pagenum: 422; label: 11.10
title: Notes
pagenum: 423; label: 12
title: Other Constraint Programming Languages
pagenum: 425; label: 12.1
title: The CLP Paradigm
pagenum: 425; label: 12.2
title: Concurrent Constraint Programming Languages
pagenum: 427; label: 12.3
title: Constraint Handling Rules
pagenum: 430; label: 12.4
title: Functional Languages
pagenum: 433; label: 12.5
title: Term Rewriting
pagenum: 436; label: 12.6
title: Imperative Programming Languages
pagenum: 439; label: 12.7
title: Constraint Solving Toolkits
pagenum: 440; label: 12.8
title: Mathematical Languages
pagenum: 443; label: 12.9
title: Notes
pagenum: 447; title: References
pagenum: 449; title: Index
pagenum: 459