Answer Set Programming Modulo Theories and reasoning about continuous changes

Joohyung Lee, Yunsong Meng

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

12 Citations (Scopus)

Abstract

Answer Set Programming Modulo Theories is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, "tight" ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms of ASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages990-996
Number of pages7
StatePublished - 2013
Event23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 - Beijing, China
Duration: Aug 3 2013Aug 9 2013

Other

Other23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
CountryChina
CityBeijing
Period8/3/138/9/13

Fingerprint

Programming theory
Semantics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Lee, J., & Meng, Y. (2013). Answer Set Programming Modulo Theories and reasoning about continuous changes. In IJCAI International Joint Conference on Artificial Intelligence (pp. 990-996)

Answer Set Programming Modulo Theories and reasoning about continuous changes. / Lee, Joohyung; Meng, Yunsong.

IJCAI International Joint Conference on Artificial Intelligence. 2013. p. 990-996.

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

Lee, J & Meng, Y 2013, Answer Set Programming Modulo Theories and reasoning about continuous changes. in IJCAI International Joint Conference on Artificial Intelligence. pp. 990-996, 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 8/3/13.
Lee J, Meng Y. Answer Set Programming Modulo Theories and reasoning about continuous changes. In IJCAI International Joint Conference on Artificial Intelligence. 2013. p. 990-996
Lee, Joohyung ; Meng, Yunsong. / Answer Set Programming Modulo Theories and reasoning about continuous changes. IJCAI International Joint Conference on Artificial Intelligence. 2013. pp. 990-996
@inproceedings{b360b604ad7c4b979608ac8e4f438bed,
title = "Answer Set Programming Modulo Theories and reasoning about continuous changes",
abstract = "Answer Set Programming Modulo Theories is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, {"}tight{"} ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms of ASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.",
author = "Joohyung Lee and Yunsong Meng",
year = "2013",
language = "English (US)",
isbn = "9781577356332",
pages = "990--996",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Answer Set Programming Modulo Theories and reasoning about continuous changes

AU - Lee, Joohyung

AU - Meng, Yunsong

PY - 2013

Y1 - 2013

N2 - Answer Set Programming Modulo Theories is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, "tight" ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms of ASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.

AB - Answer Set Programming Modulo Theories is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, "tight" ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms of ASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.

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

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

M3 - Conference contribution

SN - 9781577356332

SP - 990

EP - 996

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -