{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:28:30Z","timestamp":1767637710778,"version":"3.48.0"},"reference-count":58,"publisher":"Maximum Academic Press","license":[{"start":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T00:00:00Z","timestamp":1555545600000},"content-version":"unspecified","delay-in-days":107,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2019]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we describe how predictive models can be positively exploited in abstract argumentation. In particular, we present two main sets of results. On one side, we show that predictive models are effective for performing algorithm selection in order to determine which approach is better to enumerate the preferred extensions of a given argumentation framework. On the other side, we show that predictive models predict significant aspects of the solution to the preferred extensions enumeration problem. By exploiting an extensive set of argumentation framework features\u2014that is, values that summarize a potentially important property of a framework\u2014the proposed approach is able to provide an accurate prediction about which algorithm would be faster on a given problem instance, as well as of the structure of the solution, where the complete knowledge of such structure would require a computationally hard problem to be solved. Improving the ability of existing argumentation-based systems to support human sense-making and decision processes is just one of the possible exploitations of such knowledge obtained in an inexpensive way.<\/jats:p>","DOI":"10.1017\/s0269888918000036","type":"journal-article","created":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:58:44Z","timestamp":1555563524000},"source":"Crossref","is-referenced-by-count":4,"title":["Predictive models and abstract argumentation: the case of high-complexity semantics"],"prefix":"10.48130","volume":"34","author":[{"given":"Mauro","family":"Vallati","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0755-0358","authenticated-orcid":false,"given":"Federico","family":"Cerutti","sequence":"additional","affiliation":[]},{"given":"Massimiliano","family":"Giacomin","sequence":"additional","affiliation":[]}],"member":"27968","published-online":{"date-parts":[[2019,4,18]]},"reference":[{"key":"S0269888918000036_ref58","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"S0269888918000036_ref53","unstructured":"Toniolo A. , Norman T. J. , Etuk A. , Cerutti F. , Ouyang R. W. , Srivastava M. , Oren N. , Dropps T. , Allen J. A. & Sullivan P. 2015. Agent support to reasoning with different types of evidence in intelligence analysis. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 781\u2013789. ACM."},{"key":"S0269888918000036_ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13800-3_29"},{"key":"S0269888918000036_ref48","doi-asserted-by":"crossref","unstructured":"Sideris A. & Dimopoulos Y. 2010. Constraint propagation in propositional planning. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS), 153\u2013160. AAAI Press.","DOI":"10.1609\/icaps.v20i1.13422"},{"key":"S0269888918000036_ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_41"},{"key":"S0269888918000036_ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213017500026"},{"key":"S0269888918000036_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"S0269888918000036_ref43","unstructured":"Matos P. , Planes J. , Letombe F. & Marques-Silva J. 2008. A MAX-SAT algorithm portfolio. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI), 911\u2013912. IOS Press."},{"key":"S0269888918000036_ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i1.2640"},{"key":"S0269888918000036_ref15","unstructured":"Cerutti F. , Giacomin M. & Vallati M. 2014a. Algorithm selection for preferred extensions enumeration. In Proceedings of the 5th International Conference on Computational Models of Argument (COMMA), 221\u2013232. IOS Press."},{"key":"S0269888918000036_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.10.002"},{"key":"S0269888918000036_ref11","unstructured":"Bistarelli S. , Rossi F. & Santini F. 2015b. Testing credulous and sceptical acceptance in smallworld networks. In Proceedings of the 22nd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA), 39\u201346."},{"key":"S0269888918000036_ref5","unstructured":"Baroni P. , Dunne P. E. & Giacomin M. 2010. On extension counting problems in argumentation frameworks. In Proceedings of the 3rd International Conference on Computational Models of Argument (COMMA), 216, 63\u201374. IOS Press."},{"key":"S0269888918000036_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54373-9_8"},{"key":"S0269888918000036_ref31","unstructured":"Gomes C. P. , Sabharwal A. & Selman B. 2009. Model counting. In Handbook of Satisfiability, Biere, A., Heule, M., van Maaren, H. & Walsh, T. (eds). 633\u2013654. IOS Press."},{"key":"S0269888918000036_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"S0269888918000036_ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538906"},{"key":"S0269888918000036_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.05.002"},{"key":"S0269888918000036_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.05.006"},{"key":"S0269888918000036_ref25","unstructured":"Dvor\u00e1k W. , J\u00e4rvisalo M. , Wallner J. P. & Woltran S. 2015. Cegartix v0. 4: A SAT-based counterexample guided argumentation reasoning tool. In System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA15), 12."},{"key":"S0269888918000036_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"S0269888918000036_ref27","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"I. Publicationes Mathematicae Debrecen"},{"key":"S0269888918000036_ref55","unstructured":"Vallati M. , Cerutti F. & Giacomin M. 2014. Argumentation frameworks features: an initial study. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI), 1117\u20131118. IOS Press."},{"key":"S0269888918000036_ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2015.02.012"},{"key":"S0269888918000036_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"S0269888918000036_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.03.006"},{"key":"S0269888918000036_ref13","unstructured":"Cabrio E. & Villata S. 2014. Node: A benchmark of natural language arguments. In Proceedings of the Fifth International Conference on Computational Models of Argument (COMMA), 449\u2013450. IOS Press."},{"key":"S0269888918000036_ref16","unstructured":"Cerutti F. , Giacomin M. & Vallati M. 2014b. Generating challenging benchmark AFs. In Proceedings of the 5th International Conference on Computational Models of Argument (COMMA), 457\u2013458. IOS Press."},{"key":"S0269888918000036_ref12","unstructured":"Brewer E. A. 1994. Portable High-Performance Supercomputing: High-Level Platform-Dependent OptiMization. PhD thesis, MIT."},{"key":"S0269888918000036_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S0269888918000036_ref6","first-page":"675","article-title":"On principle-based evaluation of extension-based argumentation semantics","volume":"171","author":"Baroni","year":"2007","journal-title":"Artificial Intelligence (Special issue on Argumentation in A.I.)"},{"key":"S0269888918000036_ref2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"S0269888918000036_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_15"},{"key":"S0269888918000036_ref9","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869765"},{"key":"S0269888918000036_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.03.005"},{"key":"S0269888918000036_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.07.006"},{"key":"S0269888918000036_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000210"},{"key":"S0269888918000036_ref44","doi-asserted-by":"publisher","DOI":"10.1037\/h0043158"},{"key":"S0269888918000036_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41524-1_7"},{"key":"S0269888918000036_ref56","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"S0269888918000036_ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"S0269888918000036_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59286-5_57"},{"key":"S0269888918000036_ref28","doi-asserted-by":"crossref","unstructured":"Fawcett C. , Vallati M. , Hutter F. , Hoffmann J. , Hoos H. & Leyton-Brown K. 2014. Improved features for runtime prediction of domain-independent planners. In Proceedings of the 24 th International Conference on Automated Planning and Scheduling (ICAPS), 355\u2013359. AAAI Press.","DOI":"10.1609\/icaps.v24i1.13680"},{"key":"S0269888918000036_ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.08.006"},{"key":"S0269888918000036_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_40"},{"key":"S0269888918000036_ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"S0269888918000036_ref33","unstructured":"Hall M. A. 1998. Correlation-Based Feature Subset Selection for Machine Learning. PhD thesis, University of Waikato, Department of Computer Science, Hamilton, New Zealand."},{"key":"S0269888918000036_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_23"},{"key":"S0269888918000036_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46695-9_1"},{"key":"S0269888918000036_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"S0269888918000036_ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.11.001"},{"key":"S0269888918000036_ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/159"},{"key":"S0269888918000036_ref57","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2014.1002535"},{"key":"S0269888918000036_ref41","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000094"},{"key":"S0269888918000036_ref40","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20368"},{"key":"S0269888918000036_ref42","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/00031305.1975.10479105","article-title":"Ridge regression in practice","volume":"29","author":"Marquardt","year":"1975","journal-title":"The American Statistician"},{"key":"S0269888918000036_ref10","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2015-1254"},{"key":"S0269888918000036_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30201-8_33"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888918000036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:15Z","timestamp":1767624135000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888918000036\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":58,"alternative-id":["S0269888918000036"],"URL":"https:\/\/doi.org\/10.1017\/s0269888918000036","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2019]]},"article-number":"e6"}}