Computer Science – Artificial Intelligence
Scientific paper
2009-03-10
Computer Science
Artificial Intelligence
44 pages, 15 figures, submitted to the Special Issue of AIJ on Preferences
Scientific paper
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 two classes of preference relations: finite and finitely representable. 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 also introduce some preference query optimization techniques which can be used in the presence of contraction. We evaluate the proposed algorithms experimentally and present the results.
Chomicki Jan
Mindolin Denis
No associations
LandOfFree
Contracting preference relations for database applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Contracting preference relations for database applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Contracting preference relations for database applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-123301