Reformulating Temporal Action Logics in Answer Set Programming

AAAI 2012 pp. 786-792

doi:10.1609/AAAI.V26I1.8229 /aaai/2012/lee2012aaai-reformulating/

Abstract

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 illustrate its usefulness in the healthcare domain in the context of medical expert systems.

PDF AAAI Semantic Scholar

Cite

Text

Lee and Palla. "Reformulating Temporal Action Logics in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8229

Markdown

[Lee and Palla. "Reformulating Temporal Action Logics in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/lee2012aaai-reformulating/) doi:10.1609/AAAI.V26I1.8229

BibTeX

@inproceedings{lee2012aaai-reformulating,
  title     = {{Reformulating Temporal Action Logics in Answer Set Programming}},
  author    = {Lee, Joohyung and Palla, Ravi},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2012},
  pages     = {786-792},
  doi       = {10.1609/AAAI.V26I1.8229},
  url       = {https://mlanthology.org/aaai/2012/lee2012aaai-reformulating/}
}