Computer Science – Databases
Scientific paper
2005-03-31
Computer Science
Databases
Scientific paper
We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which preferences are represented using binary relations (not necessarily finite). We identify several classes of revisions that preserve order axioms, for example the axioms of strict partial or weak orders. We consider applications of our results to preference querying in relational databases.
Chomicki Jan
Song Joyce
No associations
LandOfFree
Monotonic and Nonmonotonic Preference Revision 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 Monotonic and Nonmonotonic Preference Revision, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monotonic and Nonmonotonic Preference Revision will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-720947