Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations...

intelligence and operations research, constraint satisfaction is the process of finding a solution through a set of constraints that impose conditions that the...

Constraint Satisfaction Problem (WCSP), also known as Valued Constraint Satisfaction Problem (VCSP), is a generalization of a constraint satisfaction...

classes of constraint satisfaction problems on finite domains. Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general...

dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only...

In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary...

Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer...

The constrained-optimization problem (COP) is a significant generalization of the classic constraint-satisfaction problem (CSP) model. COP is a CSP that...

algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions...

operations research, hierarchical constraint satisfaction (HCS) is a method of handling constraint satisfaction problems where the variables have large domains...

intelligence and operations research for constraint satisfaction a hybrid algorithm solves a constraint satisfaction problem by the combination of two different...

expression of an important class of constraint satisfaction problems, such as certain scheduling or frequency assignment problems. The fact that homomorphisms...

transformation reformulates a constraint satisfaction problem in such a way all constraints have at most two variables. The new problem is satisfiable if and...

natural language for the constraint satisfaction problem (CSP). CSP refers to an important class of computational problems where, given a relational...

of constraints over the variables is minimized. Distributed Constraint Satisfaction is a framework for describing a problem in terms of constraints that...

algorithm is a search algorithm or heuristic method to solve constraint satisfaction problems. One such algorithm is min-conflicts hill-climbing. Given an...

hypergraphs are used to represent relations among constraints in a constraint satisfaction problem. A constraint graph is a special case of a factor graph, which...

In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables...

is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSPs). It was developed by Alan Mackworth in 1977. The...

weighted constraint satisfaction problem. Developed and introduced by Satish Kumar Thittamaranahalli (T. K. Satish Kumar), the idea of the constraint composite...

{\displaystyle {\mathcal {S}}} . The exact cover problem to find an exact cover is a kind of constraint satisfaction problem. The elements of S {\displaystyle {\mathcal...

computer science Constraint satisfaction problem Loading gauge, a constraint in engineering Optimality theory, in linguistics, a constraint-based theory which...

benchmark in the evaluation of computer algorithms for solving constraint satisfaction problems. The following version of the puzzle appeared in Life International...

the modeling of constraint satisfaction problems, to extend the expressivity of constraint languages, and also to improve the constraint resolution: indeed...

include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example...

minimum satisfiability problem. The MAX-SAT problem can be extended to the case where the variables of the constraint satisfaction problem belong to the set...

intervals. Interval propagation considers an estimation problem as a constraint satisfaction problem. A contractor associated to an equation involving the...

second-order logic, constraint satisfaction problems, 0-1 integer programming. While SAT is a decision problem, the search problem of finding a satisfying...

processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a...

polynomial-time approximation. The problems for which such an inapproximability result would hold include constraint satisfaction problems, which crop up in a wide...