{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:38Z","timestamp":1740099518231,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"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-30179-8_11","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"131-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong Equivalence for Argumentation Frameworks with Collective Attacks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2269-8193","authenticated-orcid":false,"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0355-3535","authenticated-orcid":false,"given":"Anna","family":"Rapberger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-8972","authenticated-orcid":false,"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.artint.2012.08.004","volume":"193","author":"R Baumann","year":"2012","unstructured":"Baumann, R.: Normal and strong expansion equivalence for argumentation frameworks. Artif. Intell. 193, 18\u201344 (2012)","journal-title":"Artif. Intell."},{"key":"11_CR2","unstructured":"Baumann, R.: Characterizing equivalence notions for labelling-based semantics. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, 25\u201329 April 2016, Cape Town, South Africa, pp. 22\u201332. AAAI Press (2016)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1093\/logcom\/exv001","volume":"28","author":"R Baumann","year":"2018","unstructured":"Baumann, R., Brewka, G.: The equivalence zoo for Dung-style semantics. J. Log. Comput. 28(3), 477\u2013498 (2018)","journal-title":"J. Log. Comput."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Baumann, R., Dvo\u0159\u00e1k, W., Linsbichler, T., Woltran, S.: A general notion of equivalence for abstract argumentation. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, 19\u201325 August 2017, Melbourne, Australia, pp. 800\u2013806 (2017)","DOI":"10.24963\/ijcai.2017\/111"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MIS.2013.122","volume":"29","author":"G Brewka","year":"2014","unstructured":"Brewka, G., Polberg, S., Woltran, S.: Generalizations of Dung frameworks and their role in formal argumentation. IEEE Intell. Syst. 29(1), 30\u201338 (2014)","journal-title":"IEEE Intell. Syst."},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"11_CR7","unstructured":"Dvo\u0159\u00e1k, W., Fandinno, J., Woltran, S.: On the expressive power of collective attacks. In: Modgil, S., Budzynska, K., Lawrence, J. (eds.) Computational Models of Argument - Proceedings of COMMA 2018, 12\u201314 September 2018, Warsaw, Poland. Frontiers in Artificial Intelligence and Applications, vol. 305, pp. 49\u201360. IOS Press (2018)"},{"key":"11_CR8","unstructured":"Dvo\u0159\u00e1k, W., Gre\u00dfler, A., Woltran, S.: Evaluating SETAFs via answer-set programming. In: Thimm, M., Cerutti, F., Vallati, M. (eds.) Proceedings of the Second International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018) Co-located with the 7th International Conference on Computational Models of Argument (COMMA 2018), 11 September 2018, Warsaw, Poland. CEUR Workshop Proceedings, vol. 2171, pp. 10\u201321. CEUR-WS.org (2018)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-030-19570-0_8","volume-title":"Logics in Artificial Intelligence","author":"W Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, W., J\u00e4rvisalo, M., Linsbichler, T., Niskanen, A., Woltran, S.: Preprocessing argumentation frameworks via replacement patterns. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 116\u2013132. Springer, Cham (2019). \n                    https:\/\/doi.org\/10.1007\/978-3-030-19570-0_8"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ijar.2019.03.006","volume":"109","author":"G Flouris","year":"2019","unstructured":"Flouris, G., Bikakis, A.: A comprehensive study of argumentation frameworks with sets of attacking arguments. Int. J. Approx. Reason. 109, 55\u201386 (2019)","journal-title":"Int. J. Approx. Reason."},{"issue":"4","key":"11_CR11","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. Logic 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Nielsen, S.H., Parsons, S.: A generalization of Dung\u2019s abstract framework for argumentation: arguing with sets of attacking arguments. In: Maudet, N., Parsons, S., Rahwan, I. (eds.) ArgMAS 2006. LNCS (LNAI), vol. 4766, pp. 54\u201373. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-75526-5_4","DOI":"10.1007\/978-3-540-75526-5_4"},{"issue":"14\u201315","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/j.artint.2011.06.003","volume":"175","author":"E Oikarinen","year":"2011","unstructured":"Oikarinen, E., Woltran, S.: Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14\u201315), 1985\u20132009 (2011)","journal-title":"Artif. Intell."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Polberg, S.: Developing the abstract dialectical framework. Ph.D. thesis, TU Wien, Institute of Information Systems (2017)","DOI":"10.1007\/978-3-319-48758-8_28"},{"issue":"3\u20134","key":"11_CR15","first-page":"245","volume":"48","author":"M Truszczynski","year":"2006","unstructured":"Truszczynski, M.: Strong and uniform equivalence of nonmonotonic theories - an algebraic approach. Ann. Math. Artif. Intell. 48(3\u20134), 245\u2013265 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-24609-1_25","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence for causal theories. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 289\u2013301. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-24609-1_25"},{"key":"11_CR17","unstructured":"Yun, B., Vesic, S., Croitoru, M.: Toward a more efficient generation of structured argumentation graphs. In: Modgil, S., Budzynska, K., Lawrence, J. (eds.) Computational Models of Argument - Proceedings of COMMA 2018, 12\u201314 September 2018, Warsaw, Poland. Frontiers in Artificial Intelligence and Applications, vol. 305, pp. 205\u2013212. IOS Press (2018)"}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:37:46Z","timestamp":1567971466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_11","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":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","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":"82","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":"16","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":"13","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":"20% - 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":"5","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)"}}]}}