摘要
研究约束求解中的相容性技术,针对目前已有相容性的传播级别,提出一种新的相容性概念——基于序列的子问题相容性(SSAC),并给出相应的实现算法。然后分析其时空、空间复杂性及正确性,证明SSAC化简不改变原约束满足问题的解集,同时证明SSAC的约束传播能力介于SAC和AC之间。通过对随机问题和composed问题的测试表明,所提算法的效率是已有算法SAC-SDS和SAC-3的2~3倍。
In investigation of the consistency techniques,a new consistency concept SSAC was proposed based on the recently propagation levels.The algorithm and properties of SSAC were given successively in the paper.Thereafter we concluded that simplification of SSAC dosen't change the solution set of the original constraint satisfaction problem.Meanwhile the propagation ability of SSAC is between SAC and AC.Experiments results show that the performance of SSAC is 2 or 3times than the existed algorithms.
出处
《计算机科学》
CSCD
北大核心
2015年第7期28-31,37,共5页
Computer Science
基金
国家自然科学基金面上项目:基于自适应约束传播的约束求解方法研究(61170314)
国家自然科学基金面上项目:结合自主搜索机制的约束求解方法研究(61373052)资助
关键词
约束满足
相容性技术
SSAC
Constraint satisfaction
Arc consistency technique
SSAC