{"id":"https://openalex.org/W2032487621","doi":"https://doi.org/10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","display_name":"Complexity of conservative constraint satisfaction problems","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2032487621","doi":"https://doi.org/10.1145/1970398.1970400","mag":"2032487621"},"language":"en","primary_location":{"id":"doi:10.1145/1970398.1970400","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1970398.1970400","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5108247017","display_name":"Andre\u012d A. Bulatov","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":["Simon Fraser University, British Columbia, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, British Columbia, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108247017"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":11.633,"has_fulltext":false,"cited_by_count":152,"citation_normalized_percentile":{"value":0.99012436,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9991999864578247,"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.9753000140190125,"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/unary-operation","display_name":"Unary operation","score":0.8495116829872131},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7904890775680542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6370173096656799},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6088943481445312},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5575213432312012},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5258859992027283},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48414239287376404},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4834388196468353},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47927090525627136},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.4780883491039276},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4652600586414337},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.457964688539505},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.43074262142181396},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.4176177382469177},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.41048556566238403},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36195260286331177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28897804021835327},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2813136577606201},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10556218028068542}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8495116829872131},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7904890775680542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6370173096656799},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6088943481445312},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5575213432312012},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5258859992027283},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48414239287376404},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4834388196468353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47927090525627136},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.4780883491039276},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4652600586414337},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.457964688539505},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.43074262142181396},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4176177382469177},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.41048556566238403},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36195260286331177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28897804021835327},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2813136577606201},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10556218028068542},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1970398.1970400","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1970398.1970400","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.9544","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/~abulatov/papers/consfull.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.406.5725","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/~abulatov/papers/conserv-journ.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W80728659","https://openalex.org/W125196440","https://openalex.org/W153181359","https://openalex.org/W1120761376","https://openalex.org/W1488709943","https://openalex.org/W1493674456","https://openalex.org/W1508474696","https://openalex.org/W1571096293","https://openalex.org/W1571873445","https://openalex.org/W1589711670","https://openalex.org/W1748315421","https://openalex.org/W1793685185","https://openalex.org/W1965377399","https://openalex.org/W1983032729","https://openalex.org/W1988205260","https://openalex.org/W1997649256","https://openalex.org/W2018547288","https://openalex.org/W2022408132","https://openalex.org/W2025319967","https://openalex.org/W2026745535","https://openalex.org/W2026753685","https://openalex.org/W2033470072","https://openalex.org/W2034079307","https://openalex.org/W2040102827","https://openalex.org/W2040145343","https://openalex.org/W2045479874","https://openalex.org/W2049197377","https://openalex.org/W2050882124","https://openalex.org/W2077575555","https://openalex.org/W2093461317","https://openalex.org/W2116407296","https://openalex.org/W2119456262","https://openalex.org/W2129023820","https://openalex.org/W2132911512","https://openalex.org/W2137988174","https://openalex.org/W2150339067","https://openalex.org/W2155002729","https://openalex.org/W2166566648","https://openalex.org/W2169474499","https://openalex.org/W2173530240","https://openalex.org/W2337098149","https://openalex.org/W2504299149","https://openalex.org/W2561675875","https://openalex.org/W2911854207","https://openalex.org/W2914408291","https://openalex.org/W4230659860","https://openalex.org/W4254380579","https://openalex.org/W4387647118","https://openalex.org/W6886175930"],"related_works":["https://openalex.org/W2045729033","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2091348864","https://openalex.org/W2737098235","https://openalex.org/W2295056692","https://openalex.org/W2724280655","https://openalex.org/W2012141606","https://openalex.org/W2906226597","https://openalex.org/W2161128834"],"abstract_inverted_index":{"In":[0,161],"a":[1,16,59,64,169],"constraint":[2,60,84,132,150],"satisfaction":[3],"problem":[4,183],"(CSP),":[5],"the":[6,38,41,102,106,110,179,191,195,199],"aim":[7],"is":[8,27,184],"to":[9,15,22,29,46,71,81,89,155,167,202],"find":[10],"an":[11],"assignment":[12],"of":[13,19,40,66,105,112,123,172],"values":[14,113],"given":[17],"set":[18,65,111],"variables,":[20],"subject":[21],"specified":[23],"constraints.":[24,75],"The":[25,189],"CSP":[26,159,203],"known":[28],"be":[30,72,119,127],"NP-complete":[31],"in":[32,49,108,186,205],"general.":[33],"However,":[34],"certain":[35],"restrictions":[36,53],"on":[37],"form":[39],"allowed":[42,70],"constraints":[43],"can":[44,118,126],"lead":[45],"problems":[47],"solvable":[48,158,185],"polynomial":[50,156,187],"time.":[51,188],"Such":[52],"are":[54,69],"usually":[55],"imposed":[56],"by":[57,129],"specifying":[58],"language,":[61],"that":[62,68,86,94,152],"is,":[63],"relations":[67],"used":[73],"as":[74],"A":[76],"principal":[77],"research":[78],"direction":[79],"aims":[80],"distinguish":[82],"those":[83,93,131,173],"languages":[85,133,143,151],"give":[87,153],"rise":[88,154],"tractable":[90],"CSPs":[91],"from":[92],"do":[95],"not.":[96],"We":[97,146],"achieve":[98],"this":[99,124,163],"goal":[100],"for":[101,114,177],"important":[103],"version":[104],"CSP,":[107],"which":[109,134,178],"each":[115],"individual":[116],"variable":[117],"restricted":[120],"arbitrarily.":[121],"Restrictions":[122],"type":[125],"studied":[128],"considering":[130],"contain":[135],"all":[136],"possible":[137],"unary":[138],"constraints;":[139],"we":[140],"call":[141],"such":[142],"conservative":[144,149],".":[145],"completely":[147],"characterize":[148],"time":[157],"classes.":[160],"particular,":[162],"result":[164],"allows":[165],"us":[166],"obtain":[168],"complete":[170],"description":[171],"(directed)":[174],"graphs":[175],"H":[176,181],"List":[180],"-Coloring":[182],"result,":[190],"solving":[192],"algorithm,":[193],"and":[194,216,218],"proofs":[196],"heavily":[197],"use":[198],"algebraic":[200],"approach":[201],"developed":[204],"Jeavons":[206,210,219],"et":[207,213],"al.":[208,214],"[1997],":[209],"[1998],":[211],"Bulatov":[212,217],"[2005],":[215],"[2001b,":[220],"2003].":[221]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":22},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}