{"id":"https://openalex.org/W2800221442","doi":"https://doi.org/10.1142/s0218213018600023","title":"Methods for Parallelizing Constraint Propagation through the Use of Strong Local Consistencies","display_name":"Methods for Parallelizing Constraint Propagation through the Use of Strong Local Consistencies","publication_year":2018,"publication_date":"2018-04-23","ids":{"openalex":"https://openalex.org/W2800221442","doi":"https://doi.org/10.1142/s0218213018600023","mag":"2800221442"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213018600023","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213018600023","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5006781417","display_name":"Minas Dasygenis","orcid":"https://orcid.org/0000-0002-2180-9752"},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Minas Dasygenis","raw_affiliation_strings":["Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Kozani, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019222560","display_name":"Kostas Stergiou","orcid":"https://orcid.org/0000-0002-5702-9096"},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Kostas Stergiou","raw_affiliation_strings":["Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Kozani, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I89506807"],"apc_list":null,"apc_paid":null,"fwci":0.1895,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53611278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"04","first_page":"1860002","last_page":"1860002"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.978600025177002,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9768000245094299,"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/computer-science","display_name":"Computer science","score":0.8855959177017212},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.882584810256958},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6019338369369507},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5629891753196716},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5560294985771179},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5179530382156372},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5079041123390198},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4442824423313141},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.44334715604782104},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.435651570558548},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4297523498535156},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.428047776222229},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42121049761772156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3995864987373352},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3080660104751587},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11378571391105652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0852232575416565},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06948289275169373}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8855959177017212},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.882584810256958},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6019338369369507},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5629891753196716},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5560294985771179},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5179530382156372},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5079041123390198},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4442824423313141},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.44334715604782104},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.435651570558548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4297523498535156},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.428047776222229},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42121049761772156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3995864987373352},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3080660104751587},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11378571391105652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0852232575416565},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06948289275169373},{"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/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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213018600023","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213018600023","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1975140573","https://openalex.org/W2020066471","https://openalex.org/W2059035667","https://openalex.org/W2066252813","https://openalex.org/W2067633747","https://openalex.org/W2070201365","https://openalex.org/W2077885103","https://openalex.org/W2086991642","https://openalex.org/W2113654469","https://openalex.org/W2149284637","https://openalex.org/W2520435613","https://openalex.org/W2549560969","https://openalex.org/W4404894468"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2032348095","https://openalex.org/W2049055139","https://openalex.org/W2520084020","https://openalex.org/W2524435840","https://openalex.org/W2156897434","https://openalex.org/W2117339357"],"abstract_inverted_index":{"Constraint":[0,14],"programming":[1],"(CP)":[2],"is":[3,104,159],"a":[4,66,127,154,160,165,174],"powerful":[5],"paradigm":[6],"for":[7],"various":[8],"types":[9],"of":[10,33,116,131,153,167,189,209,222,236],"hard":[11],"combinatorial":[12],"problems.":[13],"propagation":[15,79,103,124,136,146,176],"techniques,":[16],"such":[17],"as":[18],"arc":[19],"consistency":[20],"(AC),":[21],"are":[22,59,75,81],"used":[23,62],"within":[24],"solvers":[25],"to":[26,50,92,133,234],"prune":[27,51],"inconsistent":[28],"values":[29],"from":[30],"the":[31,34,39,48,52,113,182,190,195,199,210,220,240],"domains":[32],"variables":[35],"and":[36,85,164],"narrow":[37],"down":[38],"search":[40,53,141,156,191,211],"space.":[41],"Local":[42],"consistencies":[43],"stronger":[44],"than":[45],"AC":[46],"have":[47,230],"potential":[49],"space":[54],"even":[55],"more,":[56],"but":[57],"they":[58,64,74,87],"not":[60],"widely":[61],"because":[63],"incur":[65],"high":[67],"run":[68,203],"time":[69],"penalty":[70],"in":[71,119,126,148,194,239,246],"cases":[72],"where":[73],"unsuccessful.":[76],"All":[77],"constraint":[78,102,135],"techniques":[80],"sequential":[82],"by":[83,225],"nature,":[84],"thus":[86],"cannot":[88],"be":[89],"scaled":[90],"up":[91],"modern":[93,117],"multicore":[94],"machines.":[95],"For":[96],"this":[97,109],"reason,":[98],"research":[99,224],"on":[100,216],"parallelizing":[101],"very":[105],"limited.":[106],"Contributing":[107],"towards":[108],"direction,":[110],"we":[111,138],"exploit":[112],"parallelization":[114],"possibilities":[115],"CPUs":[118],"tandem":[120],"with":[121,170],"strong":[122,175],"local":[123],"methods":[125,147],"novel":[128],"way.":[129],"Instead":[130],"trying":[132],"parallelize":[134],"algorithms,":[137],"propose":[139],"two":[140],"algorithms":[142,151,229],"that":[143,227],"apply":[144],"different":[145,183,207],"parallel.":[149],"Both":[150],"consist":[152],"master":[155,196],"process,":[157,197],"which":[158],"typical":[161],"CP":[162],"solver,":[163],"number":[166],"slave":[168],"processes,":[169],"each":[171,187],"one":[172,201],"implementing":[173],"method.":[177],"The":[178],"first":[179],"algorithm":[180],"runs":[181],"propagators":[184],"synchronously":[185],"at":[186,206],"node":[188],"tree":[192],"explored":[193],"while":[198,243],"second":[200],"can":[202],"them":[204],"asynchronously":[205],"nodes":[208],"tree.":[212],"Preliminary":[213],"experimental":[214],"results":[215],"well-established":[217],"benchmarks":[218],"display":[219],"promise":[221],"our":[223,228],"illustrating":[226],"execution":[231],"times":[232],"equal":[233],"those":[235],"serial":[237],"solvers,":[238],"worst":[241],"case,":[242],"being":[244],"faster":[245],"most":[247],"cases.":[248]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}