A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergies it brings. First, the reformulation provides a means to compute TAL using efficient answer set solvers. Second, TAL provides a structured high-level language for ASP (possibly with constraint solving). Third, the reformulation allows us to compute integration of TAL and ontologies using answer set solvers, and we
doi:10.1007/978-3-642-30743-0_28
fatcat:w7kttp35tvghpndd2dgagqqyi4