{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:23Z","timestamp":1742912843678,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030770907"},{"type":"electronic","value":"9783030770914"}],"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-77091-4_8","type":"book-chapter","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T16:03:21Z","timestamp":1621613001000},"page":"117-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Semi-stable Extensions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0755-0358","authenticated-orcid":false,"given":"Federico","family":"Cerutti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4771-4265","authenticated-orcid":false,"given":"Massimiliano","family":"Giacomin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-3570","authenticated-orcid":false,"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[]},{"given":"Tobia","family":"Zanetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"issue":"5439","key":"8_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barabasi","year":"1999","unstructured":"Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P Baroni","year":"2011","unstructured":"Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365\u2013410 (2011)","journal-title":"Knowl. Eng. Rev."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.artint.2013.05.002","volume":"203","author":"P Baroni","year":"2013","unstructured":"Baroni, P., Cerutti, F., Dunne, P.E., Giacomin, M.: Automata for infinite argumentation structures. Artif. Intell. 203, 104\u2013150 (2013)","journal-title":"Artif. Intell."},{"key":"8_CR4","unstructured":"Bistarelli, S., Rossi, F., Santini, F.: Benchmarking hard problems in random abstract AFs: the stable semantics. In: Proceedings of COMMA, pp. 153\u2013160 (2014)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11853886_11","volume-title":"Logics in Artificial Intelligence","author":"M Caminada","year":"2006","unstructured":"Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111\u2013123. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_11"},{"key":"8_CR6","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of COMMA 2006, pp. 121\u2013130 (2006)"},{"issue":"2\u20133","key":"8_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11225-009-9218-x","volume":"93","author":"M Caminada","year":"2009","unstructured":"Caminada, M., Gabbay, D.M.: A logical account of formal argumentation. Stud. Logica. 93(2\u20133), 109\u2013145 (2009). https:\/\/doi.org\/10.1007\/s11225-009-9218-x. (Special issue: new ideas in argumentation theory)","journal-title":"Stud. Logica."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: A SAT-based approach for computing extensions in abstract argumentation. In: Second International Workshop on Theory and Applications of Formal Argumentation (TAFA-2013) (2013)","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: Computing preferred extensions in abstract argumentation: a SAT-based approach. Technical report (2013). http:\/\/arxiv.org\/abs\/1310.4986","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"8_CR10","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: Generating structured argumentation frameworks: AFBenchGen2. In: Proceedings of COMMA, pp. 467\u2013468 (2016)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2019.08.001","volume":"276","author":"F Cerutti","year":"2019","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: How we designed winning algorithms for abstract argumentation and which insight we attained. Artif. Intell. 276, 1\u201340 (2019). https:\/\/doi.org\/10.1016\/j.artint.2019.08.001","journal-title":"Artif. Intell."},{"key":"8_CR12","unstructured":"Cerutti, F., Oren, N., Strass, H., Thimm, M., Vallati, M.: A benchmark framework for a computational argumentation competition. In: Proceedings of the 5th International Conference on Computational Models of Argument, pp. 459\u2013460 (2014)"},{"issue":"2","key":"8_CR13","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\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Dv\u01d2r\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53\u201378 (2014)","DOI":"10.1016\/j.artint.2013.10.001"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/19462166.2010.486479","volume":"1","author":"U Egly","year":"2010","unstructured":"Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument Comput. 1(2), 147\u2013177 (2010)","journal-title":"Argument Comput."},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"I. Publ. Math. Debrecen"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"103193","DOI":"10.1016\/j.artint.2019.103193","volume":"279","author":"SA Gaggl","year":"2020","unstructured":"Gaggl, S.A., Linsbichler, T., Maratea, M., Woltran, S.: Design and results of the second international competition on computational models of argumentation. Artif. Intell. 279, 103193 (2020). https:\/\/doi.org\/10.1016\/j.artint.2019.103193","journal-title":"Artif. Intell."},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2007","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reason. 40(1), 1\u201333 (2007). https:\/\/doi.org\/10.1007\/s10817-007-9084-z","journal-title":"J. Autom. Reason."},{"key":"8_CR21","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 615\u2013622. AAAI Press (2013)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 250\u2013264. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_19"},{"key":"8_CR23","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). https:\/\/doi.org\/10.1023\/A:1018930122475","journal-title":"Ann. Math. Artif. Intell."},{"key":"8_CR24","unstructured":"Pu, F., Ya, H., Luo, G.: argmat-SAT: Applying SAT Solvers for Argumentation Problems Based on Boolean Matrix Algebra (2017). http:\/\/argumentationcompetition.org\/2017\/argmat-sat.pdf"},{"key":"8_CR25","volume-title":"Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge","author":"N Rescher","year":"1977","unstructured":"Rescher, N.: Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge. Suny Press, Albany (1977)"},{"issue":"1","key":"8_CR26","first-page":"102","volume":"37","author":"M Thimm","year":"2016","unstructured":"Thimm, M., Villata, S., Cerutti, F., Oren, N., Strass, H., Vallati, M.: Summary report of the first international competition on computational models of argumentation. AI Mag. 37(1), 102 (2016)","journal-title":"AI Mag."},{"issue":"3","key":"8_CR27","first-page":"90","volume":"36","author":"M Vallati","year":"2015","unstructured":"Vallati, M., Chrpa, L., Grzes, M., McCluskey, T.L., Roberts, M., Sanner, S.: The 2014 international planning competition: progress and trends. AI Mag. 36(3), 90\u201398 (2015)","journal-title":"AI Mag."},{"key":"8_CR28","unstructured":"Verheij, B.: The influence of defeated arguments in defeasible argumentation. In: WOCFAI, vol. 95, pp. 429\u2013440. Citeseer (1995)"},{"key":"8_CR29","unstructured":"Verheij, B.: Two approaches to dialectical argumentation: admissible sets and argumentation stages. In: Meyer, J.J., van der Gaag, L.C. (eds.) Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC 1996), Utrecht, NL, pp. 357\u2013368 (1996)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-40624-9_9","volume-title":"Computational Logic in Multi-Agent Systems","author":"JP Wallner","year":"2013","unstructured":"Wallner, J.P., Weissenbacher, G., Woltran, S.: Advanced SAT techniques for abstract argumentation. In: Leite, J., Son, T.C., Torroni, P., van der Torre, L., Woltran, S. (eds.) CLIMA 2013. LNCS (LNAI), vol. 8143, pp. 138\u2013154. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40624-9_9"},{"issue":"6684","key":"8_CR31","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"6","key":"8_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80\u201383 (1945)","journal-title":"Biom. Bull."},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Yu, Y., Subramanyan, P., Tsiskaridze, N., Malik, S.: All-SAT using minimal blocking clauses. In: 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems, pp. 86\u201391. IEEE, January 2014. https:\/\/doi.org\/10.1109\/VLSID.2014.22","DOI":"10.1109\/VLSID.2014.22"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2020 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77091-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T06:39:22Z","timestamp":1672209562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77091-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770907","9783030770914"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77091-4_8","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":"22 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","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":"aiia2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2020.disco.unimib.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":"89","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":"27","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":"3","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":"30% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}