Answer Set Programming Modulo Theories and reasoning about continuous changes

Joohyung Lee; Yunsong Meng

Answer Set Programming Modulo Theories and reasoning about continuous changes

Joohyung Lee, Yunsong Meng

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
Pages	990-996
Number of pages	7
State	Published - Dec 1 2013
Event	23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 - Beijing, China Duration: Aug 3 2013 → Aug 9 2013

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)	1045-0823

Other

Other	23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
Country/Territory	China
City	Beijing
Period	8/3/13 → 8/9/13

ASJC Scopus subject areas

Artificial Intelligence

Cite this

Answer Set Programming Modulo Theories and reasoning about continuous changes. / Lee, Joohyung; Meng, Yunsong.
IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. p. 990-996 (IJCAI International Joint Conference on Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lee, J & Meng, Y 2013, Answer Set Programming Modulo Theories and reasoning about continuous changes. in IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. IJCAI International Joint Conference on Artificial Intelligence, pp. 990-996, 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 8/3/13.

@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",

month = dec,

day = "1",

language = "English (US)",

isbn = "9781577356332",

series = "IJCAI International Joint Conference on Artificial Intelligence",

pages = "990--996",

booktitle = "IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence",

note = "23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 ; Conference date: 03-08-2013 Through 09-08-2013",

}

TY - GEN

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

AU - Lee, Joohyung

AU - Meng, Yunsong

PY - 2013/12/1

Y1 - 2013/12/1

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

AN - SCOPUS:84896062553

SN - 9781577356332

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 990

EP - 996

BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence

T2 - 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

Y2 - 3 August 2013 through 9 August 2013

ER -

Answer Set Programming Modulo Theories and reasoning about continuous changes

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this