Minimal contraction of preference relations
AAAI(2008)
摘要
Changing preferences is very common in real life. The expressive power of the operations of preference change introduced so far in the literature is limited to adding new information about preference and equivalence. Here, we discuss the operation of discarding preferences: preference contraction. We argue that the property of minimality and the preservation of strict partial orders are crucial for contractions. Contractions can be further constrained by specifying which preferences should not be contracted. We provide algorithms for computing minimal and minimal preference-protecting contraction. We also show some preference query optimization techniques which can be used in the presence of contraction.
更多查看译文
关键词
preference contraction,preference change,real life,minimal contraction,discarding preference,preference relation,strict partial order,new information,expressive power,preference query optimization technique,minimal preference-protecting contraction,query optimization,knowledge engineering,partial order,knowledge representation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络