Exploring Directional Path-Consistency for Solving Constraint Networks

doi:10.1093/comjnl/bxx122

CSpace

	Exploring Directional Path-Consistency for Solving Constraint Networks
	Kong, Shufeng 1; Li, Sanjiang 1,2; Sioutis, Michael 3
	2018-09-01
发表期刊	COMPUTER JOURNAL
ISSN	0010-4620
卷号	61 期号:9 页码:1338-1350
摘要	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.
关键词	path-consistency directional path-consistency constraint networks
DOI	10.1093/comjnl/bxx122
语种	英语
资助项目	NSFC[11671244] ; European-funded H2020 project MoveCare[732158]
WOS研究方向	Computer Science
WOS类目	Computer Science, Hardware & Architecture ; Computer Science, Information Systems ; Computer Science, Software Engineering ; Computer Science, Theory & Methods
WOS记录号	WOS:000443557300007
出版者	OXFORD UNIV PRESS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/31192
专题	中国科学院数学与系统科学研究院
通讯作者	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.