{"id":"https://openalex.org/W2945607717","doi":"https://doi.org/10.1109/rivf.2019.8713704","title":"A Fast Filtering Algorithm for Continuous Constraint Satisfaction Problems","display_name":"A Fast Filtering Algorithm for Continuous Constraint Satisfaction Problems","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2945607717","doi":"https://doi.org/10.1109/rivf.2019.8713704","mag":"2945607717"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2019.8713704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","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/A5010604295","display_name":"Van Lam Ho","orcid":"https://orcid.org/0000-0002-2663-8913"},"institutions":[{"id":"https://openalex.org/I4210137358","display_name":"Quy Nhon University","ror":"https://ror.org/04h4y6q56","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210137358"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Van Lam Ho","raw_affiliation_strings":["Department of Information Technology, QuyNhon University, BinhDinh, VietNam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, QuyNhon University, BinhDinh, VietNam","institution_ids":["https://openalex.org/I4210137358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044292096","display_name":"K. Robert Lai","orcid":"https://orcid.org/0000-0002-3365-3927"},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"K.Robert Lai","raw_affiliation_strings":["Department of Computer Science & Engineering, Yuan Ze University, Taiwan, R.O.C","Department of Computer Science & Engineering, Yuan Ze University, Taiwan, R.O.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Yuan Ze University, Taiwan, R.O.C","institution_ids":["https://openalex.org/I99908691"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, Yuan Ze University, Taiwan, R.O.C","institution_ids":["https://openalex.org/I99908691"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05512611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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.9937000274658203,"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.9887999892234802,"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.9172621369361877},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.8090088367462158},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7526040077209473},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7216535806655884},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.7023153305053711},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6748278141021729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6114082336425781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5764309167861938},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5201690196990967},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.513945996761322},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4856666326522827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.485405296087265},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.459021657705307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2614830732345581},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20231065154075623}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.9172621369361877},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.8090088367462158},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7526040077209473},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7216535806655884},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.7023153305053711},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6748278141021729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6114082336425781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5764309167861938},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5201690196990967},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.513945996761322},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4856666326522827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.485405296087265},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.459021657705307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2614830732345581},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20231065154075623},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2019.8713704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1984540483","https://openalex.org/W2042619750","https://openalex.org/W2049953405","https://openalex.org/W2051735096","https://openalex.org/W2060040854","https://openalex.org/W2079809152","https://openalex.org/W2101269177","https://openalex.org/W2346520162","https://openalex.org/W2480779391"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2141935412","https://openalex.org/W1486916474","https://openalex.org/W2737098235","https://openalex.org/W96881443","https://openalex.org/W2012141606","https://openalex.org/W2161128834","https://openalex.org/W2295056692"],"abstract_inverted_index":{"We":[0],"propose":[1],"an":[2,16],"efficient":[3],"filtering":[4],"algorithm":[5,14,107],"to":[6,24,60,66,73,86],"solve":[7],"for":[8,39],"continuous":[9,50],"constraint":[10,31,51,71],"satisfaction":[11],"systems.":[12],"The":[13,33,53,106],"uses":[15],"approximate":[17],"method,":[18],"named":[19],"Landmark-based":[20],"Approximate":[21],"Inference":[22],"(LAI)":[23],"find":[25],"landmark-based":[26,37,64],"values":[27,38,65],"of":[28,49,56,63,104],"variables":[29],"in":[30,83,114],"system.":[32,52],"method":[34],"used":[35],"the":[36,70,99],"finding":[40],"not":[41],"only":[42],"local":[43],"consistency":[44,48],"but":[45],"also":[46,109],"global":[47,88],"key":[54],"idea":[55],"this":[57],"approach":[58,79],"is":[59,108],"generate":[61],"candidates":[62],"be":[67],"utilized":[68],"during":[69],"propagation":[72],"facilitate":[74],"a":[75,94],"quiescent":[76],"condition.":[77],"This":[78],"solved":[80],"separate":[81],"subintervals":[82],"solutions":[84,100],"problem":[85],"get":[87],"consistency,":[89],"handles":[90],"complicated":[91],"problems":[92],"with":[93,111],"low":[95],"cost":[96],"and":[97],"captures":[98],"on":[101],"various":[102],"types":[103],"constraints.":[105],"compared":[110],"other":[112],"methods":[113],"real-word":[115],"applications.":[116]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}