{"id":"https://openalex.org/W2122061707","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-095","title":"Constraint satisfaction problems: convexity makes all different constraints tractable","display_name":"Constraint satisfaction problems: convexity makes all different constraints tractable","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W2122061707","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-095","mag":"2122061707"},"language":"en","primary_location":{"id":"pmh:oai:edoc.mpg.de:618702","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618702","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Walsh, Toby: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI Press, 522-527 (2011)","raw_type":"Conference-Paper"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I29894533","display_name":"Charles Darwin University","ror":"https://ror.org/048zcaj52","country_code":"AU","type":"education","lineage":["https://openalex.org/I29894533"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Charles Darwin University Darwin, Northern Territory, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6148-9212","affiliations":[{"raw_affiliation_string":"Charles Darwin University Darwin, Northern Territory, Australia","institution_ids":["https://openalex.org/I29894533"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-0076-6308","affiliations":[{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052950579","display_name":"Danny Hermelin","orcid":"https://orcid.org/0000-0002-6379-0383"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Danny Hermelin","raw_affiliation_strings":["Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-6379-0383","affiliations":[{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034897040","display_name":"Nina Narodytska","orcid":"https://orcid.org/0000-0002-5181-4560"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Nina Narodytska","raw_affiliation_strings":["NICTA & University of New South Wales, Sydney, Australia#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5181-4560","affiliations":[{"raw_affiliation_string":"NICTA & University of New South Wales, Sydney, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047322831","display_name":"Frances Rosamond","orcid":"https://orcid.org/0000-0002-5097-9929"},"institutions":[{"id":"https://openalex.org/I29894533","display_name":"Charles Darwin University","ror":"https://ror.org/048zcaj52","country_code":"AU","type":"education","lineage":["https://openalex.org/I29894533"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frances Rosamond","raw_affiliation_strings":["Charles Darwin University Darwin, Northern Territory, Australia"],"raw_orcid":"https://orcid.org/0000-0002-5097-9929","affiliations":[{"raw_affiliation_string":"Charles Darwin University Darwin, Northern Territory, Australia","institution_ids":["https://openalex.org/I29894533"]}]}],"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":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"522","last_page":"527"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8109422922134399},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.8004366159439087},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7000073790550232},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6620299816131592},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5862010717391968},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.515449583530426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49793004989624023},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4923170804977417},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4678412675857544},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4395584464073181},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4309133291244507},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.42990660667419434},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42434442043304443},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.42098313570022583},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4199833869934082},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.41610807180404663},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41368788480758667},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4103761911392212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4048033654689789},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30142533779144287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20632579922676086},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09744247794151306}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8109422922134399},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.8004366159439087},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7000073790550232},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6620299816131592},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5862010717391968},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.515449583530426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49793004989624023},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4923170804977417},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4678412675857544},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4395584464073181},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4309133291244507},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.42990660667419434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42434442043304443},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.42098313570022583},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4199833869934082},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.41610807180404663},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41368788480758667},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4103761911392212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4048033654689789},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30142533779144287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20632579922676086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09744247794151306},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:edoc.mpg.de:618702","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618702","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Walsh, Toby: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI Press, 522-527 (2011)","raw_type":"Conference-Paper"},{"id":"mag:2122061707","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1562369","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint 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":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W21150094","https://openalex.org/W36639738","https://openalex.org/W60640206","https://openalex.org/W1516792588","https://openalex.org/W1517036688","https://openalex.org/W1531507576","https://openalex.org/W1593490483","https://openalex.org/W1889000715","https://openalex.org/W1983648207","https://openalex.org/W1999038767","https://openalex.org/W2002597376","https://openalex.org/W2011039300","https://openalex.org/W2013166886","https://openalex.org/W2019992365","https://openalex.org/W2021183451","https://openalex.org/W2024491681","https://openalex.org/W2035811095","https://openalex.org/W2080192364","https://openalex.org/W2083203323","https://openalex.org/W2107284348","https://openalex.org/W2116407296","https://openalex.org/W2129023820","https://openalex.org/W2130618484","https://openalex.org/W2143474538","https://openalex.org/W2143937162","https://openalex.org/W2159738186","https://openalex.org/W2164279585","https://openalex.org/W2166566648","https://openalex.org/W2167464392","https://openalex.org/W2798588639","https://openalex.org/W2899328677","https://openalex.org/W2913688336","https://openalex.org/W2951209107","https://openalex.org/W2963402450","https://openalex.org/W3140964092"],"related_works":["https://openalex.org/W2042436180","https://openalex.org/W2164279585","https://openalex.org/W36639738","https://openalex.org/W99828349","https://openalex.org/W2913688336","https://openalex.org/W2083203323","https://openalex.org/W2074359677","https://openalex.org/W2034674470","https://openalex.org/W2011039300","https://openalex.org/W1995725694","https://openalex.org/W2116407296","https://openalex.org/W3101089670","https://openalex.org/W2949599905","https://openalex.org/W1559548620","https://openalex.org/W1568528320","https://openalex.org/W2949582969","https://openalex.org/W2141550069","https://openalex.org/W3101984934","https://openalex.org/W1549495856","https://openalex.org/W3195998858"],"abstract_inverted_index":{"We":[0,53,101],"examine":[1],"the":[2,62,65,78,98,106,111],"complexity":[3,79],"of":[4,10,13,23,64,77,80,87,97],"constraint":[5,99],"satisfaction":[6],"problems":[7],"that":[8,55],"consist":[9],"a":[11,20,56,85],"set":[12,86],"AllDiff":[14,82],"constraints.":[15,69],"Such":[16],"CSPs":[17,83],"naturally":[18],"model":[19],"wide":[21],"range":[22],"real-world":[24],"and":[25,32,68,94],"combinatorial":[26],"problems,":[27],"like":[28,90],"scheduling,":[29],"frequency":[30],"allocations":[31],"graph":[33],"coloring":[34],"problems.":[35],"As":[36],"this":[37],"problem":[38,112],"is":[39,73,116],"known":[40],"to":[41,60],"be":[42,61],"NP-complete,":[43],"we":[44],"investigate":[45],"under":[46],"which":[47],"further":[48],"assumptions":[49],"it":[50,115],"becomes":[51],"tractable.":[52],"observe":[54],"crucial":[57],"property":[58],"seems":[59],"convexity":[63,108],"variable":[66],"domains":[67],"Our":[70],"main":[71],"contribution":[72],"an":[74],"extensive":[75],"study":[76],"Multiple":[81],"for":[84],"natural":[88],"parameters,":[89],"maximum":[91,95],"domain":[92],"size":[93,96],"scopes.":[100],"show":[102],"that,":[103],"depending":[104],"on":[105],"parameter,":[107],"can":[109],"make":[110],"tractable":[113],"while":[114],"provably":[117],"intractable":[118],"in":[119],"general":[120]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}