Contracting Preference Relations for Database Applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here the authors study preference contraction: the problem of discarding selected preferences. They 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. The authors consider preference relations that are finite or finitely representable using preference formulas. They present algorithms for computing minimal and preference-protecting minimal contractions for finite as well as finitely representable preference relations.