{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:07:42Z","timestamp":1715645262536},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"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":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Several extensions of the stable model semantics are available to describe \u2018intensional\u2019 functions\u2014functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.<\/jats:p>","DOI":"10.1017\/s1471068413000549","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"863-876","source":"Crossref","is-referenced-by-count":4,"title":["On the stable model semantics for intensional functions"],"prefix":"10.1017","volume":"13","author":[{"given":"MICHAEL","family":"BARTHOLOMEW","sequence":"first","affiliation":[]},{"given":"JOOHYUNG","family":"LEE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000549_ref9","unstructured":"Truszczynski M. 2012. Connecting first-order ASP and the logic FO(ID) through reducts. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, 543\u2013559."},{"key":"S1471068413000549_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"key":"S1471068413000549_ref5","first-page":"203","article-title":"Functional answer set programming.","volume":"11","author":"Cabalar","year":"2011","journal-title":"TPLP"},{"key":"S1471068413000549_ref4","unstructured":"Bartholomew M. and Lee J. 2013. Functional stable model semantics and answer set programming modulo theories. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), To appear."},{"key":"S1471068413000549_ref3","unstructured":"Bartholomew M. and Lee J. 2012. Stable models of formulas with intensional functions. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 2\u201312."},{"key":"S1471068413000549_ref1","unstructured":"Balduccini M. 2012a. An answer set solver for non-Herbrand programs: Progress report. In ICLP (Technical Communications), 49\u201360."},{"key":"S1471068413000549_ref2","unstructured":"Balduccini M. 2012b. A \u201cconservative\u201d approach to extending answer set programming with non-Herbrand functions. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, 24\u201339."},{"key":"S1471068413000549_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03001-5"},{"key":"S1471068413000549_ref7","unstructured":"Lifschitz V. 2012. Logic programs with intensional functions. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 24\u201331."}],"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\/S1471068413000549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:29:18Z","timestamp":1715592558000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000549\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":9,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000549"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000549","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}