{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T12:49:26Z","timestamp":1680266966611},"reference-count":13,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":43,"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,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions.<\/jats:p>","DOI":"10.1017\/s1471068416000314","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T21:28:20Z","timestamp":1476566900000},"page":"771-786","source":"Crossref","is-referenced-by-count":2,"title":["Stable models for infinitary formulas with extensional atoms"],"prefix":"10.1017","volume":"16","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"}]}],"member":"56","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"S1471068416000314_ref10","article-title":"Transition systems for model generators \u2014 a unifying approach","volume":"11","author":"Lierler","year":"2011","journal-title":"Theory and Practice of Logic Programming, 27th International Conference on Logic Programming (ICLP) Special Issue"},{"key":"S1471068416000314_ref7","first-page":"1070","volume-title":"Proceedings of International Logic Programming Conference and Symposium","author":"Gelfond","year":"1988"},{"key":"S1471068416000314_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_37"},{"key":"S1471068416000314_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000150"},{"key":"S1471068416000314_ref1","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":"S1471068416000314_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"key":"S1471068416000314_ref3","unstructured":"Ferraris P. , Lee J. and Lifschitz V. 2007. A new perspective on stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 372\u2013379."},{"key":"S1471068416000314_ref5","unstructured":"Ferraris P. , Lee J. , Lifschitz V. and Palla R. 2009. Symmetric splitting in the general theory of stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 797\u2013803."},{"key":"S1471068416000314_ref11","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).","DOI":"10.1017\/S1471068413000318"},{"key":"S1471068416000314_ref2","unstructured":"Ferraris P. 2007. A logic program characterization of causal theories. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 366\u2013371."},{"key":"S1471068416000314_ref8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194096000053"},{"key":"S1471068416000314_ref9","doi-asserted-by":"crossref","unstructured":"Harrison A. , Lifschitz V. , Pearce D. and Valverde A. 2015. Infinitary equilibrium logic and strong equivalence. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 398\u2013410.","DOI":"10.1007\/978-3-319-23264-5_33"},{"key":"S1471068416000314_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840800358X"}],"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\/S1471068416000314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T17:04:24Z","timestamp":1568480664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000314\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":13,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S1471068416000314"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000314","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}