{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T00:41:09Z","timestamp":1792197669464,"version":"4.4.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031742088","type":"print"},{"value":"9783031742095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_1","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deductive Systems for Logic Programs with Counting: Preliminary Report"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3917-8717","authenticated-orcid":false,"given":"Jorge","family":"Fandinno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6051-7907","authenticated-orcid":false,"given":"Vladimir","family":"Lifschitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1613\/jair.1.15786","volume":"80","author":"J Fandinno","year":"2024","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Axiomatization of non-recursive aggregates in first-order answer set programming. J. Artif. Intell. Res. 80, 977\u20131031 (2024)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Axiomatization of aggregates in answer set programming. In: Proceedings of the AAAI Conference on Artificial Intelligence (2022)","DOI":"10.1609\/aaai.v36i5.20504"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Hansen, Z.: Recursive aggregates as intensional functions. In: Proceedings of the Workshops Co-located with the 39th International Conference on Logic Programming (2023)","DOI":"10.4204\/EPTCS.385.43"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y., Lifschitz, V., Temple, N.: External behavior of a logic program and verification of refactoring. Theory Pract. Logic Programm. (2023)","DOI":"10.1017\/S1471068423000200"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Lifschitz, V.: Omega-completeness of the logic of here-and-there and strong equivalence of logic programs. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (2023)","DOI":"10.24963\/kr.2023\/24"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Lifschitz, V.: On Heuer\u2019s procedure for verifying strong equivalence. In: Proceedings of European Conference on Logics in Artificial Intelligence (2023)","DOI":"10.1007\/978-3-031-43619-2_18"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Lifschitz, V., L\u00fchne, P., Schaub, T.: Verifying tight logic programs with Anthem and Vampire. Theory Pract. Logic Programm. 20 (2020)","DOI":"10.1017\/S1471068420000344"},{"key":"1_CR8","unstructured":"Gebser, M., et al.: Potassco User Guide (2019). https:\/\/github.com\/potassco\/guide\/releases\/"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, Z.: Anthem-P2P: automatically verifying the equivalent external behavior of ASP programs. In: Electronic Proceedings in Theoretical Computer Science, vol. 385 (2023)","DOI":"10.4204\/EPTCS.385.34"},{"key":"1_CR10","unstructured":"Heuer, J.: Automated verification of equivalence properties in advanced logic programs. Bachelor Thesis, University of Potsdam (2020)"},{"key":"1_CR11","first-page":"183","volume":"13","author":"T Hosoi","year":"1966","unstructured":"Hosoi, T.: The axiomatization of the intermediate propositional systems $${S}_n$$ of G\u00f6del. J. Faculty Sci. Univ. Tokyo 13, 183\u2013187 (1966)","journal-title":"J. Faculty Sci. Univ. Tokyo"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Here and there with arithmetic. Theory Pract. Logic Programm. (2021)","DOI":"10.1017\/S1471068421000338"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Strong equivalence of logic programs with counting. Theory Pract. Logic Programm. 22 (2022)","DOI":"10.1017\/S1471068422000278"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., L\u00fchne, P., Schaub, T.: Verifying strong equivalence of programs in the input language of gringo. In: Proceedings of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (2019)","DOI":"10.1007\/978-3-030-20528-7_20"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2, 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: A characterization of strong equivalence for logic programs with variables. In: Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 188\u2013200 (2007)","DOI":"10.1007\/978-3-540-72200-7_17"},{"key":"1_CR17","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 170\u2013176 (2002)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Truszczynski, M.: Connecting first-order ASP and the logic FO(ID) through reducts. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz, pp. 543\u2013559. Springer, Cham (2012)","DOI":"10.1007\/978-3-642-30743-0_37"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:02:33Z","timestamp":1736614953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}