Results 281 to 290 of about 15,021 (304)

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

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

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

On the Descriptive Complexity of Temporal Constraint Satisfaction Problems

Journal of the ACM, 2023
Manuel Bodirsky, Jakub Rydval
exaly  

Sharp thresholds for constraint satisfaction problems and homomorphisms

Random Structures and Algorithms, 2008
Hamed Hatami, Michael Molloy
exaly  

Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems

Computational Intelligence, 1985
Alan K Mackworth, William S Havens
exaly