{"type":"ScholarlyArticle","title":"Answer Set Programming Modulo Theories and Reasoning about Continuous Changes","authors":[{"name":"Joohyung Lee","slug":"joohyung-lee","given":"Joohyung","family":"Lee","affiliation":""},{"name":"Yunsong Meng","slug":"yunsong-meng","given":"Yunsong","family":"Meng","affiliation":""}],"abstract":"Answer Set Programming Modulo Theories (ASPMT) 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.","doi":null,"url":"https://ijcai.org/proceedings/2013/151","pdf":"https://ijcai.org/proceedings/2013/0151.pdf","markdown":"https://ijcai.org/proceedings/2013/151.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/151","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":151,"pages":{"first":990,"last":995},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}