{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:45:43Z","timestamp":1762325143167,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030893903"},{"type":"electronic","value":"9783030893910"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-89391-0_18","type":"book-chapter","created":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T11:33:44Z","timestamp":1634211224000},"page":"322-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extension-Based Semantics for\u00a0Incomplete Argumentation Frameworks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9102-7329","authenticated-orcid":false,"given":"Jean-Guy","family":"Mailly","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,15]]},"reference":[{"issue":"1\u20133","key":"18_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1014490210693","volume":"34","author":"L Amgoud","year":"2002","unstructured":"Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Ann. Math. Artif. Intell. 34(1\u20133), 197\u2013215 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"10","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1002\/int.20307","volume":"23","author":"L Amgoud","year":"2008","unstructured":"Amgoud, L., Cayrol, C., Lagasquie-Schiex, M., Livet, P.: On bipolarity in argumentation frameworks. Int. J. Intell. Syst. 23(10), 1062\u20131093 (2008)","journal-title":"Int. J. Intell. Syst."},{"key":"18_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity - A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"unstructured":"Baroni, P., Caminada, M., Giacomin, M.: Abstract argumentation frameworks and their semantics. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 159\u2013236. College Publications (2018)","key":"18_CR4"},{"unstructured":"Baroni, P., Giacomin, M., Liao, B., van der Torre, L.: Encompassing uncertainty in argumentation schemes. In: Proceedings of the Workshop on Frontiers and Connections between Argumentation Theory and Natural Language Processing, Forl\u00ec-Cesena, Italy, 21\u201325 July 2014 (2014)","key":"18_CR5"},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103470","volume":"295","author":"D Baumeister","year":"2021","unstructured":"Baumeister, D., J\u00e4rvisalo, M., Neugebauer, D., Niskanen, A., Rothe, J.: Acceptance in incomplete argumentation frameworks. Artif. Intell. 295, 103470 (2021)","journal-title":"Artif. Intell."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-23114-3_21","volume-title":"Algorithmic Decision Theory","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Neugebauer, D., Rothe, J.: Verification in attack-incomplete argumentation frameworks. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 341\u2013358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23114-3_21"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.08.001","volume":"264","author":"D Baumeister","year":"2018","unstructured":"Baumeister, D., Neugebauer, D., Rothe, J., Schadrack, H.: Verification in incomplete argumentation frameworks. Artif. Intell. 264, 1\u201326 (2018)","journal-title":"Artif. Intell."},{"unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 59\u201364 (2004)","key":"18_CR9"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.3233\/AAC-190463","volume":"10","author":"M Caminada","year":"2019","unstructured":"Caminada, M., Dunne, P.E.: Strong admissibility revisited: theory and applications. Argument Comput. 10(3), 277\u2013300 (2019)","journal-title":"Argument Comput."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-75256-1_25","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C Cayrol","year":"2007","unstructured":"Cayrol, C., Devred, C., Lagasquie-Schiex, M.C.: Handling ignorance in argumentation: semantics of partial argumentation frameworks. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 259\u2013270. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75256-1_25"},{"issue":"10\u201315","key":"18_CR12","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.artint.2007.04.012","volume":"171","author":"S Coste-Marquis","year":"2007","unstructured":"Coste-Marquis, S., Devred, C., Konieczny, S., Lagasquie-Schiex, M., Marquis, P.: On the merging of Dung\u2019s argumentation systems. Artif. Intell. 171(10\u201315), 730\u2013753 (2007)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Dimopoulos, Y., Mailly, J.G., Moraitis, P.: Control argumentation frameworks. In: 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), pp. 4678\u20134685 (2018)","key":"18_CR13","DOI":"10.1609\/aaai.v32i1.11583"},{"issue":"2","key":"18_CR14","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."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.artint.2010.09.005","volume":"175","author":"PE Dunne","year":"2011","unstructured":"Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.J.: Weighted argument systems: basic definitions, algorithms, and complexity results. Artif. Intell. 175(2), 457\u2013486 (2011)","journal-title":"Artif. Intell."},{"unstructured":"Dvor\u00e1k, W., Dunne, P.E.: Computational problems in formal argumentation and their complexity. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 631\u2013688. College Publications (2018)","key":"18_CR16"},{"unstructured":"Egly, U., Woltran, S.: Reasoning in argumentation frameworks using quantified boolean formulas. In: Computational Models of Argument: Proceedings of COMMA 2006, 11\u201312 September 2006, Liverpool, UK, vol. 144, pp. 133\u2013144 (2006)","key":"18_CR17"},{"doi-asserted-by":"crossref","unstructured":"Fazzinga, B., Flesca, S., Furfaro, F.: Revisiting the notion of extension over incomplete abstract argumentation frameworks. In: 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), pp. 1712\u20131718 (2020)","key":"18_CR18","DOI":"10.24963\/ijcai.2020\/237"},{"unstructured":"Hunter, A.: Some foundations for probabilistic abstract argumentation. In: Verheij, B., Szeider, S., Woltran, S. (eds.) Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, 10\u201312 September 2012. Frontiers in Artificial Intelligence and Applications, vol. 245, pp. 117\u2013128. IOS Press (2012)","key":"18_CR19"},{"doi-asserted-by":"crossref","unstructured":"Lagniez, J.M., Lonca, E., Mailly, J.G.: CoQuiAAS: a constraint-based quick abstract argumentation solver. In: 27th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2015, Vietri sul Mare, Italy, 9\u201311 November 2015, pp. 928\u2013935. IEEE Computer Society (2015)","key":"18_CR20","DOI":"10.1109\/ICTAI.2015.134"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1162\/coli_a_00364","volume":"45","author":"J Lawrence","year":"2019","unstructured":"Lawrence, J., Reed, C.: Argument mining: a survey. Comput. Linguist. 45(4), 765\u2013818 (2019)","journal-title":"Comput. Linguist."},{"doi-asserted-by":"crossref","unstructured":"Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Proceedings of the First International Workshop on Theory and Applications of Formal Argumentation (TAFA 2011), pp. 1\u201316 (2011)","key":"18_CR22","DOI":"10.1007\/978-3-642-29184-5_1"},{"unstructured":"Mailly, J.G.: Possible controllability of control argumentation frameworks. In: 8th International Conference on Computational Models of Argument (COMMA 2020), pp. 283\u2013294 (2020)","key":"18_CR23"},{"doi-asserted-by":"crossref","unstructured":"Niskanen, A., J\u00e4rvisalo, M.: $$\\rm \\mu $$-toksia: an efficient abstract argumentation reasoner. In: Calvanese, D., Erdem, E., Thielscher, M. (eds.) Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, 12\u201318 September 2020, pp. 800\u2013804 (2020)","key":"18_CR24","DOI":"10.24963\/kr.2020\/82"},{"doi-asserted-by":"crossref","unstructured":"Niskanen, A., Neugebauer, D., J\u00e4rvisalo, M.: Controllability of control argumentation frameworks. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 1855\u20131861 (2020)","key":"18_CR25","DOI":"10.24963\/ijcai.2020\/257"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.3233\/AAC-200904","volume":"12","author":"J Rossit","year":"2021","unstructured":"Rossit, J., Mailly, J.G., Dimopoulos, Y., Moraitis, P.: United we stand: accruals in strength-based argumentation. Argument Comput. 12(1), 87\u2013113 (2021)","journal-title":"Argument Comput."}],"container-title":["Lecture Notes in Computer Science","Logic and Argumentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89391-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T23:15:52Z","timestamp":1725923752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89391-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030893903","9783030893910"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89391-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CLAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic and Argumentation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"clar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.xixilogic.org\/events\/clar2021\/","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":"58","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":"20","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":"10","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":"34% - 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)"}},{"value":"5 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}