TOAST: Applying answer set programming to superoptimisation
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
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.
|Item Type||Conference or Workshop Items (UNSPECIFIED)|
|Creators||Brain, M., Crick, T., De Vos, M. and Fitch, J.|
|Departments||Faculty of Science > Computer Science|
|Additional Information||ID number: ISI:000240061200019|
Actions (login required)