{"id":"https://openalex.org/W3185454258","doi":"https://doi.org/10.1137/18m117577x","title":"Solving CSPs Using Weak Local Consistency","display_name":"Solving CSPs Using Weak Local Consistency","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3185454258","doi":"https://doi.org/10.1137/18m117577x","mag":"3185454258"},"language":"en","primary_location":{"id":"doi:10.1137/18m117577x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m117577x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ruj.uj.edu.pl/xmlui/handle/item/279141","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045956843","display_name":"Marcin Kozik","orcid":"https://orcid.org/0000-0002-1839-4824"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marcin Kozik","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045956843"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1838,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8193735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","issue":"4","first_page":"1263","last_page":"1286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6496031284332275},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5842078924179077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5371896028518677},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5199145674705505},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46402671933174133},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.447135865688324},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.4286145269870758},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.42593562602996826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34340882301330566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27209728956222534},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.08313581347465515}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6496031284332275},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5842078924179077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5371896028518677},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5199145674705505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46402671933174133},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.447135865688324},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4286145269870758},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.42593562602996826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34340882301330566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27209728956222534},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.08313581347465515},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m117577x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m117577x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/279141","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/279141","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"artyku\u0142 w czasopi\u015bmie"}],"best_oa_location":{"id":"pmh:oai:ruj.uj.edu.pl:item/279141","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/279141","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"artyku\u0142 w czasopi\u015bmie"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1972179987","https://openalex.org/W1996330905","https://openalex.org/W2020154454","https://openalex.org/W2026753685","https://openalex.org/W2028019552","https://openalex.org/W2034079307","https://openalex.org/W2049352524","https://openalex.org/W2095366129","https://openalex.org/W2150339067","https://openalex.org/W2151577278","https://openalex.org/W2253270855","https://openalex.org/W2314918483","https://openalex.org/W2571362277","https://openalex.org/W2811376014","https://openalex.org/W2964303025"],"related_works":["https://openalex.org/W2118249115","https://openalex.org/W2569549435","https://openalex.org/W2971748376","https://openalex.org/W2008412758","https://openalex.org/W142570753","https://openalex.org/W2164995515","https://openalex.org/W2098650100","https://openalex.org/W52378903","https://openalex.org/W2115871986","https://openalex.org/W2923662005"],"abstract_inverted_index":{"The":[0,201],"characterization":[1,275],"of":[2,17,62,90,93,106,126,155,175,191,203,217,221,230,240,276,286,297],"all":[3,103,123,172],"the":[4,91,104,124,153,173,186,215,227,241],"constraint":[5],"satisfaction":[6],"problems":[7],"solvable":[8],"by":[9,22,36,40,97,167,235,291],"local":[10,94],"consistency":[11,95,116,144,205,211],"checking":[12],"(also":[13],"known":[14,180],"as":[15,179],"CSPs":[16,105,125,174,190,260],"bounded":[18,107,127,176,192,287],"width)":[19],"was":[20,34],"proposed":[21],"Feder":[23],"and":[24,47,49,53,70,141,158],"Vardi":[25],"[SIAM":[26],"J.":[27,73],"Comput.,":[28,82,162],"28":[29],"(1998),":[30],"pp.":[31,66,85,165,255],"57--104].":[32],"It":[33],"confirmed":[35],"two":[37],"independent":[38],"proofs":[39],"Bulatov":[41],"[Bounded":[42],"Relational":[43],"Width,":[44],"manuscript,":[45],"2009]":[46],"Barto":[48,52,69,79],"Kozik":[50],"[L.":[51,68],"M.":[54,71],"Kozik,":[55,72],"50th":[56],"Annual":[57,243],"IEEE":[58],"Symposium":[59,245],"on":[60,246],"Foundations":[61],"Computer":[63],"Science,":[64],"2009,":[65],"595--603],":[67],"ACM,":[74,251],"61":[75],"(2014),":[76,84],"3].":[77],"Later":[78],"[J.":[80,160],"Logic":[81,161],"26":[83],"923--943]":[86],"proved":[87,290],"a":[88,114,210,222,294],"collapse":[89],"hierarchy":[92],"notions":[96],"showing":[98],"that":[99,169,189,259],"(2,3)":[100,135,137],"minimality":[101],"solves":[102,122,171],"width.":[108,128,177],"In":[109,225],"this":[110,231],"paper":[111,232],"we":[112],"present":[113],"new":[115],"notion,":[117],"jpq":[118,204],"consistency,":[119,136,140],"which":[120],"also":[121],"Our":[129],"notion":[130],"is":[131,206,233,293],"strictly":[132],"weaker":[133],"than":[134],"minimality,":[138],"path":[139],"singleton":[142],"arc":[143],"(SAC).":[145],"This":[146],"last":[147],"fact":[148],"allows":[149],"us":[150],"to":[151,209,257],"answer":[152],"question":[154],"Chen,":[156],"Dalmau,":[157],"Gru\u00dfien":[159],"23":[163],"(2013),":[164],"87--108]":[166],"confirming":[168],"SAC":[170],"Moreover,":[178],"algorithms":[181,268],"work":[182],"faster":[183],"for":[184],"SAC,":[185],"result":[187,229],"implies":[188],"width":[193],"can":[194],"be,":[195],"in":[196,281],"practice,":[197],"solved":[198],"more":[199],"efficiently.":[200],"definition":[202],"closely":[207],"related":[208],"condition":[212],"obtained":[213],"from":[214],"rounding":[216],"an":[218,273],"SDP":[219],"relaxation":[220],"CSP":[223],"instance.":[224],"fact,":[226],"main":[228],"used":[234],"Dalmau":[236],"et":[237],"al.":[238],"[Proceedings":[239],"28th":[242],"ACM-SIAM":[244],"Discrete":[247],"Algorithms,":[248],"SIAM,":[249],"Philadelphia,":[250],"New":[252],"York,":[253],"2017,":[254],"340--357]":[256],"show":[258],"with":[261,269,284],"near":[262],"unanimity":[263],"polymorphisms":[264],"admit":[265],"robust":[266],"approximation":[267],"polynomial":[270],"loss.":[271],"Finally,":[272],"algebraic":[274],"some":[277],"term":[278],"conditions":[279],"satisfied":[280],"algebras":[282],"associated":[283],"templates":[285],"width,":[288],"first":[289],"Brady,":[292],"direct":[295],"consequence":[296],"our":[298],"result.":[299]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}