No Cover Image

Conference Paper/Proceeding/Abstract 1279 views 164 downloads

An Application of Answer Set Programming: Superoptimisation -- A Preliminary Report

Martin Brain, Tom Crick Orcid Logo, Marina De Vos, John Fitch

Proceedings of the 11th International Workshop on Non-Monotonic Reasoning, Issue: IFL-06-04, Pages: 258 - 265

Swansea University Author: Tom Crick Orcid Logo

Check full text

Abstract

Answer set programming (ASP) is a declarative problem-solving technique that uses the computation of answer set semantics to provide solutions. Despite comprehensive implementations and a strong theoretical basis, ASP has yet to be used for more than a handful of large-scale applications. This paper...

Full description

Published in: Proceedings of the 11th International Workshop on Non-Monotonic Reasoning
ISSN: 1860-8477
Published: Lake District, UK Technische Universität Clausthal 2006
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa43778
Abstract: Answer set programming (ASP) is a declarative problem-solving technique that uses the computation of answer set semantics to provide solutions. Despite comprehensive implementations and a strong theoretical basis, ASP has yet to be used for more than a handful of large-scale applications. This paper describes such a large-scale application and presents some preliminary results. The TOAST (Total Optimisation using Answer Set Technology) project seeks to generate optimal machine code for simple, acyclic functions using a technique known as superoptimisation. ASP is used as a scalable computational engine for conducting searches over complex, non-regular do- mains. The experimental results suggest this is a viable approach to the optimisation problem and demonstrates the value of using parallel answer set solvers.
Item Description: 11th International Workshop on Non-Monotonic Reasoning (NMR 2006)
College: Faculty of Humanities and Social Sciences
Issue: IFL-06-04
Start Page: 258
End Page: 265

Similar Items