{"id":"https://openalex.org/W2790200723","doi":"https://doi.org/10.1109/spac.2017.8304329","title":"Improving on the restricted path consistency constraint propagation algorithms based on the bitwise","display_name":"Improving on the restricted path consistency constraint propagation algorithms based on the bitwise","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2790200723","doi":"https://doi.org/10.1109/spac.2017.8304329","mag":"2790200723"},"language":"en","primary_location":{"id":"doi:10.1109/spac.2017.8304329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spac.2017.8304329","pdf_url":null,"source":{"id":"https://openalex.org/S4306498208","display_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","raw_type":"proceedings-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/A5020260327","display_name":"Zhuyuan Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]},{"id":"https://openalex.org/I4210134929","display_name":"Jilin Province Science and Technology Department","ror":"https://ror.org/049x38272","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210134929"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Cheng Zhuyuan","raw_affiliation_strings":["College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210134929","https://openalex.org/I194450716"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zhang Yonggang","orcid":null},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]},{"id":"https://openalex.org/I4210134929","display_name":"Jilin Province Science and Technology Department","ror":"https://ror.org/049x38272","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210134929"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhang Yonggang","raw_affiliation_strings":["College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210134929","https://openalex.org/I194450716"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020260327"],"corresponding_institution_ids":["https://openalex.org/I194450716","https://openalex.org/I4210134929"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25611661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1330","issue":null,"first_page":"497","last_page":"502"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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.9891999959945679,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9818999767303467,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8626474142074585},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.774649977684021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6967918872833252},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6899520754814148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6463204622268677},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6192622184753418},{"id":"https://openalex.org/keywords/bitwise-operation","display_name":"Bitwise operation","score":0.483391672372818},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48216575384140015},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4615405201911926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23172542452812195},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13916075229644775}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8626474142074585},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.774649977684021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6967918872833252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6899520754814148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6463204622268677},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6192622184753418},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.483391672372818},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48216575384140015},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4615405201911926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23172542452812195},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13916075229644775},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spac.2017.8304329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spac.2017.8304329","pdf_url":null,"source":{"id":"https://openalex.org/S4306498208","display_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W914322","https://openalex.org/W47957325","https://openalex.org/W144136056","https://openalex.org/W1482062249","https://openalex.org/W1510816548","https://openalex.org/W1554957931","https://openalex.org/W1581185734","https://openalex.org/W1582685993","https://openalex.org/W1588613615","https://openalex.org/W1678657513","https://openalex.org/W1946570941","https://openalex.org/W2015725301","https://openalex.org/W2031326491","https://openalex.org/W2068852367","https://openalex.org/W2070201365","https://openalex.org/W2099980081","https://openalex.org/W2111554761","https://openalex.org/W2135432705","https://openalex.org/W2298605637","https://openalex.org/W2400262625","https://openalex.org/W2406414475","https://openalex.org/W6634900143","https://openalex.org/W6634962022"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W4303044088","https://openalex.org/W96881443","https://openalex.org/W1486916474","https://openalex.org/W2012694101","https://openalex.org/W1550482496","https://openalex.org/W2737098235","https://openalex.org/W2140769824"],"abstract_inverted_index":{"The":[0,14,24,153],"constraint":[1],"satisfaction":[2],"problem(CSP)":[3],"is":[4,27,82,156],"very":[5,28,158],"important":[6,29],"and":[7,22,33,86,117,137],"meaningful":[8],"in":[9,30,41,61,148],"solving":[10],"the":[11,20,31,34,38,42,52,62,68,74,80,96,115,118,124,128,134,138],"NP-hard":[12],"problems.":[13],"CSP":[15],"mainly":[16],"include":[17],"two":[18],"parts:":[19],"reasoning":[21],"searching.":[23],"filtering":[25,43],"technology":[26],"searching":[32],"consistency":[35,90,101,110],"algorithm":[36,51,111,143],"plays":[37],"crucial":[39],"role":[40],"technology.":[44],"Recently,":[45],"Kostas":[46],"Stergiou":[47],"proposed":[48,107],"easily":[49],"implement":[50],"restricted":[53,69,70],"path":[54,71,141,145],"consistency3(RPC3)":[55],"algorithm,":[56],"which":[57],"can":[58],"efficiently":[59],"work":[60],"whole":[63],"search.":[64],"Then":[65,92],"he":[66],"implements":[67],"consistency3(rRPC3)":[72],"having":[73],"similar":[75],"performance":[76],"with":[77],"RPC3,":[78],"while":[79],"rRPC3":[81,116,135],"better":[83,97,131],"than":[84,99,133],"RPC3":[85],"most":[87,149],"of":[88,150],"other":[89,100],"algorithms.":[91,102],"that":[93],"experiments":[94,125],"showed":[95],"effectiveness":[98],"In":[103],"this":[104],"paper,":[105],"we":[106],"a":[108,157],"new":[109,154],"rRPC3bit":[112,129,155],"based":[113],"on":[114],"arc":[119],"consistency(AC)+bit":[120],"ideas.":[121],"And":[122],"then":[123],"clearly":[126],"show":[127],"has":[130],"results":[132],"algorithms":[136],"state-of-art":[139],"max-restricted":[140],"consistency3(maxRPC3)":[142],"light-max-restricted":[144],"consistency3-residues":[146],"multiple(lmaxRPC3rm)":[147],"test":[151],"cases.":[152],"promising":[159],"algorithm.":[160]},"counts_by_year":[],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}