Results 261 to 270 of about 6,708,930 (288)

On the design of constraint satisfaction problems

1994
The development of a system based on constraint programming includes two main phases: first, the problem to be solved is formulated as a constraint satisfaction problem; then, the formulation is implemented in a constraint-programming language. Constraint-programming research has mainly concentrated on the second phase, by studying powerful declarative
openaire   +2 more sources

Constraint satisfaction: the approximability of minimization problems

Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 2002
This paper continues the work initiated by N. Creignou (1995) and S. Khanna et al. (1997) who classify maximization problems derived from Boolean constraint satisfaction. We study the approximability of minimization problems derived thence. A problem in this framework is characterized by a collection F of "constraints" (i.e., functions f: {0,1}/sup k ...
Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan 0001   +2 more
openaire   +2 more sources

Constraint relaxation in distributed constraint satisfaction problems

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
The distributed constraint satisfaction problem (DCSP) formulation has recently been identified as a general framework for formalizing various distributed artifical intelligence problems. The author extends the DCSP formalization by introducing the notion of importance values of constraints.
openaire   +1 more source

SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS

International Journal on Artificial Intelligence Tools, 1994
Abundant literatures exist on consistency techniques for solving Constraint Satisfaction Problems (CSPs). These literatures, however, focused mainly on finding efficient general techniques to achieve network consistency and to solve CSPs. So far, many techniques have been reported, e.g., node consistency, arc consistency, path consistency, k ...
openaire   +1 more source

THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA

The Bulletin of Symbolic Logic, 2015
AbstractThis paper gives a brief survey of current research on the complexity of the constraint satisfaction problem over fixed constraint languages.
openaire   +1 more source

The complexity of the counting constraint satisfaction problem

Journal of the ACM, 2013
Andrei Bulatov
exaly  

The Community Structure of the Constraint Satisfaction Problem Instances of Model RB

Journal of Computational and Theoretical Nanoscience, 2015
Ruizhi Li, Shuli Hu, Jianan Wang
exaly  

The partial constraint satisfaction problem: Facets and lifting theorems

Operations Research Letters, 1998
Arie Koster
exaly  

Towards a dichotomy theorem for the counting constraint satisfaction problem

Information and Computation, 2007
Víctor Dalmau
exaly  

An Effective Dichotomy for the Counting Constraint Satisfaction Problem

SIAM Journal on Computing, 2013
Martin Dyer, David Richerby
exaly