Coala: a compiler from action languages to ASP. 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.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
- Aguado, Felicidad; Cabalar, Pedro; Diéguez, Martín; Pérez, Gilberto; Vidal, Concepción: Temporal equilibrium logic: a survey (2013)
- Babb, Joseph; Lee, Joohyung: Cplus2ASP: computing action language (\mathcalC+) in answer set programming (2013)
- Knorr, Matthias; Gabaldon, Alfredo; Gonçalves, Ricardo; Leite, João; Slota, Martin: Time is up! -- Norms with deadlines in action languages (2013)
- Artikis, Alexander: Dynamic specification of open agent systems (2012)
- Erdem, Esra; Patoglu, Volkan: Applications of action languages in cognitive robotics (2012)
- Ferraris, Paolo; Lee, Joohyung; Lierler, Yuliya; Lifschitz, Vladimir; Yang, Fangkai: Representing first-order causal theories by logic programs (2012)
- Gebser, Martin; Kaufmann, Roland; Schaub, Torsten: Gearing up for effective ASP planning (2012)
- Casolary, Michael; Lee, Joohyung: Representing the language of the causal calculator in answer set programming (2011)
- Gebser, Martin; Grote, Torsten; Schaub, Torsten: Coala: a compiler from action languages to ASP (2010)
- Lifschitz, Vladimir; Yang, Fangkai: Translating first-order causal theories into answer set programming (2010)