Reformulating temporal action logics in answer set programming

Joohyung Lee, Ravi Palla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Pages786-792
Number of pages7
Volume1
StatePublished - 2012
Event26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12 - Toronto, ON, Canada
Duration: Jul 22 2012Jul 26 2012

Other

Other26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12
CountryCanada
CityToronto, ON
Period7/22/127/26/12

Fingerprint

High level languages
Temporal logic
Expert systems
Ontology

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Lee, J., & Palla, R. (2012). Reformulating temporal action logics in answer set programming. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 786-792)

Reformulating temporal action logics in answer set programming. / Lee, Joohyung; Palla, Ravi.

Proceedings of the National Conference on Artificial Intelligence. Vol. 1 2012. p. 786-792.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J & Palla, R 2012, Reformulating temporal action logics in answer set programming. in Proceedings of the National Conference on Artificial Intelligence. vol. 1, pp. 786-792, 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12, Toronto, ON, Canada, 7/22/12.
Lee J, Palla R. Reformulating temporal action logics in answer set programming. In Proceedings of the National Conference on Artificial Intelligence. Vol. 1. 2012. p. 786-792
Lee, Joohyung ; Palla, Ravi. / Reformulating temporal action logics in answer set programming. Proceedings of the National Conference on Artificial Intelligence. Vol. 1 2012. pp. 786-792
@inproceedings{3fbdda0f233440f98bea73d0eff0e3ef,
title = "Reformulating temporal action logics in answer set programming",
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.",
author = "Joohyung Lee and Ravi Palla",
year = "2012",
language = "English (US)",
isbn = "9781577355687",
volume = "1",
pages = "786--792",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",

}

TY - GEN

T1 - Reformulating temporal action logics in answer set programming

AU - Lee, Joohyung

AU - Palla, Ravi

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84868266614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868266614&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84868266614

SN - 9781577355687

VL - 1

SP - 786

EP - 792

BT - Proceedings of the National Conference on Artificial Intelligence

ER -