Contracting preference relations for database applications

  title={Contracting preference relations for database applications},
  author={Denis Mindolin and Jan Chomicki},
  journal={Artif. Intell.},
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… CONTINUE READING

Similar Papers

Loading similar papers…