Minimal contraction of preference relations

Authors:
Denis Mindolin;Jan Chomicki
Affiliations:
Dept. of Computer Science and Engineering, University at Buffalo, Buffalo, NY;Dept. of Computer Science and Engineering, University at Buffalo, Buffalo, NY
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 7
Cited 2

Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
On the revision of preferences and rational inference processes

Artificial Intelligence
Optimization of relational preference queries

ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Exploiting Indifference for Customization of Partial Order Skylines

IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Semantic optimization techniques for preference queries

Information Systems
Database querying under changing preferences

Annals of Mathematics and Artificial Intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research

Contracting preference relations for database applications

Artificial Intelligence
A survey on representation, composition and application of preferences in database systems

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.