摘要
产品配置器技术是人工智能领域近十几年来发展起来的一个新的研究方向 ,而约束编程、约束满足问题等也是近三十年才发展起来的。本文介绍了产品配置器核心算法的最新发展 。
Product configurators is a new research direction in domain of AI,and constraint programming,constraint satisfaction problem is deve￣loped in recent thirty years.In this paper,the latest development of the nucleus arithmetic with product configurators is introduced,and furthermore,the contribution of the constraint programming in this domain and the developmental trend of combine with product configurators is also discussed in this paper.
出处
《计算机应用与软件》
CSCD
北大核心
2004年第3期36-37,90,共3页
Computer Applications and Software
关键词
人工智能
约束编程
产品配置器
编程语言
约束满足
AI Product configurators Constraint programming Constraint satisfaction problem
