| 1.Introduction 1.1 Constraint Programming 1.2 Motivation 1.3 Approach 1.4 Outline 1.5 Source Material 2.Constraint Programming 2.1 Constraints 2.2 Search 2.3 Programming 3.Introducing Oz Light 3.1 Overview 3.2 Oz Light: Basics 3.2.1 The Store 3.2.2 Threads 3.2.3 Statements 3.3 Oz Light Continued 3.3.1 Primitive Operations 3.3.2 Exceptions 3.3.3 Ports and Active Services 3.3.4 Finite Domain Constraints 3.4 Syntactic Convenience 3.5 Relation to Full Oz 4.Spaces for Search 4.1 Overview 4.2 Local Computation Spaces 4.3 Space Manipulation 4.3.1 Space Creation 4.3.2 Merging Spaces 4.3.3 Injecting into Spaces 4.4 Control and Status 4.5 Search 4.5.1 Alternatives 4.5.2 Distributable Spaces 4.5.3 Synchronizing on Stability 4.5.4 Committing to Alternatives 4.5.5 Cloning Spaces 4.5.6 Refining Commit 4.6 Situated Procedure Calls: Services Reconsidered 4.7 Previous Work: Solve Combinator 4.8 Summary 5.Search Engines 5.1 Depth-First Search 5.2 Simplifying Control: Exceptions 5.3 Binarization 5.4 Multiple Solutions 5.5 Explicit State Representation 5.6 Limited Discrepancy Search 5.7 Best-First Search 6.Best-Solution Search 6.1 Constraining Spaces 6.2 Iterative Best-Solution Search 6.3 Branch-and-Bound Best-Solution Search 6.4 An Alternative Formulation of BAB 6.5 Prune-Search: Generalizing BAB 7.Recomputation 7.1 Overview 7.2 Full Recomputation 7.3 Fixed Recomputation 7.4 Why Recomputation Matters 7.5 Adaptive Recomputation 8.Oz Explorer: Visual Search 8.1 Development of Constraint Programs 8.2 Example: Aligning for a Photo 8.3 Features 8.4 Implementation 8.5 Evaluation 8.6 Related Work 9.Distributed Search 10.Spaces for Combinators 11.Constraint Combinators 12.Implementing Oz Light 13.Implementing Spaces 14.Other Approaches to Search 15.Conclusion A.Benchmark Problems and Platforms References Index |
内容加载中，请稍后...
商品评论（0条）