Computer Science – Artificial Intelligence
Scientific paper
2012-03-06
Computer Science
Artificial Intelligence
Scientific paper
The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver. The article discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver.
Samulowitz Horst
Schrijvers Tom
Stuckey Peter J.
Tack Guido
Wuille Pieter
No associations
LandOfFree
Search Combinators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Search Combinators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search Combinators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-536721