Redundant disequalities in the Latin Square problem

Authors:
Bart Demoen;Maria Garcia De La Banda
Affiliations:
KU Leuven, Department of Computer Science, Leuven, Belgium;Faculty of Information Technology, Monash University, VIC, Australia 3145
Venue:
Constraints
Year:
2013

Citing 4
Cited 0

Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Generalised arc consistency for the AllDifferent constraint: An empirical survey

Artificial Intelligence
Learning implied global constraints

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The language features and architecture of b-prolog

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the redundancy properties of the constraints used when formulating the well known Latin Square problem. This problem is often formulated using either (N驴驴驴1)*N 2 binary disequalities or 2*N all_different global constraints. Both formulations contain redundant constraints. A complete classification of all redundant sets of constraints, be they binary or global, is performed for any N.