{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:19Z","timestamp":1750220959108,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE40-0021"],"award-info":[{"award-number":["ANR-16-CE40-0021"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,30]]},"DOI":"10.1145\/3341105.3373907","type":"proceedings-article","created":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:13:52Z","timestamp":1585484032000},"page":"940-947","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Formal verification of debates in argumentation theory"],"prefix":"10.1145","author":[{"given":"Ria","family":"Jha","sequence":"first","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Belardinelli","sequence":"additional","affiliation":[{"name":"Imperial College London, UK & Universit\u00e9 d'Evry, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Toni","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585270"},{"key":"e_1_3_2_1_2_1","volume-title":"The Pyglaf Argumentation Reasoner. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP","volume":"58","author":"Alviano M.","year":"2018","unstructured":"M. Alviano . 2018 . The Pyglaf Argumentation Reasoner. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017), Vol. 58 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2:1--2:3. M. Alviano. 2018. The Pyglaf Argumentation Reasoner. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017), Vol. 58. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2:1--2:3."},{"volume-title":"Principles of model checking","author":"Baier C.","key":"e_1_3_2_1_3_1","unstructured":"C. Baier and J.-P. Katoen . 2008. Principles of model checking . MIT press . C. Baier and J.-P. Katoen. 2008. Principles of model checking. MIT press."},{"volume-title":"Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15)","author":"Belardinelli F.","key":"e_1_3_2_1_4_1","unstructured":"F. Belardinelli , D. Grossi , and N. Maudet . 2015. Formal Analysis of Dialogues on Infinite Argumentation Frameworks . In Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15) . AAAI Press, 861--867. F. Belardinelli, D. Grossi, and N. Maudet. 2015. Formal Analysis of Dialogues on Infinite Argumentation Frameworks. In Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15). AAAI Press, 861--867."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"P. \u010cerm\u00e1k A. Lomuscio F. Mogavero and A. Murano. 2014. MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. In Computer Aided Verification. Springer International Publishing Cham 525--532. P. \u010cerm\u00e1k A. Lomuscio F. Mogavero and A. Murano. 2014. MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. In Computer Aided Verification . Springer International Publishing Cham 525--532.","DOI":"10.1007\/978-3-319-08867-9_34"},{"key":"e_1_3_2_1_6_1","first-page":"455","article-title":"ArgSemSAT: Solving Argumentation Problems Using SAT","volume":"14","author":"Cerutti F.","year":"2014","unstructured":"F. Cerutti , M. Giacomin , and M. Vallati . 2014 . ArgSemSAT: Solving Argumentation Problems Using SAT . COMMA 14 (2014), 455 -- 456 . F. Cerutti, M. Giacomin, and M. Vallati. 2014. ArgSemSAT: Solving Argumentation Problems Using SAT. COMMA 14 (2014), 455--456.","journal-title":"COMMA"},{"key":"e_1_3_2_1_7_1","volume-title":"Frontiers in Artificial Intelligence and Applications","volume":"287","author":"Cerutti F.","unstructured":"F. Cerutti , M. Giacomin , and M. Vallati . 2016. Generating structured argumentation frameworks: Afbenchgen2 . Frontiers in Artificial Intelligence and Applications , Vol. 287 . IOS Press, 467--468. F. Cerutti, M. Giacomin, and M. Vallati. 2016. Generating structured argumentation frameworks: Afbenchgen2. Frontiers in Artificial Intelligence and Applications, Vol. 287. IOS Press, 467--468."},{"key":"e_1_3_2_1_8_1","unstructured":"F. Cerutti M. Giacomin M. Vallati and T. Zanetti. 2017. ArgSemSAT-2017. http:\/\/argumentationcompetition.org\/2017\/ArgSemSAT.pdf. F. Cerutti M. Giacomin M. Vallati and T. Zanetti. 2017. ArgSemSAT-2017. http:\/\/argumentationcompetition.org\/2017\/ArgSemSAT.pdf."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 14th International Conference on Computer Aided Verification (CAV02)","volume":"2404","author":"Cimatti A.","unstructured":"A. Cimatti , E. M. Clarke , E. Giunchiglia , F. Giunchiglia , M. Pistore , M. Roveri , R. Sebastiani , and A. Tacchella . 2002. NuSMV2: An Open-Source Tool for Symbolic Model Checking . In Proceedings of the 14th International Conference on Computer Aided Verification (CAV02) (LNCS), Vol. 2404 . Springer-Verlag, 359--364. A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. 2002. NuSMV2: An Open-Source Tool for Symbolic Model Checking. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV02) (LNCS), Vol. 2404. Springer-Verlag, 359--364."},{"key":"e_1_3_2_1_10_1","unstructured":"E. M. Clarke O. Grumberg and D. A. Peled. 1999. Model Checking. The MIT Press Cambridge Massachusetts. E. M. Clarke O. Grumberg and D. A. Peled. 1999. Model Checking . The MIT Press Cambridge Massachusetts."},{"key":"e_1_3_2_1_11_1","volume-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial intelligence 77, 2","author":"Dung P. M.","year":"1995","unstructured":"P. M. Dung . 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial intelligence 77, 2 ( 1995 ), 321--357. P. M. Dung. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial intelligence 77, 2 (1995), 321--357."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"e_1_3_2_1_13_1","volume-title":"The computational complexity of ideal semantics. Artifi Intell. 173 (12","author":"Dunne P.","year":"2009","unstructured":"P. Dunne . 2009. The computational complexity of ideal semantics. Artifi Intell. 173 (12 2009 ), 1559--1591. P. Dunne. 2009. The computational complexity of ideal semantics. Artifi Intell. 173 (12 2009), 1559--1591."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"P. Dunne and M. Wooldridge. 2009. Complexity of Abstract Argumentation. In Argumentation in Artificial Intelligence. Springer US 85--104. P. Dunne and M. Wooldridge. 2009. Complexity of Abstract Argumentation. In Argumentation in Artificial Intelligence . Springer US 85--104.","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R. Fagin J. Y. Halpern Y. Moses and M. Y. Vardi. 1995. Reasoning about Knowledge. MIT Press Cambridge. R. Fagin J. Y. Halpern Y. Moses and M. Y. Vardi. 1995. Reasoning about Knowledge . MIT Press Cambridge.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems","volume":"1","author":"Grossi D.","year":"2010","unstructured":"D. Grossi . 2010 . On the Logic of Argumentation Theory . In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems : Volume 1 - Volume 1 (AAMAS '10). International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 409--416. D. Grossi. 2010. On the Logic of Argumentation Theory. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Volume 1 - Volume 1 (AAMAS '10). International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 409--416."},{"key":"e_1_3_2_1_18_1","unstructured":"VAS Group. 2015. MCMAS v1.2.2: User Manual. https:\/\/vas.doc.ic.ac.uk\/software\/mcmas\/manual.pdf. [Online. Accessed 19-11-2018]. VAS Group. 2015. MCMAS v1.2.2: User Manual. https:\/\/vas.doc.ic.ac.uk\/software\/mcmas\/manual.pdf. [Online. Accessed 19-11-2018]."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"R. Jha F. Belardinelli and F. Toni. 2019. Formal Verification of Debates in Argumentation Theory. arXiv:1912.05828 R. Jha F. Belardinelli and F. Toni. 2019. Formal Verification of Debates in Argumentation Theory. arXiv:1912.05828","DOI":"10.1145\/3341105.3373907"},{"key":"e_1_3_2_1_20_1","unstructured":"J. Lagniez E. Lonca and J. Mailly. 2017. CoQuiAAS v2.0: Taking Benefit from Constraint Programming to Solve Argumentation Problems. http:\/\/argumentationcompetition.org\/2017\/CoQuiAAS.pdf. [Online. Accessed 19-11-2018]. J. Lagniez E. Lonca and J. Mailly. 2017. CoQuiAAS v2.0: Taking Benefit from Constraint Programming to Solve Argumentation Problems. http:\/\/argumentationcompetition.org\/2017\/CoQuiAAS.pdf. [Online. Accessed 19-11-2018]."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-015-0378-x"},{"volume-title":"Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '06)","author":"Lomuscio A.","key":"e_1_3_2_1_22_1","unstructured":"A. Lomuscio and F. Raimondi . 2006. Model Checking Knowledge, Strategies, and Games in Multi-agent Systems . In Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '06) . ACM, New York, NY, USA, 161--168. A. Lomuscio and F. Raimondi. 2006. Model Checking Knowledge, Strategies, and Games in Multi-agent Systems. In Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '06). ACM, New York, NY, USA, 161--168."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S. Modgil and M. Caminada. 2009. Proof Theories and Algorithms for Abstract Argumentation Frameworks. Springer US Boston MA 105--129. S. Modgil and M. Caminada. 2009. Proof Theories and Algorithms for Abstract Argumentation Frameworks . Springer US Boston MA 105--129.","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631917"},{"key":"e_1_3_2_1_25_1","unstructured":"M. Thimm. 2018. International Competition on Computational Models of Argumentation (ICCMA). http:\/\/argumentationcompetition.org\/2017\/index.html. [Online. Accessed 10-04-2019]. M. Thimm. 2018. International Competition on Computational Models of Argumentation (ICCMA). http:\/\/argumentationcompetition.org\/2017\/index.html. [Online. Accessed 10-04-2019]."}],"event":{"name":"SAC '20: The 35th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Brno Czech Republic","acronym":"SAC '20"},"container-title":["Proceedings of the 35th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3373907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341105.3373907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:11Z","timestamp":1750204451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3373907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":25,"alternative-id":["10.1145\/3341105.3373907","10.1145\/3341105"],"URL":"https:\/\/doi.org\/10.1145\/3341105.3373907","relation":{},"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"2020-03-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}