Cplus 2ASP: Computing Action Language {\cal C} + in Answer Set Programming

DOI10.1007/978-3-642-40564-8_13zbMATH Open1405.68041OpenAlexW106886739MaRDI QIDQ2851240FDOQ2851240

Joohyung Lee, Joseph Babb

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

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Cited In (7)

• System aspmt2smt: Computing ASPMT Theories by SMT Solvers
• Representing hybrid automata by action language modulo theories
• Approximate postdictive reasoning with answer set programming
• Simulation of Action Theories and an Application to General Game-Playing Robots
• First-order stable model semantics with intensional functions
• Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

Uses Software

• Coala
• oClingo
• Cplus2ASP
• f2lp
• CCalc

This page was built for publication: Cplus 2ASP: Computing Action Language ${\cal 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)