Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to algorithms
Database Management Systems
Proceedings of the 17th International Conference on Data Engineering
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
On the revision of preferences and rational inference processes
Artificial Intelligence
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Exploiting Indifference for Customization of Partial Order Skylines
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Database querying under changing preferences
Annals of Mathematics and Artificial Intelligence
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Evaluating critiquing-based recommender agents
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Minimal contraction of preference relations
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Eliciting matters: controlling skyline sizes by incremental integration of user preferences
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Applications of ordinal ranks to flexible query answering
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Learning conditional preference network from noisy samples using hypothesis testing
Knowledge-Based Systems
| Hi-index | 0.00 |
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. 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 be protected. We consider preference relations that are finite or finitely representable using preference formulas. We present algorithms for computing minimal and preference-protecting minimal contractions for finite as well as finitely representable preference relations. We study relationships between preference change in the binary relation framework and belief change in the belief revision theory. We evaluate the proposed algorithms experimentally and present the results.