Results 1  10
of
572
A filtering algorithm for constraints of difference in CSPs
 Proceedings of AAAI’94, the 12th (US) National Conference on Artificial Intelligence
, 1994
"... Abstract Many reallife Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple are ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
are all different. In this paper, a new filtering algorithm for these constraints is presented. It achieves the generalized arcconsistency condition for these nonbinary constraints. It is based on matching theory and its complexity is low. In fact, for a constraint defined on a subset of p variables
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 31 (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
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.
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 78 (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
On the conversion between nonbinary and binary constraint satisfaction problems
, 1998
"... It is well known that any nonbinary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph translation and the hidden variable translation. However, there has been little theoretical or experimental work on how well ..."
Abstract

Cited by 90 (4 self)
 Add to MetaCart
It is well known that any nonbinary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph translation and the hidden variable translation. However, there has been little theoretical or experimental work on how
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 7 (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
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
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
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 47 (10 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 nonbinary temporal relations
 In Proc. of ECAI98
, 1998
"... I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other nonbina ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other nonbinary
Results 1  10
of
572