Results 1  10
of
319,851
Distributed Nonbinary Constraints
"... Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied ..."
Abstract
 Add to MetaCart
be satisfied. Although the problem constraints can be divided into two groups, the order in which these constraints are studied can improve e#ciency, particulary in problems with nonbinary constraints.
Inverse Consistencies for Nonbinary Constraints
, 2006
"... We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose algorith ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose
Inverse Consistencies for Nonbinary Constraints
"... Abstract. We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose ..."
Abstract
 Add to MetaCart
Abstract. We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose
Binary vs. nonbinary constraints
 Artificial Intelligence
, 2002
"... Fellowship program. 1 There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of the ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Fellowship program. 1 There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison
Representation and Reasoning with NonBinary Constraints
, 2001
"... Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important in constrai ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important
Encodings of NonBinary Constraint Satisfaction Problems
, 1999
"... We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. ..."
Abstract

Cited by 46 (9 self)
 Add to MetaCart
We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations
On Forward Checking for Nonbinary Constraint Satisfaction
 ARTIFICIAL INTELLIGENCE
, 1999
"... Solving nonbinary constraint satisfaction problems, a crucial challenge for the next years, can be tackled in two different ways: translating the nonbinary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option rai ..."
Abstract

Cited by 79 (5 self)
 Add to MetaCart
Solving nonbinary constraint satisfaction problems, a crucial challenge for the next years, can be tackled in two different ways: translating the nonbinary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option
Lower Bounds for Nonbinary Constraint Optimization Problems
, 2001
"... The necessity of nonbinary constraint satisfaction algorithms is increasing because many real problems are inherently nonbinary. Considering overconstrained problems (and Partial Forward Checking as the solving algorithm), we analyze several lower bounds proposed in the binary case, extending ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The necessity of nonbinary constraint satisfaction algorithms is increasing because many real problems are inherently nonbinary. Considering overconstrained problems (and Partial Forward Checking as the solving algorithm), we analyze several lower bounds proposed in the binary case, extending
Extending GENET for NonBinary Constraint Satisfaction Problems
, 1995
"... GENET has been shown to be efficient and effective on certain hard or large constraint satisfaction problems. Although GENET has been enhanced to handle also the atmost and illegal constraints in addition to binary constraints, it is deficient in handling nonbinary constraints in general. In this p ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
GENET has been shown to be efficient and effective on certain hard or large constraint satisfaction problems. Although GENET has been enhanced to handle also the atmost and illegal constraints in addition to binary constraints, it is deficient in handling nonbinary constraints in general
Encodings of NonBinary Constraint Satisfaction Problems
"... We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. This ..."
Abstract
 Add to MetaCart
We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations
Results 1  10
of
319,851