Dual Models of Permutation Problems

Authors:
Barbara M. Smith
Affiliations:
-
Venue:
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Year:
2001

Citing 3
Cited 6

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Permutation Problems and Channelling Constraints

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming

Model induction: a new source of CSP model redundancy

Eighteenth national conference on Artificial intelligence
Compiling problem specification into SAT

Artificial Intelligence - Special volume on reformulation
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems

Constraints
Compiling problem specifications into SAT

Artificial Intelligence - Special volume on reformulation
Redundant modeling in permutation weighted constraint satisfaction problems

Constraints
Detecting and breaking symmetries by reasoning on problem specifications

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A constraint satisfaction problem is a permutation problem if it has the same number of values as variables, all variables have the same domain and any solution assigns a permutation of the values to the variables. The dual CSP interchanges the variables and values; the effects of combining both sets of variables in a single CSP are discussed.