Introduction / 1: |
Constraint Programming / 1.1: |
Motivation / 1.2: |
Approach / 1.3: |
Outline / 1.4: |
Source Material / 1.5: |
Constraints / 2: |
Search / 2.2: |
Programming / 2.3: |
Introducing Oz Light / 3: |
Overview / 3.1: |
Oz Light: Basics / 3.2: |
The Store / 3.2.1: |
Threads / 3.2.2: |
Statements / 3.2.3: |
Oz Light Continued / 3.3: |
Primitive Operations / 3.3.1: |
Exceptions / 3.3.2: |
Ports and Active Services / 3.3.3: |
Finite Domain Constraints / 3.3.4: |
Syntactic Convenience / 3.4: |
Relation to Full Oz / 3.5: |
Spaces for Search / 4: |
Local Computation Spaces / 4.1: |
Space Manipulation / 4.3: |
Space Creation / 4.3.1: |
Merging Spaces / 4.3.2: |
Injecting into Spaces / 4.3.3: |
Control and Status / 4.4: |
Alternatives / 4.5: |
Distributable Spaces / 4.5.2: |
Synchronizing on Stability / 4.5.3: |
Committing to Alternatives / 4.5.4: |
Cloning Spaces / 4.5.5: |
Refining Commit / 4.5.6: |
Situated Procedure Calls: Services Reconsidered / 4.6: |
Previous Work: Solve Combinator / 4.7: |
Summary / 4.8: |
Search Engines / 5: |
Depth-First Search / 5.1: |
Simplifying Control: Exceptions / 5.2: |
Binarization / 5.3: |
Multiple Solutions / 5.4: |
Explicit State Representation / 5.5: |
Limited Discrepancy Search / 5.6: |
Best-First Search / 5.7: |
Best-Solution Search / 6: |
Constraining Spaces / 6.1: |
Iterative Best-Solution Search / 6.2: |
Branch-and-Bound Best-Solution Search / 6.3: |
An Alternative Formulation of BAB / 6.4: |
Prune-Search: Generalizing BAB / 6.5: |
Recomputation / 7: |
Full Recomputation / 7.1: |
Fixed Recomputation / 7.3: |
Why Recomputation Matters / 7.4: |
Adaptive Recomputation / 7.5: |
Oz Explorer: Visual Search / 8: |
Development of Constraint Programs / 8.1: |
Example: Aligning for a Photo / 8.2: |
Features / 8.3: |
Implementation / 8.4: |
Evaluation / 8.5: |
Related Work / 8.6: |
Distributed Search / 9: |
Distributed Oz / 9.1: |
Architecture / 9.3: |
Cooperation / 9.3.1: |
Worker / 9.3.2: |
Manager / 9.3.3: |
Distributed Search Engines / 9.3.4: |
Spaces for Combinators / 9.5: |
Space Tree / 10.1: |
Space Tree Manipulation / 10.3: |
Stability / 10.3.1: |
Status Variable / 10.4.2: |
Debugging Support / 10.4.3: |
Choice of Programming Language / 10.5: |
Constraint Combinators / 11: |
Concurrent Negation / 11.1: |
Generic Reification / 11.3: |
Disjunction / 11.4: |
Conditional / 11.5: |
Andorra-Style Disjunction / 11.6: |
Discussion and Evaluation / 11.7: |
Implementing Oz Light / 12: |
Synchronization / 12.1: |
Store / 12.3: |
Scheduler / 12.4: |
Implementing Spaces / 13: |
Nodes and Links / 13.1: |
The Store: Model / 13.2.2: |
The Store: Implementation / 13.2.4: |
Runnable Threads / 13.3: |
Globally Suspended Threads / 13.3.2: |
Speculative Constraints / 13.3.3: |
Local Threads / 13.3.4: |
Checking Stability / 13.3.5: |
Merge / 13.4: |
Choose and Commit / 13.5: |
Richer Basic Constraints / 13.5.2: |
Variable Aliasing / 13.6.1: |
Tree Constraints / 13.6.2: |
Ports / 13.6.3: |
Performance Overview / 13.8: |
Other Approaches to Search / 14: |
Other Constraint Programming Systems / 14.1: |
Comparison with Trailing / 14.2: |
Expressiveness / 14.2.1: |
Implementation Issues / 14.2.2: |
Criteria and Examples / 14.2.3: |
Copying / 14.2.4: |
Copying versus Trailing / 14.2.5: |
Recomputation versus Trailing / 14.2.6: |
System Comparison / 14.3: |
Conclusion / 15: |
Main Contributions / 15.1: |
Future Work / 15.2: |
Benchmark Problems and Platforms / A: |
Benchmark Problems / A.1: |
Sequential Platform / A.2: |
Distributed Platform / A.3: |
References |
Index |
Introduction / 1: |
Constraint Programming / 1.1: |
Motivation / 1.2: |
Approach / 1.3: |
Outline / 1.4: |
Source Material / 1.5: |