Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming [chapter]

Joohyung Lee
2012 Lecture Notes in Computer Science  
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
more » ... ustrate its usefulness in the healthcare domain in the context of medical expert systems.
doi:10.1007/978-3-642-30743-0_28 fatcat:w7kttp35tvghpndd2dgagqqyi4