摘要
约束编程与约束满足问题是近三十年来在人工智能领域发展起来的一个研究方向。产品配置器是近十几年来发展起来的一项技术。文中介绍约束编程及约束满足问题在按订单装配型产品配置器中的应用,并通过讨论说明了相对于传统配置方案求解过程,应用约束满足的优越性。
Constraint Programming and Constraint satisfaction problem is new research domain in AI developed in last thirty years. Product configurators is a technique in recent decade. In this paper,the latest application of CP and CS for for Assemble to order configurators is introduced. And furthermore,compared with the traditional solution of configuration,the strongpoint of method which apply CSP is expatiated.
出处
《计算机应用》
CSCD
北大核心
2003年第1期60-62,共3页
journal of Computer Applications