Results 1  10
of
55,221
Algorithms for ConstraintSatisfaction Problems: A Survey
, 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraintsatisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract

Cited by 449 (0 self)
 Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraintsatisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments
Dualities for constraint satisfaction problems
"... In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the nonexistence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfact ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the nonexistence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint
Hybrid Algorithms for the Constraint Satisfaction Problem
 Computational Intelligence
, 1993
"... problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflictdirected backjumping ..."
Abstract

Cited by 380 (8 self)
 Add to MetaCart
problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflictdirected backjumping
Constraint Satisfaction Problems
, 1997
"... In this section we discuss solving constraint satisfaction problems with evolutionary algorithms. We set up a formal framework by defining the notions free optimization problem, constrained optimization problem and constraint satisfaction problem. We note that constraint satisfaction problems (CSPs) ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
In this section we discuss solving constraint satisfaction problems with evolutionary algorithms. We set up a formal framework by defining the notions free optimization problem, constrained optimization problem and constraint satisfaction problem. We note that constraint satisfaction problems (CSPs
On the Equivalence of Constraint Satisfaction Problems
 In Proceedings of the 9th European Conference on Artificial Intelligence
, 1990
"... A solution of a Constraint Satisfaction Problem (CSP) is an assignment of values to all its variables such that all its constraints are satisfied. Usually two CSPs are considered equivalent if they have the same solution set. We find this definition limiting, and develop a more general definition ba ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
A solution of a Constraint Satisfaction Problem (CSP) is an assignment of values to all its variables such that all its constraints are satisfied. Usually two CSPs are considered equivalent if they have the same solution set. We find this definition limiting, and develop a more general definition
Valued constraint satisfaction problems: Hard and easy problems
 IJCAI’95: PROCEEDINGS INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1995
"... In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violat ..."
Abstract

Cited by 331 (42 self)
 Add to MetaCart
In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
 IEEE Transactions on Knowledge and Data Engineering
, 1998
"... In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various applica ..."
Abstract

Cited by 326 (27 self)
 Add to MetaCart
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various
Full Constraint Satisfaction Problems
"... Feder and Vardi have conjectured that all constraint satisfaction problems to a fixed structure(constraint language) are polynomial or NPcomplete. This socalled Dichotomy Conjecture remains open, although it has been proved in a number of special cases. Most recently, Bulatovhas verified the conje ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Feder and Vardi have conjectured that all constraint satisfaction problems to a fixed structure(constraint language) are polynomial or NPcomplete. This socalled Dichotomy Conjecture remains open, although it has been proved in a number of special cases. Most recently, Bulatovhas verified
Amalgams of constraint satisfaction problems
 In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003
, 2003
"... Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We study a general method of decomposing constraint satisfaction problems in which every constraint is represented as a disjunc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We study a general method of decomposing constraint satisfaction problems in which every constraint is represented as a
GENERALIZED CONSTRAINT SATISFACTION PROBLEMS
, 2006
"... Abstract. A number of recent authors have given exponentialtime algorithms for optimization problems such as Max Cut and Max Independent Set, or for the more general class of Constraint Satisfaction Problems (CSPs). In this paper, we introduce the class of Generalized Constraint Satisfaction Proble ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. A number of recent authors have given exponentialtime algorithms for optimization problems such as Max Cut and Max Independent Set, or for the more general class of Constraint Satisfaction Problems (CSPs). In this paper, we introduce the class of Generalized Constraint Satisfaction
Results 1  10
of
55,221