{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:00:49Z","timestamp":1747173649922,"version":"3.40.5"},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"unspecified","delay-in-days":19,"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":[[2019,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The input language of the answer set solver <jats:sc>clingo<\/jats:sc> is based on the definition of a stable model proposed by Paolo Ferraris. The semantics of the ASP-Core language, developed by the ASP Standardization Working Group, uses the approach to stable models due to Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The two languages are based on different versions of the stable model semantics, and the ASP-Core document requires, \u201cfor the sake of an uncontroversial semantics,\u201d that programs avoid the use of recursion through aggregates. In this paper we prove that the absence of recursion through aggregates does indeed guarantee the equivalence between the two versions of the stable model semantics, and show how that requirement can be relaxed without violating the equivalence property.<\/jats:p>","DOI":"10.1017\/s1471068419000322","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T09:06:21Z","timestamp":1568970381000},"page":"1006-1020","source":"Crossref","is-referenced-by-count":2,"title":["Relating Two Dialects of Answer Set Programming"],"prefix":"10.1017","volume":"19","author":[{"given":"AMELIA","family":"HARRISON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6051-7907","authenticated-orcid":false,"given":"VLADIMIR","family":"LIFSCHITZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000322_ref9","unstructured":"Harrison, A. , Lifschitz, V. , Pearce, D. , and Valverde, A. 2017. Infinitary equilibrium logic and strongly equivalent logic programs. Arificial Intelligence 246, 22\u201333."},{"key":"S1471068419000322_ref10","unstructured":"Heyting, A. 1930. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, 42\u201356."},{"key":"S1471068419000322_ref2","doi-asserted-by":"crossref","unstructured":"Faber, W. , Leone, N. , and Pfeifer, G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA). 200\u2013212.","DOI":"10.1007\/978-3-540-30227-8_19"},{"key":"S1471068419000322_ref11","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1016\/j.artint.2010.08.004","article-title":"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs","volume":"16","author":"Truszczynski","year":"2010","journal-title":"Artificial Intelligence 174"},{"key":"S1471068419000322_ref3","unstructured":"Faber, W. , Pfeifer, G. , and Leone, N. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175, 278\u2013298."},{"key":"S1471068419000322_ref8","unstructured":"Harrison, A. 2017. Formal methods for answer set programming. Ph.D. thesis, University of Texas at Austin."},{"key":"S1471068419000322_ref1","unstructured":"Bartholomew, M. , Lee, J. , and Meng, Y. 2011. First-order extension of the FLP stable model semantics via modified circumscription. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). 724\u2013730."},{"key":"S1471068419000322_ref4","doi-asserted-by":"crossref","unstructured":"Ferraris, P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 119\u2013131.","DOI":"10.1007\/11546207_10"},{"key":"S1471068419000322_ref5","unstructured":"Ferraris, P. , Lee, J. , and Lifschitz, V. 2006. A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence 47, 79\u2013101."},{"key":"S1471068419000322_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000222"},{"key":"S1471068419000322_ref12","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/978-3-642-30743-0_37","volume-title":"Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz","author":"Truszczynski","year":"2012"},{"key":"S1471068419000322_ref6","unstructured":"Gebser, M. , Harrison, A. , Kaminski, R. , Lifschitz, V. , and Schaub, T. 2015. Abstract Gringo. Theory and Practice of Logic Programming 15, 449\u2013463."}],"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\/S1471068419000322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T04:26:01Z","timestamp":1571113561000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000322\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":12,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000322"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000322","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}