J4 ›› 2010, Vol. 48 ›› Issue (03): 444-448.

• 计算机科学 • 上一篇    下一篇

无 环 配 置 问 题 研 究

王红梅1,2, 李宏博2, 李占山2   

  1. 1. 长春工业大学 计算机科学与工程学院, 长春 130012; 2. 吉林大学 计算机科学与技术学院, 长春 130012
  • 收稿日期:2009-12-11 出版日期:2010-05-26 发布日期:2010-05-19
  • 通讯作者: 李占山 E-mail:zslizsli@163.com

On Acycle Configuration Problems

WANG Hongmei1,2, LI Hongbo2, LI Zhanshan2   

  1. 1. School of Computer Science and Engineering, Changchun University of Technology, Changchun 130012, China;2. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2009-12-11 Online:2010-05-26 Published:2010-05-19
  • Contact: LI Zhanshan E-mail:zslizsli@163.com

摘要:

基于约束的配置问题提出一种无回溯搜索算法, 通过弧相容技术将所有不相容的值删除, 指导用户进行产品配置, 并对其正确性进行了证明. 探讨了将目前两种主流计算冲突解释方法应用到无环配置问题的可行性.

关键词: 约束满足问题, 配置问题, 模型正确性, 弧相容, 解释

Abstract:

In view of constraintbased configuration problems  solved by the classic algorithms which are used to solve constraint satisfaction problems, the authors proposed the notion of model correctness, then analysed the properties of acycle configuration, gave a backtrackfree search algorithm for solving configurations, used the arc consistency technologies to delete the redundant values from the domains of related variables so as to guide the users to configure products, and proved the correctness of the algorithm. Finally, the  two popular algorithms to compute the explanations were applied to acycle configurations.

Key words: constraint satisfaction problem, configuration problem, model correctness, arc consistency, explanation

中图分类号: 

  • TP18