{"id":"https://openalex.org/W3034450786","doi":"https://doi.org/10.24963/ijcai.2020/239","title":"Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems","display_name":"Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3034450786","doi":"https://doi.org/10.24963/ijcai.2020/239","mag":"3034450786"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2020/239","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/239","pdf_url":"https://www.ijcai.org/proceedings/2020/0239.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2020/0239.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hubie Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hubie Chen","raw_affiliation_strings":["Birkbeck, University of London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Birkbeck, University of London","institution_ids":["https://openalex.org/I98259816"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Georg Gottlob","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["AT","GB"],"is_corresponding":false,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Oxford University, TU Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oxford University, TU Wien","institution_ids":["https://openalex.org/I145847075","https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Matthias Lanzinger","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Matthias Lanzinger","raw_affiliation_strings":["TU Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":null,"display_name":"Reinhard Pichler","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Reinhard Pichler","raw_affiliation_strings":["TU Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1726","last_page":"1733"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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.9994000196456909,"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.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9972000122070312,"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/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.7717999815940857},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7700999975204468},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6044999957084656},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5934000015258789},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.482699990272522},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.4722000062465668},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4715999960899353},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.41100001335144043},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.40799999237060547},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.396699994802475}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.7717999815940857},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7700999975204468},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6044999957084656},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5934000015258789},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.482699990272522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4763999879360199},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47369998693466187},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4722000062465668},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4715999960899353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.461899995803833},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.41100001335144043},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.40799999237060547},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.396699994802475},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.37689998745918274},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.3483999967575073},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34150001406669617},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33889999985694885},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.30880001187324524},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.3010999858379364},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2987000048160553},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.29789999127388},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.2973000109195709},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2822999954223633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26570001244544983},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.2615000009536743}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2020/239","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/239","pdf_url":"https://www.ijcai.org/proceedings/2020/0239.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2007.14169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2007.14169","pdf_url":"https://arxiv.org/pdf/2007.14169","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2020/239","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/239","pdf_url":"https://www.ijcai.org/proceedings/2020/0239.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3867201627","display_name":"HyperTrac:hypergraph Decompositions and Tractability","funder_award_id":"P30930","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G5783554875","display_name":null,"funder_award_id":"RP\\R1\\201074","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3034450786.pdf","grobid_xml":"https://content.openalex.org/works/W3034450786.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Constraint":[0],"satisfaction":[1],"problems":[2,77],"(CSPs)":[3],"are":[4],"an":[5],"important":[6],"formal":[7],"framework":[8,66],"for":[9,50,131,154],"the":[10,52,61,64,73,88,107],"uniform":[11],"treatment":[12],"of":[13,45,48,63,76,90,92,109,112,138],"various":[14],"prominent":[15],"AI":[16,158],"tasks,":[17],"e.g.,":[18],"coloring":[19],"or":[20],"scheduling":[21],"problems.":[22],"Solving":[23],"CSPs":[24,49],"is,":[25],"in":[26,98,157],"general,":[27],"known":[28],"to":[29,71,87],"be":[30],"NP-complete":[31],"and":[32,149,159],"fixed-parameter":[33,55,74],"intractable":[34],"when":[35],"parameterized":[36],"by":[37,67],"their":[38,79],"constraint":[39],"scopes.":[40],"We":[41,82],"give":[42],"a":[43,95,135,145],"characterization":[44,58,86],"those":[46],"classes":[47,132],"which":[51],"problem":[53,97,148],"becomes":[54],"tractable.":[56],"Our":[57],"significantly":[59],"increases":[60],"utility":[62],"CSP":[65,80],"making":[68],"it":[69],"possible":[70],"decide":[72],"tractability":[75],"via":[78],"formulations.":[81],"further":[83],"extend":[84],"our":[85],"evaluation":[89],"unions":[91],"conjunctive":[93],"queries,":[94],"fundamental":[96],"databases.":[99],"Furthermore,":[100],"we":[101,116],"provide":[102],"some":[103],"new":[104,152],"insight":[105],"on":[106],"frontier":[108],"PTIME":[110],"solvability":[111],"CSPs.":[113],"In":[114],"particular,":[115],"observe":[117],"that":[118,133],"bounded":[119,127],"fractional":[120],"hypertree":[121,128],"width":[122,129],"is":[123],"more":[124],"general":[125],"than":[126],"only":[130],"exhibit":[134],"certain":[136],"type":[137],"exponential":[139],"growth.":[140],"The":[141],"presented":[142],"work":[143],"resolves":[144],"long-standing":[146],"open":[147],"yields":[150],"powerful":[151],"tools":[153],"complexity":[155],"research":[156],"database":[160],"theory.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2020-06-19T00:00:00"}