Results 281 to 290 of about 15,438 (311)

Full Constraint Satisfaction Problems

SIAM Journal on Computing, 2006
Feder and Vardi have conjectured that all constraint satisfaction problems to a fixed structure (constraint language) are polynomial or NP-complete. This so-called dichotomy conjecture remains open, although it has been proved in a number of special cases.
Tomás Feder, Pavol Hell
openaire   +1 more source

Belief Constraint Satisfaction Problems

2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA), 2015
Every problem that can be described by a set of variables and a set of constraints among those variables can easily be cast as a Constraint Satisfaction Problem (CSP). In spite of its simplicity, the standard CSP has proven unsuited for modeling ill-defined decision problems, especially, under uncertain circumstances.
Aouatef Rouahi, Kais Ben Salah, Khaled Ghédira   +2 more
openaire   +1 more source

Constraint satisfaction problems

ACM SIGLOG News, 2018
In this paper we briefly survey the history of the Dichotomy Conjecture for the Constraint Satisfaction problem, that was posed 25 years ago by Feder and Vardi. We outline some of the approaches to this conjecture, and then describe an algorithm that yields an answer to the conjecture.
openaire   +1 more source

An Algorithm for Constraint Satisfaction Problem

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), 2017
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on theform of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint ...
openaire   +1 more source

Constraint Satisfaction Technology for Stacking Problem with Ordered Constraints

Procedia Engineering, 2012
The stacking problem with ordered constraints (SPOC) is a typical combinatorial optimization problem and NP-hard character. In order to simplify problem, it is treated as a constraint satisfaction problem. A constraint satisfaction model is given.
Dong-liang Hou, Fang-rong Chen, Hou, Dong-liang, Chen, Fang-rong   +3 more
exaly   +2 more sources

Constraint Satisfaction Differential Problems

2003
System dynamics is often modeled by means of parametric differential equations. Despite their expressive power, they are difficult to reason about and make safe decisions, given their non-linearity and the important effects that the uncertainty on data may cause.
Jorge Cruz 0001, Pedro Barahona
openaire   +1 more source

Constraint Satisfaction Problems: An Overview

AI Communications, 1989
Many AI problems can be formulated as Constraint Satisfaction Problems (CSP). Using a systematic search process with backtracking this kind of problems can be solved, but this method is very inefficient. Other methods solving CSP have been developed showing a better performance.
openaire   +1 more source

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   +1 more source

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

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