Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Superoptimizer: a look at the smallest program
ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
MIPS RISC architecture
The SPARC architecture manual: version 8
The SPARC architecture manual: version 8
Eliminating branches using a superoptimizer and the GNU C compiler
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
A machine program for theorem-proving
Communications of the ACM
Denali: a goal-directed superoptimizer
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
An A-Prolog Decision Support System for the Space Shuttle
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Non-monotonic Reasoning on Beowulf Platforms
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Modern Compiler Implementation in C
Modern Compiler Implementation in C
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
LAIMA: a multi-agent platform using ordered choice logic programming
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Generating Optimal Code Using Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Hierarchical decision making in multi-agent systems using answer set programming
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Answer set programming for representing and reasoning about virtual institutions
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Automatic music composition using answer set programming
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
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.