{"id":"https://openalex.org/W7138461050","doi":"https://doi.org/10.1609/aaai.v40i23.39005","title":"Structure-Aware Encodings of Argumentation Properties for Clique-width","display_name":"Structure-Aware Encodings of Argumentation Properties for Clique-width","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138461050","doi":"https://doi.org/10.1609/aaai.v40i23.39005"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i23.39005","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.39005","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i23.39005","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129738100","display_name":"Yasir Mahmood","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yasir Mahmood","raw_affiliation_strings":["Data Science Group, Heinz Nixdorf Institute, Paderborn University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Science Group, Heinz Nixdorf Institute, Paderborn University, Germany","institution_ids":["https://openalex.org/I4210152224"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056989280","display_name":"Markus Hecher","orcid":"https://orcid.org/0000-0003-0131-6771"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Markus Hecher","raw_affiliation_strings":["CNRS, UMR 8188, Centre de Recherche en Informatique de Lens (CRIL), University of Artois, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, UMR 8188, Centre de Recherche en Informatique de Lens (CRIL), University of Artois, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210115519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120361863","display_name":"Johanna Groven","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johanna Groven","raw_affiliation_strings":["Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089442472","display_name":"Johannes K. Fichte","orcid":"https://orcid.org/0000-0002-8681-7470"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johannes K. Fichte","raw_affiliation_strings":["Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"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.18697349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"23","first_page":"19294","last_page":"19302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.2410999983549118,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.2410999983549118,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.13169999420642853,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.12349999696016312,"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/argumentation-theory","display_name":"Argumentation theory","score":0.6735000014305115},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5069000124931335},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4641000032424927},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.45910000801086426},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.3955000042915344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3528999984264374},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.32580000162124634},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3174999952316284}],"concepts":[{"id":"https://openalex.org/C65059942","wikidata":"https://www.wikidata.org/wiki/Q270105","display_name":"Argumentation theory","level":2,"score":0.6735000014305115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6521999835968018},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6281999945640564},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5069000124931335},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.45910000801086426},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3303000032901764},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29420000314712524},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27630001306533813},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C2779607372","wikidata":"https://www.wikidata.org/wiki/Q4789757","display_name":"Argumentation framework","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i23.39005","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.39005","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i23.39005","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i23.39005","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"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":{"Structural":[0],"measures":[1],"of":[2,33],"graphs,":[3],"such":[4],"as":[5],"treewidth,":[6],"are":[7,39,75],"central":[8],"tools":[9],"in":[10,14,44,145],"computational":[11,127],"complexity":[12],"resulting":[13,144],"efficient":[15],"algorithms":[16,74],"when":[17],"exploiting":[18],"the":[19,60,86,142,161],"parameter.":[20],"It":[21,108],"is":[22,59,80,99,109],"even":[23],"known":[24,81],"that":[25],"modern":[26],"SAT":[27],"solvers":[28,38],"work":[29],"efficiently":[30],"on":[31,111],"instances":[32],"small":[34,69],"treewidth.":[35],"Since":[36],"these":[37],"widely":[40],"applied,":[41],"research":[42],"interests":[43],"compact":[45],"encodings":[46],"into":[47],"(Q)SAT":[48],"for":[49,70,77,103,116,154],"solving":[50],"and":[51,114],"to":[52,88,125,136],"understand":[53,89],"encoding":[54,90],"limitations.":[55],"Even":[56],"more":[57],"general":[58],"graph":[61],"parameter":[62],"clique-width,":[63,78,143],"which":[64,98],"unlike":[65],"treewidth":[66],"can":[67],"be":[68,169],"dense":[71],"graphs.":[72],"Although":[73],"available":[76],"little":[79],"about":[82],"encodings.":[83],"We":[84,129,150],"initiate":[85],"quest":[87],"capabilities":[91],"with":[92,105],"clique-width":[93],"by":[94,164],"considering":[95],"abstract":[96],"argumentation,":[97],"a":[100,122],"robust":[101],"framework":[102],"reasoning":[104],"conflicting":[106],"arguments.":[107],"based":[110],"directed":[112,146],"graphs":[113],"asks":[115],"computationally":[117],"challenging":[118],"properties,":[119],"making":[120],"it":[121],"natural":[123],"candidate":[124],"study":[126],"properties.":[128],"design":[130],"novel":[131,152],"reductions":[132,139,167],"from":[133],"argumentation":[134,156],"problems":[135],"(Q)SAT.":[137],"Our":[138],"linearly":[140],"preserve":[141],"decomposition-guided":[147],"(DDG)":[148],"reductions.":[149],"establish":[151],"results":[153],"all":[155],"semantics,":[157],"including":[158],"counting.":[159],"Notably,":[160],"overhead":[162],"caused":[163],"our":[165],"DDG":[166],"cannot":[168],"significantly":[170],"improved":[171],"under":[172],"reasonable":[173],"assumptions.":[174]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-03-18T00:00:00"}