Constrained CP-nets

Cited by: 22|Views3

Abstract:

We present a novel approach to deal with preferences expressed as a mixture of hard constraints, soft constraints, and CP nets. We construct a set of hard constraints whose solutions are the optimal solutions of the set of pref- erences. This allows us to avoid dominance testing (is one outcome better than another?) which is a very expens...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments