10.4230/LIPICS.ICLP.2011.51
Casolary, Michael
Michael
Casolary
Lee, Joohyung
Joohyung
Lee
Representing the Language of the Causal Calculator in Answer Set Programming
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
answer set programming
nonmonotonic causal logic
action languages
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
2011
2011-06-27
2011-06-27
2011-06-27
en
urn:nbn:de:0030-drops-31780
10.4230/LIPIcs.ICLP.2011
978-3-939897-31-6
1868-8969
10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP 2011
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
2013
11
6
51
61
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
11
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
659004 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Action language C+, a formalism based on nonmonotonic causal logic, was designed for describing properties of actions. The definite fragment of C+ was implemented in system the Causal Calculator (CCalc), based on a reduction of nonmonotonic causal logic to propositional logic. On the other hand, in this paper, we represent the language of CCalc in answer set programming (ASP), by translating nonmonotonic causal logic into formulas under the stable model semantics. We design a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system f2lp and answer set solvers, our prototype implementation of this approach, which we call Cplus2ASP, achieves functionality close to CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc on several benchmark examples.
LIPIcs, Vol. 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11), pages 51-61