A Maximal Tractable Class of Soft Constraints

06/30/2011
by   D. Cohen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2011

Tractable Set Constraints

Many fundamental problems in artificial intelligence, knowledge represen...
research
04/04/2016

Asking the metaquestions in constraint tractability

The constraint satisfaction problem (CSP) involves deciding, given a set...
research
01/16/2014

Soft Constraints of Difference and Equality

In many combinatorial problems one may need to model the diversity or si...
research
11/18/2022

Computational Short Cuts in Infinite Domain Constraint Satisfaction

A backdoor in a finite-domain CSP instance is a set of variables where e...
research
03/30/2018

A Rule for Committee Selection with Soft Diversity Constraints

Committee selection with diversity or distributional constraints is a ub...
research
09/29/2020

Database Repairing with Soft Functional Dependencies

A common interpretation of soft constraints penalizes the database for e...
research
06/07/2017

Imposing Hard Constraints on Deep Networks: Promises and Limitations

Imposing constraints on the output of a Deep Neural Net is one way to im...

Please sign up or login with your details

Forgot password? Click here to reset