偏好关系的表示和收缩  

Representation and Contraction of Preference Relations

作　　者：黄鑫[1] 李长云[1] 金可音[1] 

机构地区：[1]湖南工业大学计算机与通信学院,株洲412008

出　　处：《计算机工程》2010年第13期164-166,共3页Computer Engineering

基　　金：国家自然科学基金资助项目"开放环境下的软件动态演化研究"(60773110);中国博士后科学基金资助项目"面向可信的软件动态演化机制研究"(20080440216)

摘　　要：针对偏好经常会改变的问题,提出偏好的舍弃操作——偏好收缩,而对于偏好收缩来说,偏好收缩的最小化和保持严格偏序性是很重要的。给出可用于表示有限和无限偏好关系的框架,并针对偏好的收缩问题提出算法,计算偏好关系对基本收缩的全收缩,使收缩后的偏好满足严格偏序,对全收缩进行最小化,得到修正后的偏好全收缩。仿真结果表明,修正后的全收缩小于修正前的全收缩。Aiming at the problem that changing preferences is very common,this paper proposes the operation of discarding preferences—— preference contraction.The property of minimality and the preservation of strict partial orders are crucial for contractions.It presents framework which can deal with finite as well as infinite preference relations.It gives algorithms for computing contractions for preference relations.It computes full contractor of a preference relation by base contractors to preserve strict partial orders in the modified preference relation.It minimizes the full contractor,and obtains the modified full contractor.Simulation results show that the size of full contractor after revision is obvious smaller than before.

关 键 词：偏好 偏好收缩 偏好改变 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]