{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T17:10:04Z","timestamp":1750525804751,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319630038"},{"type":"electronic","value":"9783319630045"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63004-5_25","type":"book-chapter","created":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T01:34:07Z","timestamp":1499477647000},"page":"315-327","source":"Crossref","is-referenced-by-count":1,"title":["On the Combination of Argumentation Solvers into Parallel Portfolios"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Vallati","sequence":"first","affiliation":[]},{"given":"Federico","family":"Cerutti","sequence":"additional","affiliation":[]},{"given":"Massimiliano","family":"Giacomin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,9]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24318-4_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Balyo","year":"2015","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 156\u2013172. Springer, Cham (2015). doi: 10.1007\/978-3-319-24318-4_12"},{"issue":"5439","key":"25_CR2","doi-asserted-by":"crossref","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":"25_CR3","doi-asserted-by":"crossref","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."},{"issue":"1\u20132","key":"25_CR4","first-page":"165","volume":"168","author":"P Baroni","year":"2005","unstructured":"Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1\u20132), 165\u2013210 (2005)","journal-title":"Artif. Intell."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Rossi, F., Santini, F.: Benchmarking hard problems in random abstract AFs: the stable semantics. In: COMMA 2014, pp. 153\u2013160 (2014)","DOI":"10.3233\/978-1-61499-436-7-153"},{"key":"25_CR6","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: Algorithm selection for preferred extensions enumeration. In: Proceedings of COMMA, pp. 221\u2013232 (2014)"},{"key":"25_CR7","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: Generating structured argumentation frameworks: AFBenchGen2. In: Proceedings of COMMA, pp. 467\u2013468 (2016)"},{"key":"25_CR8","unstructured":"Cerutti, F., Oren, N., Strass, H., Thimm, M., Vallati, M.: A benchmark framework for a computational argumentation competition. In: Proceedings of COMMA, pp. 459\u2013460 (2014)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Cerutti, F., Tachmazidis, I., Vallati, M., Batsakis, S., Giacomin, M., Antoniou, G.: Exploiting parallelism for hard problems in abstract argumentation. In: Proceedings of AAAI, pp. 1475\u20131481 (2015)","DOI":"10.1609\/aaai.v29i1.9395"},{"key":"25_CR10","unstructured":"Cerutti, F., Vallati, M., Giacomin, M.: Where are we now? State of the art and future trends of solvers for hard argumentation problems. In: Proceedings of COMMA, pp. 207\u2013218 (2016)"},{"issue":"2","key":"25_CR11","doi-asserted-by":"crossref","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":"25_CR12","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, Heidelberg (2009). doi: 10.1007\/978-0-387-98197-0_5"},{"key":"25_CR13","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. Debr. 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debr."},{"issue":"1","key":"25_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explor. 11(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor."},{"key":"25_CR15","unstructured":"Helmert, M., R\u00f6ger, G., Karpas, E.: Fast downward stone soup: a baseline for building planner portfolios. In: Proceedings of the ICAPS 2011 Workshop of AI Planning and Learning (PAL) (2011)"},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-19084-6_1","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H., Hutter, F.: From sequential algorithm selection to parallel portfolio selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 1\u201316. Springer, Cham (2015). doi: 10.1007\/978-3-319-19084-6_1"},{"issue":"1","key":"25_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0004-3702(01)00113-8","volume":"131","author":"G Sutcliffe","year":"2001","unstructured":"Sutcliffe, G., Suttner, C.: Evaluating general purpose automated theorem proving systems. Artif. Intell. 131(1), 39\u201354 (2001)","journal-title":"Artif. Intell."},{"key":"25_CR19","unstructured":"Thimm, M., Villata, S.: System descriptions of the first international competition on computational models of argumentation (ICCMA 2015). arXiv preprint (2015). arXiv:1510.05373"},{"issue":"1","key":"25_CR20","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1609\/aimag.v37i1.2640","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\u2013104 (2016)","journal-title":"AI Mag."},{"key":"25_CR21","unstructured":"Toniolo, A., Norman, T.J., Etuk, A., Cerutti, F., Ouyang, R.W., Srivastava, M., Oren, N., Dropps, T., Allen, J.A., Sullivan, P.: Agent support to reasoning with different types of evidence in intelligence analysis. In: Proceedings of AAMAS, pp. 781\u2013789 (2015)"},{"issue":"3","key":"25_CR22","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1609\/aimag.v36i3.2571","volume":"36","author":"M Vallati","year":"2015","unstructured":"Vallati, M., Chrpa, L., Grzes, M., McCluskey, T., Roberts, M., Sanner, S.: The 2014 international planning competition: progress and trends. AI Mag. 36(3), 90\u201398 (2015)","journal-title":"AI Mag."},{"issue":"6684","key":"25_CR23","doi-asserted-by":"crossref","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"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31612-8_18"}],"container-title":["Lecture Notes in Computer Science","AI 2017: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63004-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T16:31:54Z","timestamp":1750523514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63004-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319630038","9783319630045"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63004-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}