Revisiting the efficacy of weak consistencies:a study of forward checking  

作　　者：Zhe LI Zhezhou YU Hongbo LI Jinsong GUO Zhanshan LI 

机构地区：[1]Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry,Changchun 130012,China [2]College of Computer Science and Technology,Jilin University,Changchun 130012,China [3]College of Information Science and Technology,Northeast Normal University,Changchun 130024,China [4]Department of Computer Science,University of Oxford,Oxford OX12JD,UK

出　　处：《Science China(Information Sciences)》2021年第7期229-231,共3页中国科学（信息科学）（英文版）

基　　金：This work was supported by National Natural Science Foundation of China(Grant Nos.61672261,61802056);Jilin Province Natural Science Foundation(Grant No.20180101043JC);Jilin Province Development and Reform Commission(Grant No.2019C053-9);Jilin Provincial Key Laboratory of Big Data Intelligent Computing(Grant No.20180622002JC).

摘　　要：Dear editor,Arc consistency(AC)[1]is currently the most popular local consistency for solving constraint satisfaction problems(CSP).To solve CSPs more efficiently,extensive work[2–4]has been done to find local consistencies that perform better than AC.Efforts have primarily been focused on consistencies that are stronger than AC.Even though a stronger consistency is able to eliminate more inconsistent values than AC,enforcing a stronger consistency is more expensive.It is never easy to determine the optimal tradeoff between a consistency’s pruning ability and its propagation cost.

关 键 词：CONSISTENCY stronger eliminate 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]