{"id":"https://openalex.org/W4415428551","doi":"https://doi.org/10.3233/faia251010","title":"Complexity in Finitary Argumentation","display_name":"Complexity in Finitary Argumentation","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428551","doi":"https://doi.org/10.3233/faia251010"},"language":null,"primary_location":{"id":"doi:10.3233/faia251010","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251010","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/faia251010","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022967955","display_name":"Uri Andrews","orcid":"https://orcid.org/0000-0002-4653-7458"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uri Andrews","raw_affiliation_strings":["University of Wisconsin\u2013Madison"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin\u2013Madison","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011087960","display_name":"Luca San Mauro","orcid":"https://orcid.org/0000-0002-3156-6870"},"institutions":[{"id":"https://openalex.org/I5561750","display_name":"University of Bari Aldo Moro","ror":"https://ror.org/027ynra39","country_code":"IT","type":"education","lineage":["https://openalex.org/I5561750"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca San Mauro","raw_affiliation_strings":["University of Bari"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bari","institution_ids":["https://openalex.org/I5561750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65065386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T11810","display_name":"Complex Systems and Decision Making","score":0.71670001745224,"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"}},"topics":[{"id":"https://openalex.org/T11810","display_name":"Complex Systems and Decision Making","score":0.71670001745224,"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/finitary","display_name":"Finitary","score":0.9807999730110168},{"id":"https://openalex.org/keywords/argumentation-theory","display_name":"Argumentation theory","score":0.5310999751091003},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4699000120162964},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.44350001215934753},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4392000138759613},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.9807999730110168},{"id":"https://openalex.org/C65059942","wikidata":"https://www.wikidata.org/wiki/Q270105","display_name":"Argumentation theory","level":2,"score":0.5310999751091003},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5248000025749207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5090000033378601},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4699000120162964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.461899995803833},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3456000089645386},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2791999876499176},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2750999927520752},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.27390000224113464},{"id":"https://openalex.org/C2779607372","wikidata":"https://www.wikidata.org/wiki/Q4789757","display_name":"Argumentation framework","level":3,"score":0.26660001277923584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia251010","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251010","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"}],"best_oa_location":{"id":"doi:10.3233/faia251010","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251010","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"argumentation":[1],"frameworks":[2],"(AFs)":[3],"provide":[4,134],"a":[5,26,82,100,111,117,135],"formal":[6],"setting":[7,137],"to":[8,59,150,153,168],"analyze":[9],"many":[10,31,48,77,126,154],"forms":[11,127],"of":[12,20,33,39,55,93,128,146],"reasoning":[13,34,139,155],"with":[14],"conflicting":[15],"information.":[16],"While":[17],"the":[18,36,53,91,106,130,143,163,166],"expressiveness":[19],"general":[21],"infinite":[22,41,60,67,132],"AFs":[23,42,68,133],"make":[24],"them":[25],"tempting":[27],"tool":[28],"for":[29,105,125,138,162],"modeling":[30],"kinds":[32],"scenarios,":[35],"computational":[37,56],"intractability":[38],"solving":[40],"limit":[43],"their":[44],"use,":[45],"even":[46],"in":[47,102,120],"theoretical":[49],"applications.":[50],"We":[51,122],"investigate":[52],"complexity":[54],"problems":[57],"related":[58],"but":[61],"finitary":[62,95,131],"argumentations":[63],"frameworks,":[64],"that":[65,90,124],"is,":[66],"where":[69],"each":[70],"argument":[71],"is":[72],"attacked":[73],"by":[74],"only":[75],"finitely":[76],"others.":[78],"Our":[79],"results":[80],"reveal":[81],"surprising":[83],"scenario.":[84],"On":[85],"one":[86],"hand,":[87],"we":[88,109],"see":[89],"assumption":[92],"being":[94,147,158],"does":[96],"not":[97],"automatically":[98],"guarantee":[99],"drop":[101],"complexity.":[103,121],"However,":[104],"admissibility-based":[107],"semantics,":[108],"find":[110],"remarkable":[112],"combinatorial":[113],"constraint":[114],"which":[115,140],"entails":[116],"dramatic":[118],"decrease":[119],"conclude":[123],"reasoning,":[129],"natural":[136],"balances":[141],"well":[142],"competing":[144],"goals":[145],"expressive":[148],"enough":[149,161],"be":[151,169],"applied":[152],"settings":[156],"while":[157],"computationally":[159],"tractable":[160],"analysis":[164],"within":[165],"framework":[167],"useful.":[170]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-24T00:00:00"}