中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
Exploring Directional Path-Consistency for Solving Constraint Networks

文献类型：期刊论文

作者Kong, Shufeng1; Li, Sanjiang1,2; Sioutis, Michael3
刊名COMPUTER JOURNAL
出版日期2018-09-01
卷号61期号:9页码:1338-1350
关键词path-consistency directional path-consistency constraint networks
ISSN号0010-4620
DOI10.1093/comjnl/bxx122
英文摘要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.
资助项目NSFC[11671244] ; European-funded H2020 project MoveCare[732158]
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000443557300007
出版者OXFORD UNIV PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/31191]  
专题中国科学院数学与系统科学研究院
通讯作者Kong, Shufeng
作者单位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
推荐引用方式
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.

入库方式： OAI收割

来源：数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。