arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.1095cs.AI
收藏

搜索组合器

Search Combinators

Monash University(莫纳什大学);Universiteit Gent(根特大学);Katholieke Universiteit Leuven(鲁汶大学);IBM Research(IBM研究院);National ICT Australia (NICTA)(澳大利亚国家信息与通信技术研究院(NICTA));University of Melbourne(墨尔本大学)

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

摘要:

在约束求解器中进行模型搜索的能力对于解决组合问题来说是一项重要的资产。然而,现有的基础设施定义搜索引擎往往是不够的。要么建模能力极其有限,要么用户面对的是一种通用程序设计语言,其功能并不适合编写搜索引擎。因此,性能方面的重大改进可能仍未得到探索。本文介绍了搜索组合子,这是一种轻量级和独立于求解器的方法,它弥合了概念上简单的搜索建模语言(高级,功能性和自然组合)与高效实现(低级,命令式和高度非模块化)之间的差距。通过允许用户从一小组原语定义应用定制的搜索策略,搜索组合器有效地为用户提供了用于建模搜索的丰富的域特定语言(DSL)。值得注意的是,对于约束求解器的开发人员来说,这种DSL的实现成本很低。本文讨论了两个模块化的实现方法,并显示,通过实证评估,搜索组合子可以实现没有开销相比,一个本地的,直接实现约束求解器。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑