{"id":"https://openalex.org/W2058170847","doi":"https://doi.org/10.1145/1810891.1810914","title":"Constraint satisfaction problems and global cardinality constraints","display_name":"Constraint satisfaction problems and global cardinality constraints","publication_year":2010,"publication_date":"2010-08-31","ids":{"openalex":"https://openalex.org/W2058170847","doi":"https://doi.org/10.1145/1810891.1810914","mag":"2058170847"},"language":"en","primary_location":{"id":"doi:10.1145/1810891.1810914","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810891.1810914","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"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":"Communications of the ACM","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":false,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":["Simon Fraser Univerity, Burnaby, BC, Canada","Simon Fraser Univerity, Burnaby, BC, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser Univerity, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Simon Fraser Univerity, Burnaby, BC, Canada#TAB#","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8279,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86019186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"53","issue":"9","first_page":"99","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9822999835014343,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8778975605964661},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7941677570343018},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.7356725931167603},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6664908528327942},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6581990718841553},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5867642760276794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5343823432922363},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5280063152313232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5219661593437195},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.49933505058288574},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.45975399017333984},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4509413540363312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40331485867500305},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.40308651328086853}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8778975605964661},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7941677570343018},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.7356725931167603},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6664908528327942},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6581990718841553},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5867642760276794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5343823432922363},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5280063152313232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5219661593437195},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.49933505058288574},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.45975399017333984},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4509413540363312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40331485867500305},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.40308651328086853},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1810891.1810914","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810891.1810914","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"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":"Communications of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.6838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.6838","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/globalCACM.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W34906880","https://openalex.org/W99828349","https://openalex.org/W137416953","https://openalex.org/W569515957","https://openalex.org/W1120761376","https://openalex.org/W1486752157","https://openalex.org/W1511747486","https://openalex.org/W1549026077","https://openalex.org/W1555655798","https://openalex.org/W1560484887","https://openalex.org/W1667362966","https://openalex.org/W1876800908","https://openalex.org/W1997649256","https://openalex.org/W2001101327","https://openalex.org/W2025509872","https://openalex.org/W2026745535","https://openalex.org/W2052936500","https://openalex.org/W2068190866","https://openalex.org/W2072755230","https://openalex.org/W2107918022","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2119456262","https://openalex.org/W2124452950","https://openalex.org/W2134358914","https://openalex.org/W2134850460","https://openalex.org/W2137988174","https://openalex.org/W2150339067","https://openalex.org/W2157743984","https://openalex.org/W2159738186","https://openalex.org/W2163094612","https://openalex.org/W2166566648","https://openalex.org/W2199961663","https://openalex.org/W2337098149","https://openalex.org/W2426452510","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W2141935412","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2096689540","https://openalex.org/W2017710358","https://openalex.org/W2737098235","https://openalex.org/W3122634451","https://openalex.org/W2295056692","https://openalex.org/W2724280655"],"abstract_inverted_index":{"In":[0],"a":[1,14,39],"constraint":[2,26],"satisfaction":[3],"problem":[4,48],"(CSP)":[5],"the":[6,44,47,50,61,85],"goal":[7],"is":[8,27],"to":[9,20,76],"find":[10],"an":[11,28],"assignment":[12],"of":[13,17,46,67],"given":[15],"set":[16,62],"variables":[18,35],"subject":[19],"specified":[21],"constraints.":[22],"A":[23],"global":[24,53],"cardinality":[25,54],"additional":[29],"requirement":[30],"that":[31,56,73,84],"prescribes":[32],"how":[33],"many":[34],"must":[36],"be":[37],"assigned":[38],"certain":[40],"value.":[41],"We":[42],"study":[43],"complexity":[45],"CCSP(\u0393),":[49],"CSP":[51],"with":[52],"constraints":[55],"allows":[57],"only":[58],"relations":[59],"from":[60],"\u0393.":[63],"The":[64],"main":[65],"result":[66],"this":[68],"paper":[69],"characterizes":[70],"sets":[71],"\u0393":[72],"give":[74],"rise":[75],"problems":[77,88],"solvable":[78],"in":[79],"polynomial":[80],"time,":[81],"and":[82],"states":[83],"remaining":[86],"such":[87],"are":[89],"NP-complete.":[90]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}