{"id":"https://openalex.org/W4393094455","doi":"https://doi.org/10.3233/aac-230012","title":"Tractable algorithms for strong admissibility","display_name":"Tractable algorithms for strong admissibility","publication_year":2024,"publication_date":"2024-03-22","ids":{"openalex":"https://openalex.org/W4393094455","doi":"https://doi.org/10.3233/aac-230012"},"language":"en","primary_location":{"id":"doi:10.3233/aac-230012","is_oa":true,"landing_page_url":"https://doi.org/10.3233/aac-230012","pdf_url":"https://content.iospress.com:443/download/argument-and-computation/aac230012?id=argument-and-computation%2Faac230012","source":{"id":"https://openalex.org/S16776775","display_name":"Argument & Computation","issn_l":"1946-2166","issn":["1946-2166","1946-2174"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Argument & Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://content.iospress.com:443/download/argument-and-computation/aac230012?id=argument-and-computation%2Faac230012","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009023649","display_name":"Martin Caminada","orcid":"https://orcid.org/0000-0002-7498-0238"},"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":true,"raw_author_name":"Martin Caminada","raw_affiliation_strings":["Cardiff University","Cardiff University, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cardiff University","institution_ids":["https://openalex.org/I79510175"]},{"raw_affiliation_string":"Cardiff University, United Kingdom","institution_ids":["https://openalex.org/I79510175"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019452776","display_name":"Sri Harikrishnan","orcid":"https://orcid.org/0009-0000-5073-7279"},"institutions":[{"id":"https://openalex.org/I102248843","display_name":"Vienna University of Economics and Business","ror":"https://ror.org/03yn8s215","country_code":"AT","type":"education","lineage":["https://openalex.org/I102248843"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sri Harikrishnan","raw_affiliation_strings":["Vienna University of Economics and Business","Vienna University of Economics and Business, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Economics and Business","institution_ids":["https://openalex.org/I102248843"]},{"raw_affiliation_string":"Vienna University of Economics and Business, Austria","institution_ids":["https://openalex.org/I102248843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009023649"],"corresponding_institution_ids":["https://openalex.org/I79510175"],"apc_list":{"value":900,"currency":"USD","value_usd":900},"apc_paid":{"value":900,"currency":"USD","value_usd":900},"fwci":0.6059,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71063212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"16","issue":"2","first_page":"212","last_page":"236"},"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.9990000128746033,"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.9990000128746033,"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.9983000159263611,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9884999990463257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5847422480583191},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5245816111564636}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5847422480583191},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5245816111564636}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/aac-230012","is_oa":true,"landing_page_url":"https://doi.org/10.3233/aac-230012","pdf_url":"https://content.iospress.com:443/download/argument-and-computation/aac230012?id=argument-and-computation%2Faac230012","source":{"id":"https://openalex.org/S16776775","display_name":"Argument & Computation","issn_l":"1946-2166","issn":["1946-2166","1946-2174"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Argument & Computation","raw_type":"journal-article"},{"id":"pmh:oai:research.wu.ac.at:openaire/1d7dd61e-205c-440d-ad43-93e51cd87a0a","is_oa":false,"landing_page_url":"https://research.wu.ac.at/de/publications/1d7dd61e-205c-440d-ad43-93e51cd87a0a","pdf_url":null,"source":{"id":"https://openalex.org/S7407055123","display_name":"WU Research","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Caminada, M & Harikrishnan, S 2024, 'Tractable Algorithms for Strong Admissibility', Argument and Computation. https://doi.org/10.3233/AAC-230012","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:https://orca.cardiff.ac.uk:167416","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.3233/aac-230012","is_oa":true,"landing_page_url":"https://doi.org/10.3233/aac-230012","pdf_url":"https://content.iospress.com:443/download/argument-and-computation/aac230012?id=argument-and-computation%2Faac230012","source":{"id":"https://openalex.org/S16776775","display_name":"Argument & Computation","issn_l":"1946-2166","issn":["1946-2166","1946-2174"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Argument & Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393094455.pdf","grobid_xml":"https://content.openalex.org/works/W4393094455.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W14006711","https://openalex.org/W2003822553","https://openalex.org/W2051478833","https://openalex.org/W2104126268","https://openalex.org/W2118090719","https://openalex.org/W2407152368","https://openalex.org/W2967761334","https://openalex.org/W2990673334"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"Much":[0],"like":[1],"admissibility":[2,11],"is":[3,12,26,55,152,193],"the":[4,13,32,51,62,69,102,106,124,147,161,191],"key":[5,14],"concept":[6,15],"underlying":[7,16],"preferred":[8],"semantics,":[9,18],"strong":[10],"grounded":[17,33,52,66,107],"as":[19,45,54,97],"membership":[20,30,49,104],"of":[21,31,48,50,61,105,149,155,160,185],"a":[22,89,173,196,204],"strongly":[23,37,81,120,169,200],"admissible":[24,38,82,121,170,201],"set":[25],"sufficient":[27],"to":[28,115,194],"show":[29],"extension.":[34,108],"As":[35,176],"such,":[36,177],"sets":[39],"and":[40],"labellings":[41,93],"can":[42,94,183],"be":[43,95,184],"used":[44,96],"an":[46,117,132,153,166],"explanation":[47],"extension,":[53],"for":[56,65,77,88,101,123,164,172],"instance":[57],"done":[58],"in":[59,188,203],"some":[60],"proof":[63],"procedures":[64],"semantics.":[67],"In":[68],"current":[70],"paper,":[71],"we":[72,178],"present":[73],"two":[74],"polynomial":[75],"algorithms":[76,111,182],"constructing":[78],"relatively":[79,98],"small":[80,99],"labellings,":[83],"with":[84],"associated":[85],"min\u2013max":[86],"numberings,":[87],"particular":[90,174],"argument.":[91,175],"These":[92],"explanations":[100],"argument\u2019s":[103],"Although":[109],"our":[110,135,181],"are":[112,142],"not":[113],"guaranteed":[114],"yield":[116],"absolute":[118,167],"minimal":[119,168,197],"labelling":[122,171,202],"argument":[125],"(as":[126],"doing":[127],"so":[128],"would":[129],"have":[130],"implied":[131],"exponential":[133],"complexity),":[134],"best":[136],"performing":[137],"algorithm":[138,151],"yields":[139],"results":[140],"that":[141,159,180],"only":[143],"marginally":[144],"larger.":[145],"Moreover,":[146],"runtime":[148],"this":[150],"order":[154],"magnitude":[156],"smaller":[157],"than":[158],"existing":[162],"approach":[163],"computing":[165],"believe":[179],"practical":[186],"value":[187],"situations":[189],"where":[190],"aim":[192],"construct":[195],"or":[198],"near-minimal":[199],"time-efficient":[205],"way.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2025-10-10T00:00:00"}