Login / Signup
The computational complexity of dominance and consistency in CP-nets.
Judy Goldsmith
Jérôme Lang
Miroslaw Truszczynski
Nic Wilson
Published in:
IJCAI (2005)
Keyphrases
</>
cp nets
computational complexity
multi attribute
preference elicitation
multiple agents
graphical representation
proof theory
np complete
decision problems
preference relations
soft constraints
special case
multi dimensional
preference ordering
worst case
np hard
search algorithm
state space
multi objective