TOAST: Applying Answer Set Programming to Superoptimisation

  • Martin Brain
  • Tom Crick
  • Marina De Vos
  • John Fitch
Conference paper

DOI: 10.1007/11799573_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4079)
Cite this paper as:
Brain M., Crick T., De Vos M., Fitch J. (2006) TOAST: Applying Answer Set Programming to Superoptimisation. In: Etalle S., Truszczyński M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Martin Brain
    • 1
  • Tom Crick
    • 1
  • Marina De Vos
    • 1
  • John Fitch
    • 1
  1. 1.Department of Computer ScienceUniversity of BathBathUK

Personalised recommendations