{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:36:53Z","timestamp":1726043813505},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276287"},{"type":"electronic","value":"9783030276294"}],"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-27629-4_15","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:14:09Z","timestamp":1568186049000},"page":"139-151","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Computing the Set of Semi-stable Extensions"],"prefix":"10.1007","author":[{"given":"Gianvincenzo","family":"Alfano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"15_CR1","unstructured":"Alfano, G., Greco, S., Parisi, F.: Computing stable and preferred extensions of dynamic bipolar argumentation frameworks. In: Proceedings of the 1st Workshop on Advances in Argumentation in AI Co-located with AI*IA, pp. 28\u201342 (2017)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alfano, G., Greco, S., Parisi, F.: Efficient computation of extensions for dynamic abstract argumentation frameworks: an incremental approach. In: Proceedings of IJCAI, pp. 49\u201355 (2017)","DOI":"10.24963\/ijcai.2017\/8"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Alfano, G., Greco, S., Parisi, F.: Computing extensions of dynamic abstract argumentation frameworks with second-order attacks. In: Proceedings of IDEAS, pp. 183\u2013192 (2018)","DOI":"10.1145\/3216122.3216162"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3233\/IA-180002","volume":"12","author":"G Alfano","year":"2018","unstructured":"Alfano, G., Greco, S., Parisi, F.: A meta-argumentation approach for the efficient computation of stable and preferred extensions in dynamic bipolar argumentation frameworks. Intelligenza Artificiale 12(2), 193\u2013211 (2018)","journal-title":"Intelligenza Artificiale"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Alfano, G., Greco, S., Parisi, F.: An efficient algorithm for skeptical preferred acceptance in dynamic argumentation frameworks. In: Proceedings of IJCAI (2019, to appear)","DOI":"10.24963\/ijcai.2019\/3"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Alfano, G., Greco, S., Parisi, F.: On scaling the enumeration of the preferred extensions of abstract argumentation frameworks. In: Proceedings of ACM\/SIGAPP SAC, pp. 1147\u20131153 (2019)","DOI":"10.1145\/3297280.3297393"},{"key":"15_CR7","unstructured":"Alfano, G., Greco, S., Parisi, F., Simari, G.I., Simari, G.R.: An incremental approach to structured argumentation over dynamic knowledge bases. In: Proceeding of KR, pp. 78\u201387 (2018)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Alfano, G., Greco, S., Parisi, F., Simari, G.I., Simari, G.R.: Incremental computation of warranted arguments in dynamic defeasible argumentation: the rule addition case. In: Proceedings of ACM\/SIGAPP SAC, pp. 911\u2013917 (2018)","DOI":"10.1145\/3167132.3167232"},{"issue":"3","key":"15_CR9","first-page":"25","volume":"38","author":"K Atkinson","year":"2017","unstructured":"Atkinson, K., et al.: Towards artificial argumentation. Artif. Intell. Mag. 38(3), 25\u201336 (2017)","journal-title":"Artif. Intell. Mag."},{"issue":"4","key":"15_CR10","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":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-02906-6_9","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"P Baroni","year":"2009","unstructured":"Baroni, P., Cerutti, F., Giacomin, M., Guida, G.: Encompassing attacks to attacks in abstract argumentation frameworks. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 83\u201394. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02906-6_9"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.artint.2014.03.003","volume":"212","author":"P Baroni","year":"2014","unstructured":"Baroni, P., Giacomin, M., Liao, B.: On topology-related properties of abstract argumentation semantics. A correction and extension to dynamics of argumentation systems: a division-based method. Artif. Intell. 212, 104\u2013115 (2014)","journal-title":"Artif. Intell."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-20895-9_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"R Baumann","year":"2011","unstructured":"Baumann, R.: Splitting an Argumentation Framework. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 40\u201353. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-20895-9_6"},{"key":"15_CR14","unstructured":"Baumann, R., Brewka, G.: Expanding argumentation frameworks: enforcing and monotonicity results. In: Proceedings of COMMA, pp. 75\u201386 (2010)"},{"issue":"10\u201315","key":"15_CR15","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","volume":"171","author":"TJM Bench-Capon","year":"2007","unstructured":"Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell. 171(10\u201315), 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001","volume-title":"Elements of Argumentation","author":"P Besnard","year":"2008","unstructured":"Besnard, P., Hunter, A.: Elements of Argumentation. MIT Press, Cambridge (2008)"},{"key":"15_CR17","unstructured":"Bliem, B., Hecher, M., Woltran, S.: On efficiently enumerating semi-stable extensions via dynamic programming on tree decompositions. In: Proceedings of COMMA, pp. 107\u2013118 (2016)"},{"key":"15_CR18","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of COMMA, pp. 121\u2013130 (2006)"},{"key":"15_CR19","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: ArgSemSAT: solving argumentation problems using SAT. In: Proceedings of COMMA, pp. 455\u2013456 (2014)"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3233\/AAC-170017","volume":"8","author":"CAD Deagustini","year":"2017","unstructured":"Deagustini, C.A.D., Dalib\u00f3n, S.E.F., Gottifredi, S., Falappa, M.A., Ches\u00f1evar, C.I., Simari, G.R.: Defeasible argumentation over relational databases. Argument Comput. 8(1), 35\u201359 (2017)","journal-title":"Argument Comput."},{"issue":"2","key":"15_CR21","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":"18","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.artint.2009.09.001","volume":"173","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics. Artif. Intell. 173(18), 1559\u20131591 (2009)","journal-title":"Artif. Intell."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-87803-2_14","volume-title":"Logics in Artificial Intelligence","author":"PE Dunne","year":"2008","unstructured":"Dunne, P.E., Caminada, M.: Computational complexity of semi-stable semantics in abstract argumentation frameworks. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS, vol. 5293, pp. 153\u2013165. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-87803-2_14"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-0-387-98197-0_5","volume-title":"Argumentation in Artificial Intelligence","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 85\u2013104. Springer, Boston (2009). \n                      https:\/\/doi.org\/10.1007\/978-0-387-98197-0_5"},{"key":"15_CR25","unstructured":"Dvor\u00e1k, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for argumentation. In: Proceedings of KR (2010)"},{"issue":"11","key":"15_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.ipl.2010.04.005","volume":"110","author":"W Dvor\u00e1k","year":"2010","unstructured":"Dvor\u00e1k, W., Woltran, S.: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11), 425\u2013430 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"15_CR27","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2749463","volume":"16","author":"B Fazzinga","year":"2015","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation frameworks. ACM Trans. Comput. Log. 16(3), 22 (2015)","journal-title":"ACM Trans. Comput. Log."},{"key":"15_CR28","first-page":"106","volume":"69","author":"B Fazzinga","year":"2016","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On efficiently estimating the probability of extensions in abstract argumentation frameworks. IJAR 69, 106\u2013132 (2016)","journal-title":"IJAR"},{"issue":"1\u20132","key":"15_CR29","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068403001674","volume":"4","author":"AJ Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, A.J., Simari, G.R.: Defeasible logic programming: an argumentative approach. Theory Pract. Log. Program. (TPLP) 4(1\u20132), 95\u2013138 (2004)","journal-title":"Theory Pract. Log. Program. (TPLP)"},{"key":"15_CR30","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming, vol. 2, pp. 1070\u20131080 (1988)"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Greco, S., Parisi, F.: Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks. In: Proceedings of ECAI, pp. 1668\u20131669 (2016)","DOI":"10.1007\/978-3-319-48758-8_19"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-319-48758-8_19","volume-title":"Logics in Artificial Intelligence","author":"S Greco","year":"2016","unstructured":"Greco, S., Parisi, F.: Incremental computation of deterministic extensions for dynamic argumentation frameworks. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS, vol. 10021, pp. 288\u2013304. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48758-8_19"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-57285-7_5","volume-title":"Conflict Resolution in Decision Making","author":"S Greco","year":"2017","unstructured":"Greco, S., Parisi, F.: Incremental computation of grounded semantics for dynamic abstract argumentation frameworks. In: Aydo\u011fan, R., Baarslag, T., Gerding, E., Jonker, C.M., Julian, V., Sanchez-Anguix, V. (eds.) COREDEMA 2016. LNCS, vol. 10238, pp. 66\u201381. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57285-7_5"},{"issue":"3","key":"15_CR34","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ll, M., Pichler, R., Woltran, S.: On the complexity of enumerating the extensions of abstract argumentation frameworks. In: Proceedings of IJCAI, pp. 1145\u20131152 (2017)","DOI":"10.24963\/ijcai.2017\/159"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Lagniez, J., Lonca, E., Mailly, J.: CoQuiAAS: a constraint-based quick abstract argumentation solver. In: Proceeding of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 928\u2013935 (2015)","DOI":"10.1109\/ICTAI.2015.134"},{"issue":"11","key":"15_CR37","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1016\/j.artint.2011.03.006","volume":"175","author":"BS Liao","year":"2011","unstructured":"Liao, B.S., Jin, L., Koons, R.C.: Dynamics of argumentation systems: a division-based method. Artif. Intell. 175(11), 1790\u20131814 (2011)","journal-title":"Artif. Intell."},{"issue":"3\u20134","key":"15_CR38","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10472-013-9364-8","volume":"67","author":"B Liao","year":"2013","unstructured":"Liao, B.: Toward incremental computation of argumentation semantics: a decomposition-based approach. Ann. Math. Artif. Intell. 67(3\u20134), 319\u2013358 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"15_CR39","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1093\/logcom\/exs047","volume":"23","author":"B Liao","year":"2013","unstructured":"Liao, B., Huang, H.: Partial semantics of argumentation: basic properties and empirical results. J. Log. Comput. 23(3), 541\u2013562 (2013)","journal-title":"J. Log. Comput."},{"issue":"9\u201310","key":"15_CR40","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.artint.2009.02.001","volume":"173","author":"S Modgil","year":"2009","unstructured":"Modgil, S.: Reasoning about preferences in argumentation frameworks. Artif. Intell. 173(9\u201310), 901\u2013934 (2009)","journal-title":"Artif. Intell."},{"key":"15_CR41","unstructured":"Modgil, S., Prakken, H.: Revisiting preferences and argumentation. In: Proceedings of IJCAI, pp. 1021\u20131026 (2011)"},{"key":"15_CR42","series-title":"Law, Governance and Technology","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-94-007-5583-3_21","volume-title":"Agreement Technologies","author":"S Modgil","year":"2013","unstructured":"Modgil, S., et al.: The added value of argumentation: examples and challenges. In: Ossowski, S. (ed.) Agreement Technologies. LGTS, vol. 8, pp. 357\u2013404. Springer, New York (2013). \n                      https:\/\/doi.org\/10.1007\/978-94-007-5583-3_21"},{"issue":"14\u201315","key":"15_CR43","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":"15_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0","volume-title":"Argumentation in Artificial Intelligence","author":"I Rahwan","year":"2009","unstructured":"Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence, 1st edn. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-0-387-98197-0","edition":"1"},{"issue":"1\u20134","key":"15_CR45","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10472-012-9317-7","volume":"66","author":"S Villata","year":"2012","unstructured":"Villata, S., Boella, G., Gabbay, D.M., van der Torre, L.W.N.: Modelling defeasible and prioritized support in bipolar argumentation. Ann. Math. Artif. Intell. 66(1\u20134), 163\u2013197 (2012)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27629-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:25:57Z","timestamp":1568186757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-27629-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276287","9783030276294"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27629-4_15","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":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FQAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Flexible Query Answering Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amantea","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fqas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.fqas2019.units.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}