{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:48:49Z","timestamp":1743122929977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157066"},{"type":"electronic","value":"9783031157073"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_1","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Syntactic ASP Forgetting with\u00a0Forks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4334-9267","authenticated-orcid":false,"given":"Felicidad","family":"Aguado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7440-0953","authenticated-orcid":false,"given":"Pedro","family":"Cabalar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3917-8717","authenticated-orcid":false,"given":"Jorge","family":"Fandinno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7407-326X","authenticated-orcid":false,"given":"David","family":"Pearce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-6101","authenticated-orcid":false,"given":"Gilberto","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5561-6406","authenticated-orcid":false,"given":"Concepci\u00f3n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.artint.2019.07.005","volume":"275","author":"F Aguado","year":"2019","unstructured":"Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., P\u00e9rez, G., Vidal, C.: Forgetting auxiliary atoms in forks. Artif. Intell. 275, 575\u2013601 (2019)","journal-title":"Artif. Intell."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aguado, F., Cabalar, P., Fandinno, J., P\u00e9rez, G., Vidal, C.: A logic program transformation for strongly persistent forgetting - extended abstract. In: Proc. of the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual event). Electronic Proceedings in Theoretical Computer Science (EPTCS), vol. 345, pp. 11\u201313 (2021)","DOI":"10.4204\/EPTCS.345.11"},{"issue":"4\u20135","key":"1_CR3","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1017\/S1471068415000277","volume":"15","author":"F Aguado","year":"2015","unstructured":"Aguado, F., Cabalar, P., Pearce, D., P\u00e9rez, G., Vidal, C.: A denotational semantics for equilibrium logic. Theory Pract. Logic Program. 15(4\u20135), 620\u2013634 (2015)","journal-title":"Theory Pract. Logic Program."},{"issue":"5\u20136","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1017\/S1471068419000346","volume":"19","author":"M Berthold","year":"2019","unstructured":"Berthold, M., Gon\u00e7alves, R., Knorr, M., Leite, J.: A syntactic operator for forgetting that satisfies strong persistence. Theory Pract. Logic Program. 19(5\u20136), 1038\u20131055 (2019)","journal-title":"Theory Pract. Logic Program."},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1017\/S1471068407003110","volume":"7","author":"P Cabalar","year":"2007","unstructured":"Cabalar, P., Ferraris, P.: Propositional theories are strongly equivalent to logic programs. Theory Pract. Logic Program. 7(6), 745\u2013759 (2007)","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/11595014_2","volume-title":"Progress in Artificial Intelligence","author":"P Cabalar","year":"2005","unstructured":"Cabalar, P., Pearce, D., Valverde, A.: Reducing propositional theories in equilibrium logic to logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 4\u201317. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11595014_2"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Cabalar, P., Pearce, D., Valverde, A.: Minimal logic programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 104\u2013118. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74610-2_8","DOI":"10.1007\/978-3-540-74610-2_8"},{"issue":"1\u20132","key":"1_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10472-006-9025-2","volume":"47","author":"P Ferraris","year":"2006","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the Lin-Zhao theorem. Ann. Math. Artif. Intell. 47(1\u20132), 79\u2013101 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"1_CR9","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: The ultimate guide to forgetting in answer set programming. In: KR, pp. 135\u2013144. AAAI Press (2016)"},{"key":"1_CR10","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: You can\u2019t always forget what you want: on the limits of forgetting in answer set programming. In: Kaminka, G.A., et al. (eds.) Proceedings of 22nd European Conference on Artificial Intelligence (ECAI 2016). Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 957\u2013965. IOS Press (2016)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. In: Sitzungsberichte der Preussischen Akademie der Wissenschaften, pp. 42\u201356. Deutsche Akademie der Wissenschaften zu Berlin (1930), reprint in Logik-Texte: Kommentierte Auswahl zur Geschichte der Modernen Logik, Akademie-Verlag (1986)","DOI":"10.1515\/9783112645826-009"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Knorr, M., Alferes, J.J.: Preserving strong equivalence while forgetting. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 412\u2013425. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_29","DOI":"10.1007\/978-3-319-11558-0_29"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 169\u2013181. Springer-Verlag (1999). https:\/\/doi.org\/10.1007\/978-3-642-60085-2_17","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.apal.2010.09.009","volume":"162","author":"G Mints","year":"2010","unstructured":"Mints, G.: Cut-free formulations for a quantified logic of here and there. Ann. Pure Appl. Logic 162(3), 237\u2013242 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 57\u201370. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023801","DOI":"10.1007\/BFb0023801"}],"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-15707-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:31:57Z","timestamp":1669411917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","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":"Genoa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2022.dibris.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}