TOAST: Applying answer set programming to superoptimisation

M Brain, T Crick, M De Vos, J Fitch

Research output: Chapter in Book/Report/Conference proceedingChapter

19 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationLogic Programming, Proceedings
Pages270-284
Number of pages15
Volume4079
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science

Fingerprint Dive into the research topics of 'TOAST: Applying answer set programming to superoptimisation'. Together they form a unique fingerprint.

Cite this