Computer Science – Artificial Intelligence
Scientific paper
2011-06-30
Journal Of Artificial Intelligence Research, Volume 22, pages 1-22, 2004
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.1400
Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates some measure of desirability with each possible combination of values for those variables. However, the crucial question of the computational complexity of finding the optimal solution to a collection of soft constraints has so far received very little attention. In this paper we identify a class of soft binary constraints for which the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly-occurring soft constraints, such as 'as near as possible' or 'as soon as possible after', as well as crisp constraints such as 'greater than'. Finally, we show that this tractable class is maximal, in the sense that adding any other form of soft binary constraint which is not in the class gives rise to a class of problems which is NP-hard.
Cohen Doron
Cooper Martin
Jeavons P.
Krokhin Andrei
No associations
LandOfFree
A Maximal Tractable Class of Soft Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Maximal Tractable Class of Soft Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Maximal Tractable Class of Soft Constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-480008