KMS Of Academy of mathematics and systems sciences, CAS
| Exploring Directional Path-Consistency for Solving Constraint Networks | |
| Kong, Shufeng1; Li, Sanjiang1,2; Sioutis, Michael3 | |
| 2018-09-01 | |
| Source Publication | COMPUTER JOURNAL
 |
| ISSN | 0010-4620 |
| Volume | 61Issue:9Pages:1338-1350 |
| Abstract | Among the local consistency techniques used for solving constraint networks, path-consistency (PC) has received a great deal of attention. However, enforcing PC is computationally expensive and sometimes unnecessary. Directional PC (DPC) is a weaker notion of PC that considers a given variable ordering and can thus be enforced more efficiently than PC. This paper shows that (the DPC enforcing algorithm of Dechter and Pearl) decides the constraint satisfaction problem (CSP) of a constraint language if it is complete and has the variable elimination property (VEP). However, we also show that no complete VEP constraint language can have a domain with more than two values. We then present a simple variant of the algorithm, called, and show that the CSP of a constraint language can be decided by if it is closed under a majority operation. In fact, is sufficient for guaranteeing backtrack-free search for such constraint networks. Examples of majority-closed constraint classes include the classes of connected row-convex constraints and tree-preserving constraints, which have found applications in various domains, such as scene labeling, temporal reasoning, geometric reasoning and logical filtering. Our experimental evaluations show that significantly outperforms the state- of-the-art algorithms for solving majority-closed constraints. |
| Keyword | path-consistency directional path-consistency constraint networks |
| DOI | 10.1093/comjnl/bxx122 |
| Language | 英语 |
| Funding Project | NSFC[11671244] ; European-funded H2020 project MoveCare[732158] |
| WOS Research Area | Computer Science |
| WOS Subject | Computer Science, Hardware & Architecture ; Computer Science, Information Systems ; Computer Science, Software Engineering ; Computer Science, Theory & Methods |
| WOS ID | WOS:000443557300007 |
| Publisher | OXFORD UNIV PRESS |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/31192 |
| Collection | 中国科学院数学与系统科学研究院 |
| Corresponding Author | Kong, Shufeng |
| Affiliation | 1.Univ Technol Sydney, FELT, QSI, 81 Broadway, Ultimo, NSW 2007, Australia 2.Chinese Acad Sci, UTS AMSS Joint Res Lab, AMSS, 55 East Zhongguancun Rd, Beijing 100190, Peoples R China 3.Orebro Univ, AASS, Fak Gatan 1, S-70281 Orebro, Sweden |
| Recommended Citation GB/T 7714 | Kong, Shufeng,Li, Sanjiang,Sioutis, Michael. Exploring Directional Path-Consistency for Solving Constraint Networks[J]. COMPUTER JOURNAL,2018,61(9):1338-1350. |
| APA | Kong, Shufeng,Li, Sanjiang,&Sioutis, Michael.(2018).Exploring Directional Path-Consistency for Solving Constraint Networks.COMPUTER JOURNAL,61(9),1338-1350. |
| MLA | Kong, Shufeng,et al."Exploring Directional Path-Consistency for Solving Constraint Networks".COMPUTER JOURNAL 61.9(2018):1338-1350. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment