{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:53:01Z","timestamp":1771699981974,"version":"3.50.1"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2016,9,5]],"date-time":"2016-09-05T00:00:00Z","timestamp":1473033600000},"content-version":"vor","delay-in-days":366,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1319794"],"award-info":[{"award-number":["IIS-1319794"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"South Korea IT R&D","award":["MKE\/KIAT 2010-TD-300404-001"],"award-info":[{"award-number":["MKE\/KIAT 2010-TD-300404-001"]}]},{"name":"ICT R&D","award":["MSIP\/IITP 10044494"],"award-info":[{"award-number":["MSIP\/IITP 10044494"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high-level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) language, which allows several useful constructs for knowledge representation, such as choice rules, aggregates and abstract constraint atoms. We propose a new action language called BC +, which closes the gap between action languages and the modern ASP language. The main idea is to define the semantics of BC + in terms of general stable model semantics for propositional formulas, under which many modern ASP language constructs can be identified with shorthands for propositional formulas. Language BC \u2009+\u2009turns out to be sufficiently expressive to encompass the best features of other action languages, such as languages B , C , C + and BC . Computational methods available in ASP solvers are readily applicable to compute BC +, which led to an implementation of the language by extending system cplus2asp .<\/jats:p>","DOI":"10.1093\/logcom\/exv062","type":"journal-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T01:09:37Z","timestamp":1441674577000},"page":"899-922","source":"Crossref","is-referenced-by-count":7,"title":["Action language \u212c\ud835\udc9e+"],"prefix":"10.1093","volume":"30","author":[{"given":"Joseph","family":"Babb","sequence":"first","affiliation":[{"name":"School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA"}]},{"given":"Joohyung","family":"Lee","sequence":"first","affiliation":[{"name":"School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA"}]}],"member":"286","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"2020062220033487300_B1"},{"key":"2020062220033487300_B2"},{"key":"2020062220033487300_B3"},{"key":"2020062220033487300_B4"},{"key":"2020062220033487300_B5"},{"key":"2020062220033487300_B6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","article-title":"Stable models and circumscription","volume":"175","author":"Ferraris","year":"2011","journal-title":"Artificial Intelligence"},{"key":"2020062220033487300_B7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1017\/S1471068411000081","article-title":"Representing first-order causal theories by logic programs","volume":"12","author":"Ferraris","year":"2012","journal-title":"Theory and Practice of Logic Programming"},{"key":"2020062220033487300_B8"},{"key":"2020062220033487300_B9"},{"key":"2020062220033487300_B10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","article-title":"Representing action and change by logic programs","volume":"17","author":"Gelfond","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"2020062220033487300_B11","first-page":"195","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"2020062220033487300_B12"},{"key":"2020062220033487300_B13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.artint.2002.12.001","article-title":"Nonmonotonic causal theories","volume":"153","author":"Giunchiglia","year":"2004","journal-title":"Artificial Intelligence"},{"key":"2020062220033487300_B14"},{"key":"2020062220033487300_B15"},{"key":"2020062220033487300_B16"},{"key":"2020062220033487300_B17"},{"key":"2020062220033487300_B18"},{"key":"2020062220033487300_B19","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"2","author":"Lifschitz","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"key":"2020062220033487300_B20"},{"key":"2020062220033487300_B21"},{"key":"2020062220033487300_B22"},{"key":"2020062220033487300_B23"},{"key":"2020062220033487300_B24","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002936","article-title":"A constructive semantic characterization of aggregates in answer set programming","volume":"7","author":"Cao Son","year":"2007","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/899\/33410371\/exv062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/899\/33410371\/exv062.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:03:47Z","timestamp":1592870627000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/4\/899\/2917837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,5]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,9,5]]},"published-print":{"date-parts":[[2020,6,5]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv062","relation":{},"ISSN":["1465-363X","0955-792X"],"issn-type":[{"value":"1465-363X","type":"electronic"},{"value":"0955-792X","type":"print"}],"subject":[],"published-other":{"date-parts":[[2020,6]]},"published":{"date-parts":[[2015,9,5]]}}}