Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
A Toolkit for Constraint-Based Inference Engines
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Components for State Restoration in Tree Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Iterative-deepening-A: an optimal admissible tree search
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
| Hi-index | 0.00 |
Search is essential for constraint programming. Search engines typically combine several features like state restoration for backtracking, best solution search, parallelism, or visualization. In current implementations like Mozart, however, these search engines are monolithic and hard-wired to one exploration strategy, severely complicating the implementation of new exploration strategies and preventing their reuse. This paper presents the design of a search factory for Mozart, a program that enables the user to freely combine several orthogonal aspects of search, resulting in a search engine tailored to the user's needs. The abstractions developed here support fully automatic recomputation with last alternative optimization. They present a clean interface, making the implementation of new exploration strategies simple. Conservative extensions of the abstractions are presented that support best solution search and parallel search as orthogonal modules. IOzSeF, the Interactive Oz Search Factory, implements these abstractions and is freely available for download.