zbMATH — the first resource for mathematics

TOAST: Applying answer set programming to superoptimisation. (English) Zbl 1131.68367
Etalle, Sandro (ed.) et al., Logic programming. 22nd international conference, ICLP 2006, Seattle, WA, USA, August 17–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-36635-5/pbk). Lecture Notes in Computer Science 4079, 270-284 (2006).
Summary: 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.
For the entire collection see [Zbl 1130.68008].

68N17 Logic programming
Full Text: DOI