{"id":"https://openalex.org/W68548145","doi":"https://doi.org/10.3233/978-1-61499-436-7-221","title":"Algorithm Selection for Preferred Extensions Enumeration","display_name":"Algorithm Selection for Preferred Extensions Enumeration","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W68548145","doi":"https://doi.org/10.3233/978-1-61499-436-7-221","mag":"68548145"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-436-7-221","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-436-7-221","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043937484","display_name":"Federico Cerutti","orcid":"https://orcid.org/0000-0003-0755-0358"},"institutions":[{"id":"https://openalex.org/I4210162667","display_name":"University of Wales Institute Cardiff","ror":"https://ror.org/03evaaw16","country_code":"SG","type":"education","lineage":["https://openalex.org/I4210162667"]},{"id":"https://openalex.org/I195460627","display_name":"University of Aberdeen","ror":"https://ror.org/016476m91","country_code":"GB","type":"education","lineage":["https://openalex.org/I195460627"]}],"countries":["GB","SG"],"is_corresponding":true,"raw_author_name":"Cerutti Federico","raw_affiliation_strings":["University of Aberdeen","University of Cardiff"],"affiliations":[{"raw_affiliation_string":"University of Aberdeen","institution_ids":["https://openalex.org/I195460627"]},{"raw_affiliation_string":"University of Cardiff","institution_ids":["https://openalex.org/I4210162667"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058816445","display_name":"Massimiliano Giacomin","orcid":"https://orcid.org/0000-0003-4771-4265"},"institutions":[{"id":"https://openalex.org/I30667456","display_name":"Brescia University","ror":"https://ror.org/015ahgd08","country_code":"US","type":"education","lineage":["https://openalex.org/I30667456"]},{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"Giacomin Massimiliano","raw_affiliation_strings":["University of Brescia"],"affiliations":[{"raw_affiliation_string":"University of Brescia","institution_ids":["https://openalex.org/I30667456","https://openalex.org/I79940851"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086585008","display_name":"Mauro Vallati","orcid":"https://orcid.org/0000-0002-8429-3570"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vallati Mauro","raw_affiliation_strings":["Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043937484"],"corresponding_institution_ids":["https://openalex.org/I195460627","https://openalex.org/I4210162667"],"apc_list":null,"apc_paid":null,"fwci":2.7698,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90342925,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.9677245616912842},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.7632368803024292},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5028271079063416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4117230772972107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27879437804222107},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1721627414226532}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.9677245616912842},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.7632368803024292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5028271079063416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4117230772972107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27879437804222107},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1721627414226532}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/978-1-61499-436-7-221","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-436-7-221","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/80b8616f-5446-4723-95d6-c0fc382193ac","is_oa":false,"landing_page_url":"https://pure.hud.ac.uk/en/publications/80b8616f-5446-4723-95d6-c0fc382193ac","pdf_url":null,"source":{"id":"https://openalex.org/S4306402508","display_name":"Huddersfield Research Portal (University of Huddersfield)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I133837150","host_organization_name":"University of Huddersfield","host_organization_lineage":["https://openalex.org/I133837150"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Giacomin, M, Cerutti, F & Vallati, M 2014, Algorithm selection for preferred extensions enumeration. in Computational Models of Argument : Proceedings of COMMA 2014. vol. 266, Frontiers in Artificial Intelligence and Applications, vol. 266, IOS Press, pp. 221-232. https://doi.org/10.3233/978-1-61499-436-7-221","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:iris.unibs.it:11379/484873","is_oa":false,"landing_page_url":"http://hdl.handle.net/11379/484873","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W49698117","https://openalex.org/W141187516","https://openalex.org/W153532561","https://openalex.org/W171356959","https://openalex.org/W1494461081","https://openalex.org/W1500443963","https://openalex.org/W1546325545","https://openalex.org/W1580831651","https://openalex.org/W1677519333","https://openalex.org/W1915652795","https://openalex.org/W1975303601","https://openalex.org/W2037744354","https://openalex.org/W2086886584","https://openalex.org/W2091587574","https://openalex.org/W2104126268","https://openalex.org/W2112029595","https://openalex.org/W2118090719","https://openalex.org/W2133990480","https://openalex.org/W2147148915","https://openalex.org/W2167497429","https://openalex.org/W2964281761","https://openalex.org/W3103913776"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W108845024","https://openalex.org/W2406961474","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2952598754","https://openalex.org/W3042106073","https://openalex.org/W2143566611"],"abstract_inverted_index":{"Enumerating":[0],"semantics":[1,13],"extensions":[2,51],"in":[3,114],"abstract":[4],"argumentation":[5,87],"is":[6,31,75],"generally":[7],"an":[8,76,90,102],"intractable":[9],"problem.":[10],"For":[11],"preferred":[12,50],"four":[14],"algorithms":[15,71],"have":[16],"been":[17],"recently":[18],"proposed,":[19],"AspartixM,":[20],"NAD-Alg,":[21],"PrefSAT":[22],"and":[23,40,70,133],"SCC-P,":[24],"with":[25,89],"significant":[26],"runtime":[27],"variations.":[28],"This":[29],"work":[30],"a":[32],"first":[33],"comprehensive":[34],"exploration":[35],"of":[36,41,48,57,95,118,121,139,141],"the":[37,45,81,93,96,111,116,119,124,129,137,142],"graph":[38],"features":[39,69],"their":[42],"impact":[43],"on":[44,92,107],"execution":[46],"time":[47],"state-of-the-art":[49],"enumeration":[52],"algorithms.":[53],"Following":[54],"other":[55,130],"areas":[56],"AI,":[58],"we":[59,99],"exploit":[60],"empirical":[61],"performance":[62],"models,":[63],"predictive":[64],"models":[65],"that":[66,101],"relate":[67],"instance":[68],"performance.":[72],"The":[73],"result":[74],"approach":[77,105],"able":[78],"to":[79],"select":[80,110],"“best”":[82],"algorithm":[83,103,113,127,146],"for":[84],"any":[85],"Dung's":[86],"framework":[88],"accuracy,":[91],"average,":[94],"80%.":[97],"Moreover,":[98],"show":[100],"selection":[104],"based":[106],"classification":[108],"can":[109],"fastest":[112],"about":[115,134],"double":[117],"number":[120,138],"cases":[122,140],"where":[123],"most":[125,144],"efficient":[126,145],"outperforms":[128],"ones":[131],"(SCC-P),":[132],"three":[135],"times":[136],"second":[143],"(PrefSAT).":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}