Solving fuzzy constraint satisfaction problems
Solving fuzzy constraint satisfaction problems
复制标题
解决模糊约束满足问题
DOI：
10.1109/fuzzy.1997.619464
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
J. Larrosa
中科院分区：
文献类型：
--
作者：
Pedro Meseguer;J. Larrosa
迄今为止，大多数关于约束满足的研究都考虑了明确的约束。目前正在考虑新类型的约束，允许完全满意和完全违反之间的中间满意度。在模糊环境中对这些新的约束类型进行建模，产生了一种新的问题，称为模糊约束满足。我们提出了一种算法来解决这个问题，使用分支定界算法和重用现有的技术开发的比赛中明确的约束。实证结果表明，我们的方法的可行性，并确认以前使用的技术的模糊情况下的适用性。
Up to date, most of the research on constraint satisfaction has considered crisp constraints. Currently new types of constraints are being considered, allowing for intermediate satisfaction degrees between complete satisfaction and complete violation. Modeling these new constraint types in a fuzzy environment, generates a new kind of problem denominated fuzzy constraint satisfaction. We present an algorithmic approach to solve this problem, using the branch-and-bound algorithm and reusing existing techniques developed in the contest of crisp constraints. Empirical results show the feasibility of our approach and confirm the applicability of previously used techniques to the fuzzy case.