Abstract
| Original language | English |
|---|---|
| Title of host publication | Logic Programming and Nonmonotonic Reasoning |
| Editors | E Erdem, L Fangzhen, T Schaub |
| Place of Publication | Berlin, Germany |
| Publisher | Springer |
| Pages | 554-559 |
| Number of pages | 6 |
| Volume | 5753 |
| ISBN (Print) | 978-3-642-04237-9 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | 10th International Conference on Logic Programming and Nonmonotonic Reasoning - Potsdam, Germany Duration: 14 Sep 2009 → 18 Sep 2009 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
Conference
| Conference | 10th International Conference on Logic Programming and Nonmonotonic Reasoning |
|---|---|
| Abbreviated title | LPNMR (2009) |
| Country | Germany |
| City | Potsdam |
| Period | 14/09/09 → 18/09/09 |
Cite this
Generating optimal code using answer set programming. / Crick, T; Brain, M; De Vos, M; Fitch, J.
Logic Programming and Nonmonotonic Reasoning. ed. / E Erdem; L Fangzhen; T Schaub. Vol. 5753 Berlin, Germany : Springer, 2009. p. 554-559 (Lecture Notes in Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - Generating optimal code using answer set programming
AU - Crick, T
AU - Brain, M
AU - De Vos, M
AU - Fitch, J
PY - 2009
Y1 - 2009
N2 - This paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large. complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an Outline Of future developments to the system and applications within compiler toolchanis.
AB - This paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large. complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an Outline Of future developments to the system and applications within compiler toolchanis.
UR - http://dx.doi.org/10.1007/978-3-642-04238-6_57
U2 - 10.1007/978-3-642-04238-6_57
DO - 10.1007/978-3-642-04238-6_57
M3 - Chapter
SN - 978-3-642-04237-9
VL - 5753
T3 - Lecture Notes in Computer Science
SP - 554
EP - 559
BT - Logic Programming and Nonmonotonic Reasoning
A2 - Erdem, E
A2 - Fangzhen, L
A2 - Schaub, T
PB - Springer
CY - Berlin, Germany
ER -