TOAST: Applying answer set programming to superoptimisation
TOAST: Applying answer set programming to superoptimisation
复制标题
DOI：
10.1007/11799573_21
复制
发表时间：
2006-01-01
期刊：
影响因子：
--
通讯作者：
Fitch, John
中科院分区：
文献类型：
--
作者：
Brain, Martin;Crick, Tom;Fitch, John
答案集编程（ASP）是一种声明式编程的形式，特别适合于困难的组合搜索问题。然而，它还没有被用于超过少数大规模的应用程序，这是需要展示ASP的优势，并激励开发的工具和方法。本文介绍了这样一个大规模的应用程序，吐司（总优化使用答案集技术）系统，它旨在产生最佳的机器代码简单，非循环功能使用的技术称为超优化。ASP被用来作为一个可扩展的计算引擎来处理复杂的，不规则的搜索空间的搜索，与实验结果表明，这是一个可行的方法来优化问题，并展示了各种解决方案的可扩展性。
Answer set programming (ASP) is a form of declarative programming particularly suited to difficult combinatorial search problems. However, it has yet to be used for more than a handful of large-scale applications, which are needed to demonstrate the strengths of ASP and to motivate the development of tools and methodology. This paper describes such a large-scale application, the TOAST (Total Optimisation using Answer Set Technology) system, which seeks to generate optimal machine code for simple, acyclic functions using a technique known as superoptimisation. ASP is used as a scalable computational engine to handle searching over complex, non-regular search spaces, with the experimental results suggesting that this is a viable approach to the optimisation problem and demonstrates the scalability of a variety of solvers.