Coala: A compiler from action languages to ASP

Gebser, Martin; Grote, Torsten; Schaub, Torsten

doi:10.1007/978-3-642-15675-5_32

View/Open

68126_1.pdf (169.6Kb)

Author(s)

Gebser, Martin

Grote, Torsten

Schaub, Torsten

Griffith University Author(s)

Schaub, Torsten

Year published

2010

Metadata

Show full item record

Abstract

Abstract. Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, called Coala, offering manifold compilation techniques for several action languages. We provide an overview of the salient and distinctive features of Coala as well as an experimental comparison of them.Abstract. Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, called Coala, offering manifold compilation techniques for several action languages. We provide an overview of the salient and distinctive features of Coala as well as an experimental comparison of them.
View less >

Conference Title

12th European Conference on Logics in Artificial Intelligence Proceedings

Volume

6341

DOI

https://doi.org/10.1007/978-3-642-15675-5_32

Copyright Statement

© 2010 Springer Berlin/Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com

Subject

Computation Theory and Mathematics not elsewhere classified

Publication URI

http://hdl.handle.net/10072/37323

Collection

Conference outputs