Result: TOAST : Applying answer set programming to superoptimisation

Title:
TOAST : Applying answer set programming to superoptimisation
Authors:
BRAIN, Martin, CRICK, Tom, DE VOS, Marina, FITCH, John
Source:
Logic programming (22nd international conference, ICLP 2006)0ICLP 2006. :270-284
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 30 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Circonscription, Circumscription, Circonscripción, Code optimal, Optimal code, Código optimal, Extensibilité, Scalability, Estensibilidad, Langage déclaratif, Declarative language, Lenguaje declarativo, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème combinatoire, Combinatorial problem, Problema combinatorio, Problème recherche, Search problem, Problema investigación, Programmation logique, Logical programming, Programación lógica, Représentation connaissance, Knowledge representation, Representación conocimientos, Programmation par ensemble reponse, Answer set programming, Programación conjunto respuesta
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science University of Bath, Bath BA2 7AY, United Kingdom
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19104707
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19104707
Database:
PASCAL Archive

Further Information

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.