TY - GEN
T1 - The Next Best Solution
AU - Brafman, R.
AU - Pilotto, E.
AU - Rossi, F.
AU - Salvagnin, D.
AU - Venable, K. B.
AU - Walsh, T.
N1 - Publisher Copyright:
Copyright © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2011/8/11
Y1 - 2011/8/11
N2 - We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and tree-shaped fuzzy CSPs. On the other hand, it is intractable for weighted CSPs, even under restrictions on the constraint graph. For CP-nets, the problem is polynomial when the CP-net is acyclic. This remains so if we add (soft) constraints that are tree-shaped and topologically compatible with the CP-net.
AB - We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and tree-shaped fuzzy CSPs. On the other hand, it is intractable for weighted CSPs, even under restrictions on the constraint graph. For CP-nets, the problem is polynomial when the CP-net is acyclic. This remains so if we add (soft) constraints that are tree-shaped and topologically compatible with the CP-net.
UR - https://www.scopus.com/pages/publications/84890071643
M3 - Conference contribution
AN - SCOPUS:84890071643
T3 - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
SP - 1537
EP - 1540
BT - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
PB - AAAI press
T2 - 25th AAAI Conference on Artificial Intelligence, AAAI 2011
Y2 - 7 August 2011 through 11 August 2011
ER -