{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T13:25:15Z","timestamp":1775049915431,"version":"3.50.1"},"reference-count":13,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"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":[[2015,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.<\/jats:p>","DOI":"10.1017\/s1471068414000088","type":"journal-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T09:29:39Z","timestamp":1400232579000},"page":"18-34","source":"Crossref","is-referenced-by-count":7,"title":["On equivalence of infinitary formulas under the stable model semantics"],"prefix":"10.1017","volume":"15","author":[{"given":"AMELIA","family":"HARRISON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VLADIMIR","family":"LIFSCHITZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MIROSLAW","family":"TRUSZCZYNSKI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,5,16]]},"reference":[{"key":"S1471068414000088_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023801"},{"key":"S1471068414000088_ref7","volume-title":"Languages with Expressions of Infinite Length","author":"Karp","year":"1964"},{"key":"S1471068414000088_ref6","first-page":"222","article-title":"\u00dcber die Axiomatisierbarkeit des Aussagenkalk\u00fcls","volume":"7","author":"Kalm\u00e1r","year":"1935","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"S1471068414000088_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40564-8_38"},{"key":"S1471068414000088_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068414000088_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_37"},{"key":"S1471068414000088_ref12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4064\/cm-6-1-165-170","article-title":"The sentential calculus with infinitely long expressions","volume":"6","author":"Scott","year":"1958","journal-title":"Colloquium Mathematicae"},{"key":"S1471068414000088_ref5","first-page":"183","article-title":"The axiomatization of the intermediate propositional systems Sn of G\u00f6del","volume":"13","author":"Hosoi","year":"1966","journal-title":"Journal of the Faculty of Science of the University of Tokyo"},{"key":"S1471068414000088_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_10"},{"key":"S1471068414000088_ref2","first-page":"1070","volume-title":"Proceedings of International Logic Programming Conference and Symposium","author":"Gelfond","year":"1988"},{"key":"S1471068414000088_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03001-5"},{"key":"S1471068414000088_ref3","unstructured":"Harrison A. 2013. On the semantics of Gringo and proving strong equivalence. In Theory and Practice of Logic Programming (Online Supplement). URL: http:\/\/journals.cambridge.org\/downloadsup.php?file=\/tlp2013035.pdf."},{"key":"S1471068414000088_ref10","doi-asserted-by":"crossref","unstructured":"Lifschitz V. and Yang F. 2012. Lloyd-Topor completion and general stable models. In Working Notes of the 5th Workshop of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012).","DOI":"10.1017\/S1471068413000318"}],"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\/S1471068414000088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T10:47:04Z","timestamp":1565434024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068414000088\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,16]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["S1471068414000088"],"URL":"https:\/\/doi.org\/10.1017\/s1471068414000088","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,16]]}}}