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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Brain, M., Crick, T., De Vos, M., & Fitch, J. (2006). TOAST: Applying answer set programming to superoptimisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 270–284). Springer Verlag. https://doi.org/10.1007/11799573_21
Mendeley helps you to discover research relevant for your work.