中文摘要：

应用偏好进行服务选择是Web领域的重要研究方向.在偏好研究中,偏好信息的获得是一个复杂的过程,特别是获取的过程涉及到普通的非专家用户.获取的偏好经常会遇到偏好不完整、偏好冲突的问题,在实际应用中带来很多的问题.文中以条件偏好表示工具CP-net建模用户的偏好,总结了CP-net中出现的不确定性,定义了偏好不完整、偏好冲突.提出了CP-net对应的结果集合上的最优关系与弱化的最优关系.通过CP-net与对应最优关系的分析,提出了CP-net交运算.在此基础上,提出了解决CP-net中不确定问题的方法,并对这个方法进行了优化.最后的实验证明了文中所提出方法的正确性和有效性.

英文摘要：

Web service selection with the preference is a hot spot in the area of Web service. Preference eliciation is a complex task, especially elicitation involving non-expert users. Prefer- ences acquired often encounter such problems that preferences are incomplete or inconsistent. It causes a lot of problems in the practical applications. In this paper, based on a graphical represen- tation tool CP-net, we sum up the problem about uncertain in CP-net. We define the optimal rela- tion and weak optimal relation on the outcome corresponding to CP-net. By analysis, we propose intersection and complement operator on CP-net. Bases on the above, we propose a method to solve the uncertain problem, and optimal this method. The final experiments demonstrate the effectiveness of our method.