Skip to main content
Log in

Redundant disequalities in the Latin Square problem

  • Letter
  • Published:
Constraints Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bessière, C., Coletta, R., Petit, T. (2007). Learning implied global constraints. In Veloso, M.M. (Ed.), International joint conference on artificial intelligence (pp. 44–49).

  2. Colbourn, C., Dinitz, J., Wanless, I. (2007). Latin squares. In Colbourn, C., Dinitz, J. (Eds.), The CRC handbook of combinatorial designs (pp. 135–152). Chapman & Hall/CRC, Boca Raton.

    Google Scholar 

  3. Demoen, B., & Garcia de la Banda, M. (2013). Redundant sudoku rules. Journal of Theory and Practice of Logic Programming. doi:10.1017/S1471068412000361

  4. Gent, I.P., Miguel, I., Nightingale, P. (2008). Generalised arc consistency for the alldifferent constraint: An empirical survey. Artificial Intelligence, 172(18), 1973–2000. doi:10.1016/j.artint.2008.10.006.

    Article  MathSciNet  MATH  Google Scholar 

  5. Greenberg, H.J. (1996). Consistency, redundancy, and implied equalities in linear systems. Annals of Mathematics and Artificial Intelligence 17(1), 37–83.

    Article  MathSciNet  MATH  Google Scholar 

  6. van Hoeve, W.J. (2001). The alldifferent constraint: a survey. arXiv:0105015. Accessed 24 Aug 2013

  7. Régin, J.C., & Gomes, C.P. (2004). The cardinality matrix constraint. In Principles and practice of constraint programming–CP 2004 (pp. 572–587). Springer.

  8. Rossi, F., van Beek, P., Walsh, T. (Eds.) (2006). Handbook of constraint programming. Elsevier.

  9. Ryser, H. (1951). A combinatorial theorem with an application to Latin rectangles. Proceedings of the American Mathematical Society, 2(4), 550–552.

    Article  MathSciNet  MATH  Google Scholar 

  10. Telgen, J. (1978). Redundant constraints in linear programming problems. Operations Research Verfahren, 28, 420–433.

    Google Scholar 

  11. Zhou, N.F. (2012). The language features and architecture of B-Prolog. Theory and Practice of Logic Programming, 12(1–2), 189–218.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bart Demoen.

Additional information

This research was partly sponsored by he Australian Research Council grant DP110102258, and by the Research Foundation Flanders (FWO) through projects WOG: Declarative Methods in Computer Science and G.0221.07

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demoen, B., Garcia de la Banda, M. Redundant disequalities in the Latin Square problem. Constraints 18, 471–477 (2013). https://doi.org/10.1007/s10601-013-9147-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-013-9147-1

Keywords