Results 1  10
of
4,267
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
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
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
POLYSA: A Polynomial Algorithm for Nonbinary Constraint Satisfaction Problems
 In Proceeding of EPIA workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving (CSOR01) (2001
, 2001
"... Nowadays, many real problems can be naturally modelled as Constraint Satisfaction Problems (CSPs). It is well known that any nonbinary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in problems with c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Nowadays, many real problems can be naturally modelled as Constraint Satisfaction Problems (CSPs). It is well known that any nonbinary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in problems
STRONG DOMAIN FILTERING CONSISTENCIES FOR NONBINARY CONSTRAINT SATISFACTION PROBLEMS
"... Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with nonbinary const ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with nonbinary
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
Using Auxiliary Variables and Implied Constraints to Model NonBinary Problems
, 2000
"... We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of nonbinary constraint satisfaction problems called problems of distance. This class of problems include 1d, 2d and circular Golomb rulers. We identify a larg ..."
Abstract

Cited by 36 (14 self)
 Add to MetaCart
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of nonbinary constraint satisfaction problems called problems of distance. This class of problems include 1d, 2d and circular Golomb rulers. We identify a
MAS: An Online Nonbinary CSP Solver
"... Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be online nonbinary constraints that traditional CSP solver can not manage directly. It is well known that any nonbinary CSP can be transformed into an equivalent bina ..."
Abstract
 Add to MetaCart
Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be online nonbinary constraints that traditional CSP solver can not manage directly. It is well known that any nonbinary CSP can be transformed into an equivalent
Domain filtering consistencies for nonbinary constraints
 ARTIFICIAL INTELLIGENCE
, 2008
"... In nonbinary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering ..."
Abstract

Cited by 27 (11 self)
 Add to MetaCart
In nonbinary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain
A Generator for Random NonBinary Finite Constraint Satisfaction Problems
, 2002
"... The paper describes an implementation of a generator of random instances of nonbinary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in [1]. 1 Description The program is designed to generate random instances of Constraint Sa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper describes an implementation of a generator of random instances of nonbinary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in [1]. 1 Description The program is designed to generate random instances of Constraint
Results 1  10
of
4,267