Book chapter 839 views 312 downloads
TOAST: Applying Answer Set Programming to Superoptimisation
Logic Programming, Volume: 4079
Swansea University Author: Tom Crick
-
PDF | Accepted Manuscript
Download (139.78KB)
DOI (Published version): 10.1007/11799573_21
Abstract
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 o...
Published in: | Logic Programming |
---|---|
ISBN: | 978-3-540-36635-5 978-3-540-36636-2 |
ISSN: | 0302-9743 1611-3349 |
Published: |
Seattle, USA
Springer
2006
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa43401 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Abstract: |
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 Description: |
22nd International Conference on Logic Programming (ICLP 2006) |
College: |
Faculty of Humanities and Social Sciences |
End Page: |
284 |