{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:31:06Z","timestamp":1726043466268},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302436"},{"type":"electronic","value":"9783030302443"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30244-3_46","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T07:05:29Z","timestamp":1567494329000},"page":"552-565","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Forgetting in Answer Set Programming with Anonymous Cycles"],"prefix":"10.1007","author":[{"given":"Matti","family":"Berthold","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Knorr","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Leite","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"46_CR1","unstructured":"Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., P\u00e9rez, G., Vidal, C.: Forgetting auxiliary atoms in forks. In: Proceedings of the ASPOCP@LPNMR, vol. 1868. CEUR-WS.org (2017)"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","volume":"40","author":"S Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. J. Log. Program. 40(1), 1\u201346 (1999)","journal-title":"J. Log. Program."},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.artint.2017.11.007","volume":"256","author":"G Brewka","year":"2018","unstructured":"Brewka, G., Ellmauthaler, S., Gon\u00e7alves, R., Knorr, M., Leite, J., P\u00fchrer, J.: Reactive multi-context systems: heterogeneous reasoning in dynamic environments. Artif. Intell. 256, 68\u2013104 (2018)","journal-title":"Artif. Intell."},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-74610-2_8","volume-title":"Logic Programming","author":"P Cabalar","year":"2007","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"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Delgrande, J.P., Wang, K.: A syntax-independent approach to forgetting in disjunctive logic programs. In: Proceedings of AAAI, pp. 1482\u20131488. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9402"},{"issue":"14","key":"46_CR6","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.artint.2008.05.002","volume":"172","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Wang, K.: Semantic forgetting in answer set programming. Artif. Intell. 172(14), 1644\u20131672 (2008)","journal-title":"Artif. Intell."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, R., Janhunen, T., Knorr, M., Leite, J., Woltran, S.: Variable elimination for DLP-functions. In: Proceedings of KR, pp. 643\u2013644. AAAI Press (2018)","DOI":"10.1007\/978-3-319-65340-2_53"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, R., Janhunen, T., Knorr, M., Leite, J., Woltran, S.: Forgetting in modular answer set programming. In: Proceedigs of AAAI. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012843"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-48758-8_37","volume-title":"Logics in Artificial Intelligence","author":"R Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: Forgetting in ASP: the forgotten properties. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 543\u2013550. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_37"},{"key":"46_CR10","unstructured":"Goncalves, R., Knorr, M., Leite, J.: The ultimate guide to forgetting in answer set programming. In: Proceedings of KR, pp. 135\u2013144. AAAI Press (2016)"},{"key":"46_CR11","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: Proceedings of ECAI, pp. 957\u2013965. IOS Press (2016)"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-65340-2_53","volume-title":"Progress in Artificial Intelligence","author":"R Gon\u00e7alves","year":"2017","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: Iterative variable elimination in ASP. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds.) EPIA 2017. LNCS (LNAI), vol. 10423, pp. 643\u2013656. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65340-2_53"},{"issue":"5\u20136","key":"46_CR13","first-page":"837","volume":"17","author":"R Gon\u00e7alves","year":"2017","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J., Woltran, S.: When you must forget: beyond strong persistence when forgetting in answer set programming. TPLP 17(5\u20136), 837\u2013854 (2017)","journal-title":"TPLP"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"K Inoue","year":"1998","unstructured":"Inoue, K., Sakama, C.: Negation as failure in the head. J. Log. Program. 35(1), 39\u201378 (1998)","journal-title":"J. Log. Program."},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30227-8_17","volume-title":"Logics in Artificial Intelligence","author":"K Inoue","year":"2004","unstructured":"Inoue, K., Sakama, C.: Equivalence of logic programs under updates. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 174\u2013186. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30227-8_17"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-11558-0_29","volume-title":"Logics in Artificial Intelligence","author":"M Knorr","year":"2014","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"},{"issue":"9\u201310","key":"46_CR17","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1016\/j.artint.2011.01.007","volume":"175","author":"M Knorr","year":"2011","unstructured":"Knorr, M., Alferes, J.J., Hitzler, P.: Local closed world reasoning with description logics under the well-founded semantics. Artif. Intell. 175(9\u201310), 1528\u20131554 (2011)","journal-title":"Artif. Intell."},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-61660-5_2","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Leite","year":"2017","unstructured":"Leite, J.: A bird\u2019s-eye view of forgetting in answer-set programming. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 10\u201322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_2"},{"issue":"4","key":"46_CR19","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(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"46_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-20895-9_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Slota","year":"2011","unstructured":"Slota, M., Leite, J.: Back and forth between rules and SE-models. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 174\u2013186. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_16"},{"issue":"6","key":"46_CR21","first-page":"869","volume":"14","author":"M Slota","year":"2014","unstructured":"Slota, M., Leite, J.: The rise and fall of semantic rule updates based on se-models. TPLP 14(6), 869\u2013907 (2014)","journal-title":"TPLP"},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.artint.2015.07.008","volume":"229","author":"M Slota","year":"2015","unstructured":"Slota, M., Leite, J., Swift, T.: On updates of hybrid knowledge bases composed of ontologies and rules. Artif. Intell. 229, 33\u2013104 (2015)","journal-title":"Artif. Intell."},{"key":"46_CR23","unstructured":"Wang, Y., Wang, K., Zhang, M.: Forgetting for answer set programs revisited. In: Rossi, F. (ed.) Proceedings of IJCAI, pp. 1162\u20131168. IJCAI\/AAAI (2013)"},{"key":"46_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1613\/jair.4297","volume":"50","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Zhang, Y., Zhou, Y., Zhang, M.: Knowledge forgetting in answer set programming. J. Artif. Intell. Res. (JAIR) 50, 31\u201370 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"8\u20139","key":"46_CR25","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.artint.2006.02.002","volume":"170","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Foo, N.Y.: Solving logic program conflict through strong and weak forgettings. Artif. Intell. 170(8\u20139), 739\u2013778 (2006)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30244-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T06:25:23Z","timestamp":1664259923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30244-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302436","9783030302443"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30244-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vila Real","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2019.utad.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"252","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":"119","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":"6","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":"47% - 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.32","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":"1.86","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)"}}]}}