"Programming with constraints" - Information and Links:

Programming with constraints

an introduction

Book's cover
The cover of “Programming with constraints” - Open Library.

"Programming with constraints" is published by MIT Press in 1998 - Cambridge, Mass, it has 467 pages and the language of the book is English.


“Programming with constraints” Metadata:

  • Title: Programming with constraints
  • Author:
  • Language: English
  • Number of Pages: 467
  • Publisher: MIT Press
  • Publish Date:
  • Publish Location: Cambridge, Mass

“Programming with constraints” Subjects and Themes:

Edition Specifications:

  • Format: Hardcover
  • Pagination: xiv, 467 p. :

Edition Identifiers:

AI-generated Review of “Programming with constraints”:


"Programming with constraints" Table Of Contents:

  • 1- Table of Contents
  • 2- Preface
  • 3- Introduction
  • 4- Notes
  • 5- Constraints
  • 6- Constraints
  • 7- Constraints and Valuations
  • 8- Modelling with Constraints
  • 9- Constraint Satisfaction
  • 10- Tree Constraints
  • 11- Other Constraint Domains
  • 12- Properties of Constraint Solvers
  • 13- (*) Determined Variables and Local Propagation
  • 14- Summary
  • 15- Exercises
  • 16- Practical Exercises
  • 17- Notes
  • 18- Simplification, Optimization and Implication
  • 19- Constraint Simplification
  • 20- Projection
  • 21- Constraint Simplifiers
  • 22- Optimization
  • 23- The Simplex Algorithm
  • 24- (*) Canonical Form Simplifiers
  • 25- (*) Implication and Equivalence
  • 26- Summary
  • 27- Exercises
  • 28- Practical Exercises
  • 29- Notes
  • 30- Finite Constraint Domains
  • 31- Constraint Satisfaction Problems
  • 32- A Simple Backtracking Solver
  • 33- Node and Arc Consistency
  • 34- Bounds Consistency
  • 35- Generalized Consistency
  • 36- Optimization for Arithmetic CSPs
  • 37- Summary
  • 38- Exercises
  • 39- Practical Exercises
  • 40- Notes
  • 41- Constraint Logic Programming
  • 42- Constraint Logic Programs
  • 43- User-Defined Constraints
  • 44- Programming with Rules
  • 45- Evaluation
  • 46- Derivation Trees and Finite Failure
  • 47- Goal Evaluation
  • 48- Simplified Derivation Trees
  • 49- The CLP Scheme
  • 50- (*) Independence from Rule Ordering and Literal Selection
  • 51- Summary
  • 52- Exercises
  • 53- Practical Exercises
  • 54- Notes
  • 55- Simple Modelling
  • 56- Simple Modelling
  • 57- Modelling Choice
  • 58- Iteration
  • 59- Optimization
  • 60- Summary
  • 61- Practical Exercises
  • 62- Notes
  • 63- Using Data Structures
  • 64- Records
  • 65- Lists
  • 66- Association Lists
  • 67- Binary Trees
  • 68- Hierarchical Modelling
  • 69- Tree Layout
  • 70- Summary
  • 71- Practical Exercises
  • 72- Notes
  • 73- Controlling Search
  • 74- Estimating the Efficiency of a CLP Program
  • 75- Controlling Search: An Example
  • 76- Rule Ordering
  • 77- Literal Ordering
  • 78- Adding Redundant Constraints
  • 79- Minimization
  • 80- Identifying Deterministic Subgoals
  • 81- An Extended Example: Bridge Building
  • 82- Summary
  • 83- Exercises
  • 84- Practical Exercises
  • 85- Notes
  • 86- Modelling with Finite Domain Constraints
  • 87- Domains and Labelling
  • 88- Complex Constraints
  • 89- Labelling
  • 90- Different Problem Modellings
  • 91- An Extended Example: Scheduling
  • 92- (*) Arc Consistency
  • 93- (*) Library Predicates
  • 94- Summary
  • 95- Practical Exercises
  • 96- Notes
  • 97- Advanced Programming Techniques
  • 98- Extending the Constraint Solver
  • 99- Combined Symbolic and Arithmetic Reasoning
  • 100- Programming Optimization
  • 101- Higher-order Predicates
  • 102- Negation
  • 103- CLP Languages with Dynamic Scheduling
  • 104- (*) Meta Programming
  • 105- (*) Library Predicates
  • 106- Summary
  • 107- Practical Exercises
  • 108- Notes
  • 109- CLP Systems
  • 110- Simple Backtracking Goal Evaluation
  • 111- Incremental Constraint Solving
  • 112- Efficient Saving and Restoring of the Constraint Store
  • 113- Implementing If-Then-Else, Once and Negation
  • 114- Optimization
  • 115- Other Incremental Constraint Solvers
  • 116- (*) Incremental Real Arithmetic Solving
  • 117- Summary
  • 118- Exercises
  • 119- Notes
  • 120- Other Constraint Programming Languages
  • 121- Constraint Databases
  • 122- Modelling with Constraint Databases
  • 123- Bottom Up Evaluation
  • 124- Bottom-Up versus Top-Down
  • 125- Mimicking Top-Down Evaluation Bottom-Up
  • 126- (*) Improving Termination
  • 127- (*) Relationship with Relational Databases
  • 128- Summary
  • 129- Exercises
  • 130- Practical Exercises
  • 131- Notes
  • 132- Other Constraint Programming Languages
  • 133- The CLP Paradigm
  • 134- Concurrent Constraint Programming Languages
  • 135- Constraint Handling Rules
  • 136- Functional Languages
  • 137- Term Rewriting
  • 138- Imperative Programming Languages
  • 139- Constraint Solving Toolkits
  • 140- Mathematical Languages
  • 141- Notes
  • 142- References
  • 143- Index

Read “Programming with constraints”:

Read “Programming with constraints” by choosing from the options below.

Search for “Programming with constraints” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Programming with constraints” in Libraries Near You:

Read or borrow “Programming with constraints” from your local library.

Buy “Programming with constraints” online:

Shop for “Programming with constraints” on popular online marketplaces.