, Volume 12, Issue 4-5, pp 263-285

Hard and soft constraints for reasoning about qualitative conditional preferences

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP-nets model. In particular, we show how hard constraints are sufficient to model the optimal outcomes of a possibly cyclic CP-net, and how soft constraints can faithfully approximate the semantics of acyclic conditional preference statements whilst improving the computational efficiency of reasoning about these statements.

This material is based in part upon works supported by the Science Foundation Ireland under Grant No. 00/PI.1/C075