Add to ORKGMany computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this survey paper we discuss an algebraic approach that has proved to be very successful in studying the complexity of constraint problems
. Some constraint languages are more powerful than others because they allow us to express a larger ...
A constraint satisfaction problem (CSP) requires a value, selected from a given finite domain, to be...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Most previous theoretical study of the complexity of the constraint satisfaction problem has conside...
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem h...
A large class of problems in AI and other areas of computer science can be viewed as constraint-sati...
During the past two decades, an impressive array of diverse methods from several different mathemati...
The Constraint Satisfaction Problem (CSP) and a number of problems related to it have seen major adv...
During the past two decades, an impressive array of diverse methods from several different mathemati...
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming prob...
A constraint satisfaction problem requires a value, selected from a given finite domain, to be assig...
. Some constraint languages are more powerful than others because they allow us to express a larger ...
A constraint satisfaction problem (CSP) requires a value, selected from a given finite domain, to be...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Most previous theoretical study of the complexity of the constraint satisfaction problem has conside...
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem h...
A large class of problems in AI and other areas of computer science can be viewed as constraint-sati...
During the past two decades, an impressive array of diverse methods from several different mathemati...
The Constraint Satisfaction Problem (CSP) and a number of problems related to it have seen major adv...
During the past two decades, an impressive array of diverse methods from several different mathemati...
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming prob...
A constraint satisfaction problem requires a value, selected from a given finite domain, to be assig...
. Some constraint languages are more powerful than others because they allow us to express a larger ...
A constraint satisfaction problem (CSP) requires a value, selected from a given finite domain, to be...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...