Cplus2ASP: computing action language C+ in answer set programming
From MaRDI portal
Publication:2851240
DOI10.1007/978-3-642-40564-8_13zbMATH Open1405.68041OpenAlexW106886739MaRDI QIDQ2851240FDOQ2851240
Authors: Joseph Babb, Joohyung Lee
Publication date: 10 October 2013
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_13
Recommendations
Cited In (10)
- Representing hybrid automata by action language modulo theories
- Approximate postdictive reasoning with answer set programming
- Action language \(\mathcal{BC}+\)
- Reformulating action language \(\mathcal{C}+\) in answer set programming
- First-order stable model semantics with intensional functions
- Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL
- Coala: a compiler from action languages to ASP
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Simulation of action theories and an application to general game-playing robots
Uses Software
This page was built for publication: Cplus2ASP: computing action language \({\mathcal C}+\) in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851240)