{"id":"https://openalex.org/W2748016900","doi":"https://doi.org/10.1093/comjnl/bxx122","title":"Exploring Directional Path-Consistency for Solving Constraint Networks","display_name":"Exploring Directional Path-Consistency for Solving Constraint Networks","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2748016900","doi":"https://doi.org/10.1093/comjnl/bxx122","mag":"2748016900"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxx122","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx122","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1708.05522","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091265949","display_name":"Shufeng Kong","orcid":"https://orcid.org/0000-0003-4264-3330"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Shufeng Kong","raw_affiliation_strings":["QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia"],"affiliations":[{"raw_affiliation_string":"QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108049690","display_name":"Sanjiang Li","orcid":"https://orcid.org/0000-0002-3332-2546"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU","CN"],"is_corresponding":false,"raw_author_name":"Sanjiang Li","raw_affiliation_strings":["QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia","UTS-AMSS Joint Research Laboratory, AMSS, Chinese Academy of Sciences, 55 East Zhongguancun Road, Haidian, Beijing, China"],"affiliations":[{"raw_affiliation_string":"QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia","institution_ids":["https://openalex.org/I114017466"]},{"raw_affiliation_string":"UTS-AMSS Joint Research Laboratory, AMSS, Chinese Academy of Sciences, 55 East Zhongguancun Road, Haidian, Beijing, China","institution_ids":["https://openalex.org/I19820366"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087883689","display_name":"Michael Sioutis","orcid":"https://orcid.org/0000-0001-7562-2443"},"institutions":[{"id":"https://openalex.org/I26437253","display_name":"\u00d6rebro University","ror":"https://ror.org/05kytsw45","country_code":"SE","type":"education","lineage":["https://openalex.org/I26437253"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Michael Sioutis","raw_affiliation_strings":["AASS, \u00d6rebro University, Fakultetsgatan 1, \u00d6rebro, Sweden"],"affiliations":[{"raw_affiliation_string":"AASS, \u00d6rebro University, Fakultetsgatan 1, \u00d6rebro, Sweden","institution_ids":["https://openalex.org/I26437253"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091265949"],"corresponding_institution_ids":["https://openalex.org/I114017466"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.2193,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58637534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"61","issue":"9","first_page":"1338","last_page":"1350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9850000143051147,"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/local-consistency","display_name":"Local consistency","score":0.8201587796211243},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7670322060585022},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.7304922938346863},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6606914401054382},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6355441212654114},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.624914288520813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5458058714866638},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4501835107803345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4476906657218933},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4280933141708374},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4266544580459595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38957080245018005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3487980365753174},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.216697096824646},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10686996579170227}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8201587796211243},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7670322060585022},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.7304922938346863},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6606914401054382},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6355441212654114},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.624914288520813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5458058714866638},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4501835107803345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4476906657218933},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4280933141708374},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4266544580459595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38957080245018005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3487980365753174},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.216697096824646},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10686996579170227},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1093/comjnl/bxx122","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx122","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1708.05522","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1708.05522","pdf_url":"https://arxiv.org/pdf/1708.05522","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"},{"id":"pmh:oai:HAL:hal-02067904v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02067904","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The Computer Journal, 2018, 61 (9), pp.1338-1350. ⟨10.1093/comjnl/bxx122⟩","raw_type":"Journal articles"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/133707","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/133707","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1708.05522","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1708.05522","pdf_url":"https://arxiv.org/pdf/1708.05522","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W178755245","https://openalex.org/W1009693448","https://openalex.org/W1493674456","https://openalex.org/W1562734116","https://openalex.org/W1965377399","https://openalex.org/W1972179987","https://openalex.org/W1985525233","https://openalex.org/W2002478775","https://openalex.org/W2002783815","https://openalex.org/W2016639451","https://openalex.org/W2020154454","https://openalex.org/W2032856248","https://openalex.org/W2041737564","https://openalex.org/W2055595236","https://openalex.org/W2061734130","https://openalex.org/W2077885103","https://openalex.org/W2089465933","https://openalex.org/W2099980081","https://openalex.org/W2119456262","https://openalex.org/W2126916883","https://openalex.org/W2130182605","https://openalex.org/W2135432705","https://openalex.org/W2138037655","https://openalex.org/W2168818382","https://openalex.org/W2179823679","https://openalex.org/W2255409074","https://openalex.org/W2314918483","https://openalex.org/W2337098149","https://openalex.org/W2346597746","https://openalex.org/W2349759657","https://openalex.org/W2396595190","https://openalex.org/W2426452510","https://openalex.org/W2617557301","https://openalex.org/W2949409357","https://openalex.org/W4299843867"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W96881443","https://openalex.org/W2140769824","https://openalex.org/W2141935412","https://openalex.org/W2784687883","https://openalex.org/W1544601823","https://openalex.org/W2032348095"],"abstract_inverted_index":{"Among":[0],"the":[1,65,80,111,117,153,187],"local":[2],"consistency":[3],"techniques":[4],"used":[5],"for":[6,139,143,190],"solving":[7,191],"constraint":[8,66,72,93,121,145,150],"networks,":[9],"path-consistency":[10],"(PC)":[11],"has":[12,79],"received":[13],"a":[14,32,39,71,97,107,120,132],"great":[15],"deal":[16],"of":[17,35,60,70,110,119,148,155],"attention.":[18],"However,":[19,85],"enforcing":[20,58],"PC":[21,29,36],"is":[22,31,76,129,137],"computationally":[23],"expensive":[24],"and":[25,43,62,78,114,159,177],"sometimes":[26],"unnecessary.":[27],"Directional":[28],"(DPC)":[30],"weaker":[33],"notion":[34],"that":[37,55,89,116,184],"considers":[38],"given":[40],"variable":[41,81],"ordering":[42],"can":[44,95,123],"thus":[45],"be":[46,124],"enforced":[47],"more":[48,100],"efficiently":[49],"than":[50,101],"PC.":[51],"This":[52],"paper":[53],"shows":[54],"(the":[56],"DPC":[57],"algorithm":[59],"Dechter":[61],"Pearl)":[63],"decides":[64],"satisfaction":[67],"problem":[68],"(CSP)":[69],"language":[73,94,122],"if":[74,127],"it":[75,128],"complete":[77,91],"elimination":[82],"property":[83],"(VEP).":[84],"we":[86],"also":[87],"show":[88,115,183],"no":[90],"VEP":[92],"have":[96,163],"domain":[98],"with":[99],"two":[102],"values.":[103],"We":[104],"then":[105],"present":[106],"simple":[108],"variant":[109],"algorithm,":[112],"called,":[113],"CSP":[118],"decided":[125],"by":[126],"closed":[130],"under":[131],"majority":[133],"operation.":[134],"In":[135],"fact,":[136],"sufficient":[138],"guaranteeing":[140],"backtrack-free":[141],"search":[142],"such":[144,169],"networks.":[146],"Examples":[147],"majority-closed":[149,192],"classes":[151,154],"include":[152],"connected":[156],"row-convex":[157],"constraints":[158],"tree-preserving":[160],"constraints,":[161],"which":[162],"found":[164],"applications":[165],"in":[166],"various":[167],"domains,":[168],"as":[170],"scene":[171],"labeling,":[172],"temporal":[173],"reasoning,":[174],"geometric":[175],"reasoning":[176],"logical":[178],"filtering.":[179],"Our":[180],"experimental":[181],"evaluations":[182],"significantly":[185],"outperforms":[186],"state-of-the-art":[188],"algorithms":[189],"constraints.":[193]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}