{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:15Z","timestamp":1747173675286,"version":"3.40.5"},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that the new understanding of positive dependency makes it possible to strengthen some of these results.<\/jats:p>","DOI":"10.1017\/s1471068422000333","type":"journal-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T07:28:06Z","timestamp":1661239686000},"page":"1128-1137","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Positive Dependency Graphs Revisited"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3917-8717","authenticated-orcid":false,"given":"JORGE","family":"FANDINNO","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6051-7907","authenticated-orcid":false,"given":"VLADIMIR","family":"LIFSCHITZ","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"S1471068422000333_ref6","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":"S1471068422000333_ref4","first-page":"51","article-title":"Consistency of Clark\u2019s completion and existence of stable models","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science 1"},{"key":"S1471068422000333_ref10","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of International Logic Programming Conference and Symposium, R. Kowalski and K. Bowen, Eds. MIT Press, 1070\u20131080."},{"key":"S1471068422000333_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"S1471068422000333_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9025-2"},{"key":"S1471068422000333_ref15","first-page":"4","article-title":"Lloyd-Topor completion and general stable models","author":"Lifschitz","year":"2013","journal-title":"Theory and Practice of Logic Programming 13"},{"key":"S1471068422000333_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068422000333_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840800358X"},{"key":"S1471068422000333_ref14","unstructured":"Lifschitz, V. and Turner, H. 1994. Splitting a logic program. In Proceedings of International Conference on Logic Programming (ICLP), P. Van Hentenryck, Ed., 23\u201337."},{"key":"S1471068422000333_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"S1471068422000333_ref9","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":"S1471068422000333_ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068422000333_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.01.001"},{"key":"S1471068422000333_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7"},{"key":"S1471068422000333_ref5","doi-asserted-by":"crossref","unstructured":"Fandinno, J. and Lifschitz, V. 2021. Verification of locally tight programs. In Technical Communications of the Thirty-seventh International Conference on Logic Programming (ICLP\u201911), A. Formisano, Y. Liu, B. Bogaerts, A. Brik, V. Dahl, C. Dodaro, P. Fodor, G. Pozzato, J. Vennekens and N. Zhou, Eds. Electronic Proceedings in Theoretical Computer Science (EPTCS), vol. 345.","DOI":"10.4204\/EPTCS.345.0"},{"key":"S1471068422000333_ref12","unstructured":"Lifschitz, V. 1986. Pointwise circumscription: Preliminary report. In Proceedings of National Conference on Artificial Intelligence (AAAI), 406\u2013410."},{"key":"S1471068422000333_ref11","doi-asserted-by":"crossref","unstructured":"Harrison, A. and Lifschitz, V. 2016. Stable models for infinitary formulas with extensional atoms. Theory and Practice of Logic Programming 16, 5-6, 771\u2013786.","DOI":"10.1017\/S1471068416000314"},{"key":"S1471068422000333_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"key":"S1471068422000333_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068422000333_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90011-6"}],"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\/S1471068422000333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T03:54:06Z","timestamp":1696996446000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000333\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,23]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S1471068422000333"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000333","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2022,8,23]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}