{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:42:40Z","timestamp":1774417360100,"version":"3.50.1"},"reference-count":64,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T00:00:00Z","timestamp":1436140800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The paper introduces a new modular action language,<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068415000095_inline2\"\/><jats:tex-math>${\\mathcal ALM}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, and illustrates the methodology of its use. It is based on the approach of Gelfond and Lifschitz (1993,<jats:italic>Journal of Logic Programming 17<\/jats:italic>, 2\u20134, 301\u2013321; 1998,<jats:italic>Electronic Transactions on AI 3<\/jats:italic>, 16, 193\u2013210) in which a high-level action language is used as a front end for a logic programming system description. The resulting logic programming representation is used to perform various computational tasks. The methodology based on existing action languages works well for small and even medium size systems, but is not meant to deal with larger systems that require<jats:italic>structuring of knowledge<\/jats:italic>.<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068415000095_inline2\"\/><jats:tex-math>$\\mathcal{ALM}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>is meant to remedy this problem. Structuring of knowledge in<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068415000095_inline2\"\/><jats:tex-math>${\\mathcal ALM}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>is supported by the concepts of<jats:italic>module<\/jats:italic>(a formal description of a specific piece of knowledge packaged as a unit),<jats:italic>module hierarchy<\/jats:italic>, and<jats:italic>library<\/jats:italic>, and by the division of a system description of<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068415000095_inline2\"\/><jats:tex-math>${\\mathcal ALM}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>into two parts:<jats:italic>theory<\/jats:italic>and<jats:italic>structure<\/jats:italic>. A<jats:italic>theory<\/jats:italic>consists of one or more modules with a common theme, possibly organized into a module hierarchy based on a<jats:italic>dependency relation<\/jats:italic>. It contains declarations of sorts, attributes, and properties of the domain together with axioms describing them.<jats:italic>Structures<\/jats:italic>are used to describe the domain's objects. These features, together with the means for defining classes of a domain as special cases of previously defined ones, facilitate the stepwise development, testing, and readability of a knowledge base, as well as the creation of knowledge representation libraries.<\/jats:p>","DOI":"10.1017\/s1471068415000095","type":"journal-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T07:53:09Z","timestamp":1436169189000},"page":"189-235","source":"Crossref","is-referenced-by-count":8,"title":["Modular action language"],"prefix":"10.1017","volume":"16","author":[{"given":"DANIELA","family":"INCLEZAN","sequence":"first","affiliation":[]},{"given":"MICHAEL","family":"GELFOND","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,7,6]]},"reference":[{"key":"S1471068415000095_ref58","volume-title":"Types in Logic Programming","author":"Pfenning","year":"1992"},{"key":"S1471068415000095_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.07.004"},{"key":"S1471068415000095_ref49","first-page":"24","volume-title":"Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR)","author":"Lifschitz","year":"2012"},{"key":"S1471068415000095_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11799573_28"},{"key":"S1471068415000095_ref44","unstructured":"Inclezan D. 2010. Computing trajectories of dynamic systems using ASP and Flora-2. Paper presented at NonMon@30: Thirty Years of Nonmonotonic Reasoning Conference, Lexington, Kentucky, 22\u201325 October. G. Brewka , V. Marek and M. Truszczynski , Eds., Available at http:\/\/www.depts.ttu.edu\/cs\/research\/krlab\/pdfs\/papers\/di10.pdf"},{"key":"S1471068415000095_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.08.004"},{"key":"S1471068415000095_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000549"},{"key":"S1471068415000095_ref55","first-page":"72","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","volume":"25","author":"Niemel\u00e4","year":"1998","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"S1471068415000095_ref8","unstructured":"Balduccini M. and Gelfond M. 2012. Language ASP{f} with arithmetic expressions and consistency-restoring rules. In Proc. of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), M. Fink and Y. Lierler , Eds. Proceedings published online in arXiv at http:\/\/arxiv.org\/pdf\/1301.1387v1.pdf, 35\u201349."},{"key":"S1471068415000095_ref64","doi-asserted-by":"publisher","DOI":"10.1145\/362575.362577"},{"key":"S1471068415000095_ref50","first-page":"853","volume-title":"Proc. of the 21st National Conference on Artificial Intelligence (AAAI)","author":"Lifschitz","year":"2006"},{"key":"S1471068415000095_ref45","first-page":"49","volume-title":"Proc. of the 2011 AAAI Spring Symposium on Formalizing Commonsense","author":"Inclezan","year":"2011"},{"key":"S1471068415000095_ref59","unstructured":"Sandewall E. 1999. Logic modelling workshop: Communicating axiomatizations of actions and change. URL: http:\/\/www.ida.liu.se\/ext\/etai\/lmw."},{"key":"S1471068415000095_ref26","first-page":"54","volume-title":"LPNMR","author":"Gebser","year":"2011"},{"key":"S1471068415000095_ref54","unstructured":"McCarthy J. 1998. Elaboration tolerance. In Proceedings of Commonsense Reasoning. Available online at: http:\/\/www-formal.stanford.edu\/jmc\/elaboration\/elaboration.html"},{"key":"S1471068415000095_ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068415000095_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001807"},{"key":"S1471068415000095_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74610-2_18"},{"key":"S1471068415000095_ref61","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00125-2"},{"key":"S1471068415000095_ref35","first-page":"193","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on AI"},{"key":"S1471068415000095_ref56","first-page":"420","volume-title":"Proc. of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-97)","author":"Niemel\u00e4","year":"1997"},{"key":"S1471068415000095_ref48","first-page":"68","volume-title":"Proc. of the 27th AAAI Conference on Artificial Intelligence (AAAI-13)","author":"Lierler","year":"2013"},{"key":"S1471068415000095_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000343"},{"key":"S1471068415000095_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"S1471068415000095_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90034-5"},{"key":"S1471068415000095_ref43","article-title":"The LMW Traffic world in the fluent calculus","volume":"5","author":"Henschel","year":"2000","journal-title":"Link\u00f3ping Electronic Articles in Computer and Information Science"},{"key":"S1471068415000095_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00138-0"},{"key":"S1471068415000095_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000517"},{"key":"S1471068415000095_ref3","first-page":"135","volume-title":"Proc. PADL'04","author":"Balduccini","year":"2004"},{"key":"S1471068415000095_ref16","first-page":"59","article-title":"Planning and scheduling in hybrid domains","volume":"241","author":"Chintabathina","year":"2012","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"S1471068415000095_ref25","first-page":"162","volume-title":"Proc. of the 27th International Conference on Logic Programming (ICLP)","author":"Fodor","year":"2011"},{"key":"S1471068415000095_ref29","unstructured":"Gelfond M. and Inclezan D. 2009. Yet another modular action language. In Proc. of SEA-09. University of Bath Opus: Online Publications Store, 64\u201378."},{"key":"S1471068415000095_ref32","first-page":"1070","volume-title":"Proc. of ICLP-88","author":"Gelfond","year":"1988"},{"key":"S1471068415000095_ref2","unstructured":"Balai E. , Gelfond M. and Zhang Y. 2012. SPARC \u2013 sorted ASP with consistency restoring rules. In Proc. of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), M. Fink and Y. Lierler , Eds. Proceedings published online in arXiv at http:\/\/arxiv.org\/html\/1301.2215v1, 19\u201333."},{"key":"S1471068415000095_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.08.002"},{"key":"S1471068415000095_ref15","first-page":"193","article-title":"Template programs for disjunctive logic programming: An operational semantics","volume":"19","author":"Calimeri","year":"2006","journal-title":"AI Communications"},{"key":"S1471068415000095_ref17","first-page":"303","volume-title":"Proc. of ASP '05 Answer Set Programming: Advances in Theory and Implementation","author":"Chintabathina","year":"2005"},{"key":"S1471068415000095_ref28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/AIC-2011-0496","article-title":"An incremental answer set programming based system for finite model computation","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Commun."},{"key":"S1471068415000095_ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_36"},{"key":"S1471068415000095_ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v31i3.2302"},{"key":"S1471068415000095_ref27","doi-asserted-by":"crossref","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume-title":"Answer Set Solving in Practice","author":"Gebser","year":"2012"},{"key":"S1471068415000095_ref63","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S1471068415000095_ref53","first-page":"403","volume-title":"Semantic Information Processing","author":"McCarthy","year":"1968"},{"key":"S1471068415000095_ref4","first-page":"18","volume-title":"Proc. of LPNMR-07","author":"Balduccini","year":"2007"},{"key":"S1471068415000095_ref38","first-page":"623","volume-title":"Proc. of National Conference on Artificial Intelligence (AAAI)","author":"Giunchiglia","year":"1998"},{"key":"S1471068415000095_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068415000095_ref11","first-page":"257","volume-title":"Reasoning Agents in Dynamic Domains","author":"Baral","year":"2000"},{"key":"S1471068415000095_ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124"},{"key":"S1471068415000095_ref57","first-page":"412","volume-title":"Proceedings of 17th European Conference on Artificial Intelligence(ECAI)","author":"Oikarinen","year":"2006"},{"key":"S1471068415000095_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90035-F"},{"key":"S1471068415000095_ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068415000095_ref24","unstructured":"Erdogan S. T. 2008. A Library of General-Purpose Action Descriptions. Ph.D. thesis, University of Texas at Austin, Austin, TX, USA."},{"key":"S1471068415000095_ref62","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00058-2"},{"key":"S1471068415000095_ref52","doi-asserted-by":"crossref","unstructured":"McCarthy J. 1963. Situations, actions, and causal laws. Tech. Rep. Memo 2, Stanford University.","DOI":"10.21236\/AD0785031"},{"key":"S1471068415000095_ref18","first-page":"962","volume-title":"Proc. of the 22nd AAAI Conference on Artificial Intelligence, July 22\u201326, 2007, Vancouver, British Columbia, Canada","author":"Desai","year":"2007"},{"key":"S1471068415000095_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/976706.976708"},{"key":"S1471068415000095_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"S1471068415000095_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.04.002"},{"key":"S1471068415000095_ref13","volume-title":"AAAI 2014 Spring Symposium Series","author":"Blount","year":"2014"},{"key":"S1471068415000095_ref39","unstructured":"Grosof B. , Dean M. and Kifer M. 2009. The SILK system: Scalable higher-order defeasible rules. In International RuleML Symposium on Rule Interchange and Applications. Available online at: http:\/\/silk.semwebcentral.org\/talk-ruleml2009-silk-demo.pdf"},{"key":"S1471068415000095_ref23","first-page":"377","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the International Conference","author":"Erdogan","year":"2006"},{"key":"S1471068415000095_ref7","first-page":"9","volume-title":"International Symposium on Logical Formalization of Commonsense Reasoning","author":"Balduccini","year":"2003"},{"key":"S1471068415000095_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068415000095_ref30","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.798954"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068415000095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T17:26:14Z","timestamp":1599240374000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068415000095\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,6]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["S1471068415000095"],"URL":"https:\/\/doi.org\/10.1017\/s1471068415000095","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,6]]}}}