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.

[1]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[2]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

[3]  Torsten Schaub,et al.  Modeling Biological Networks by Action Languages via Answer Set Programming , 2008, Constraints.

[4]  Torsten Schaub,et al.  The System BioC for Reasoning about Biological Models in Action Language C , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

[5]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[7]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

[8]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[9]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[10]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[11]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

[12]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..