{"id":"https://openalex.org/W2516814890","doi":"https://doi.org/10.3233/978-1-61499-672-9-966","title":"Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation","display_name":"Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2516814890","doi":"https://doi.org/10.3233/978-1-61499-672-9-966","mag":"2516814890"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-672-9-966","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-672-9-966","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/978-1-61499-672-9-966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017101409","display_name":"Wolfgang Faber","orcid":"https://orcid.org/0000-0002-0330-5868"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Faber Wolfgang","raw_affiliation_strings":["Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science","institution_ids":[]}]},{"author_position":"middle","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":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043937484","display_name":"Federico Cerutti","orcid":"https://orcid.org/0000-0003-0755-0358"},"institutions":[{"id":"https://openalex.org/I79510175","display_name":"Cardiff University","ror":"https://ror.org/03kk7td41","country_code":"GB","type":"education","lineage":["https://openalex.org/I79510175"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cerutti Federico","raw_affiliation_strings":["University of Cardiff#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Cardiff#TAB#","institution_ids":["https://openalex.org/I79510175"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058816445","display_name":"Massimiliano Giacomin","orcid":"https://orcid.org/0000-0003-4771-4265"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giacomin Massimiliano","raw_affiliation_strings":["* University of Brescia"],"affiliations":[{"raw_affiliation_string":"* University of Brescia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017101409"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3543,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81593941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"285","issue":null,"first_page":"966","last_page":"973"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9998000264167786,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11182","display_name":"Auction Theory and Applications","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/argumentation-theory","display_name":"Argumentation theory","score":0.8737119436264038},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7171422839164734},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5902471542358398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5391083359718323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.486825168132782},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4501384496688843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32638782262802124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3147503137588501},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.22687146067619324},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12943634390830994},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10358607769012451},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.09674733877182007}],"concepts":[{"id":"https://openalex.org/C65059942","wikidata":"https://www.wikidata.org/wiki/Q270105","display_name":"Argumentation theory","level":2,"score":0.8737119436264038},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7171422839164734},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5902471542358398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5391083359718323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.486825168132782},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4501384496688843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32638782262802124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3147503137588501},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.22687146067619324},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12943634390830994},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10358607769012451},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.09674733877182007}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3233/978-1-61499-672-9-966","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-672-9-966","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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:openaire/94402938-4708-4a1c-bafb-6a9e302ed8c4","is_oa":true,"landing_page_url":"https://pure.hud.ac.uk/en/publications/94402938-4708-4a1c-bafb-6a9e302ed8c4","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Faber, W, Vallati, M, Cerutti, F & Giacomin, M 2016, Solving set Optimization problems by cardinality Optimization with an application to argumentation. in Frontiers in Artificial Intelligence and Applications. vol. 285, Frontiers in Artificial Intelligence and Applications, vol. 285, IOS Press, pp. 966-973, 22nd European Conference on Artificial Intelligence, The Hague, Netherlands, 29/08/16. https://doi.org/10.3233/978-1-61499-672-9-966","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.hud.ac.uk:29318","is_oa":true,"landing_page_url":null,"pdf_url":"http://eprints.hud.ac.uk/id/eprint/29318/1/ecai2016-final.pdf","source":{"id":"https://openalex.org/S4306401852","display_name":"University of Huddersfield Repository (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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Chapter"},{"id":"pmh:oai:iris.unibs.it:11379/484846","is_oa":false,"landing_page_url":"http://hdl.handle.net/11379/484846","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"},{"id":"mag:2516814890","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/ecai/ecai2016.html#FaberVCG16","pdf_url":null,"source":{"id":"https://openalex.org/S4306418308","display_name":"European Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":{"id":"doi:10.3233/978-1-61499-672-9-966","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-672-9-966","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W111132822","https://openalex.org/W1493657719","https://openalex.org/W1511963917","https://openalex.org/W1580831651","https://openalex.org/W1894498325","https://openalex.org/W1970198086","https://openalex.org/W1975303601","https://openalex.org/W2020169768","https://openalex.org/W2037744354","https://openalex.org/W2037950528","https://openalex.org/W2039887949","https://openalex.org/W2081641685","https://openalex.org/W2085401920","https://openalex.org/W2085925139","https://openalex.org/W2104126268","https://openalex.org/W2112598286","https://openalex.org/W2155378065","https://openalex.org/W2215868778","https://openalex.org/W2230145219","https://openalex.org/W2395906507","https://openalex.org/W2401337862","https://openalex.org/W2407856297","https://openalex.org/W2945259913","https://openalex.org/W4249183207"],"related_works":["https://openalex.org/W4256185029","https://openalex.org/W2141332034","https://openalex.org/W4388437769","https://openalex.org/W2762454042","https://openalex.org/W2064153856","https://openalex.org/W2337488240","https://openalex.org/W52290235","https://openalex.org/W3007362904","https://openalex.org/W2947386998","https://openalex.org/W2922502643"],"abstract_inverted_index":{"Optimization—minimization":[0],"or":[1,26,101],"maximization—in":[2],"the":[3,33,57,74,82,120,125,153,163],"lattice":[4],"of":[5,24,62,127,147,155,158],"subsets":[6],"is":[7,39,71,113,166],"a":[8,115,151],"frequent":[9],"operation":[10],"in":[11,29,104],"Artificial":[12],"Intelligence":[13],"tasks.":[14],"Examples":[15],"are":[16],"subset-minimal":[17],"model-based":[18],"diagnosis,":[19],"nonmonotonic":[20],"reasoning":[21],"by":[22,60,143],"means":[23,61],"circumscription,":[25],"preferred":[27,156],"extensions":[28,157],"abstract":[30,159],"argumentation.":[31],"Finding":[32],"optimum":[34],"among":[35],"many":[36,85],"admissible":[37,44],"solutions":[38,45,139],"often":[40],"harder":[41],"than":[42],"finding":[43,67,93],"with":[46],"respect":[47],"to":[48],"both":[49],"computational":[50],"complexity":[51],"and":[52,78,81,118,133],"methodology.":[53],"This":[54],"paper":[55],"addresses":[56],"former":[58],"issue":[59],"an":[63,144],"effective":[64],"method":[65,165],"for":[66,92,96,124],"subset-optimal":[68,79,116,138],"solutions.":[69,149],"It":[70],"based":[72],"on":[73],"relationship":[75],"between":[76],"cardinality-optimal":[77,94,111,148],"solutions,":[80,95],"fact":[83],"that":[84],"logic-based":[86],"declarative":[87],"programming":[88],"systems":[89],"provide":[90],"constructs":[91,130],"example":[97],"maximum":[98],"satisfiability":[99],"(MaxSAT)":[100],"weak":[102],"constraints":[103],"Answer":[105],"Set":[106],"Programming":[107],"(ASP).":[108],"Clearly":[109],"each":[110],"solution":[112],"also":[114,122],"one,":[117],"if":[119],"language":[121],"allows":[123],"addition":[126],"particular":[128],"restricting":[129],"(both":[131],"MaxSAT":[132],"ASP":[134],"do)":[135],"then":[136],"all":[137],"can":[140],"be":[141],"found":[142],"iterative":[145],"computation":[146,154],"As":[150],"showcase,":[152],"argumentation":[160],"frameworks":[161],"using":[162],"proposed":[164],"studied.":[167]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}