2000
DOI: 10.1007/3-540-45349-0_44
|View full text |Cite
|
Sign up to set email alerts
|

On Dual Encodings for Non-binary Constraint Satisfaction Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2000
2000
2003
2003

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…By extending the algorithm for Dual arc consistency given earlier we can get an algorithm for enforcing -consistency. In (Nagarajan et al 2000) this was generalised to generalised dual arc consistency.…”
Section: Generalised Dual Arc Consistencymentioning
confidence: 99%
See 1 more Smart Citation
“…By extending the algorithm for Dual arc consistency given earlier we can get an algorithm for enforcing -consistency. In (Nagarajan et al 2000) this was generalised to generalised dual arc consistency.…”
Section: Generalised Dual Arc Consistencymentioning
confidence: 99%
“…In some cases the space complexity of the dual encodings is prohibitive and this is sometimes a drawback when trying to use these encodings. More recently (Nagarajan et al 2000) modifications to the standard dual encoding have been proposed that can compactly represent the given CSP using an equivalent dual encoding that contains all the original solutions to the CSP, using constraint coverings. It has also been shown that enforcing arc consistency in these constraint covering based encodings, strictly dominates enforcement of GAC on the primal nonbinary encoding.…”
Section: Introductionmentioning
confidence: 99%