Search Combinators
Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz, Peter J., Stuckey

TL;DR
Search combinators offer a lightweight, solver-independent way to model and implement custom search strategies in constraint solvers, bridging the gap between high-level modeling and low-level efficiency.
Contribution
The paper introduces search combinators as a new DSL for search strategies, enabling efficient, modular, and application-specific search modeling in constraint solvers.
Findings
Empirical evaluation shows no overhead compared to native implementations.
Search combinators are solver-independent and highly compositional.
Implementation approaches are modular and low-cost.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Data Management and Algorithms · AI-based Problem Solving and Planning
