{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:26:42Z","timestamp":1648992402960},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T00:00:00Z","timestamp":1375747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10601-013-9147-1","type":"journal-article","created":{"date-parts":[[2013,8,5]],"date-time":"2013-08-05T04:49:55Z","timestamp":1375678195000},"page":"471-477","source":"Crossref","is-referenced-by-count":0,"title":["Redundant disequalities in the Latin Square problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Bart","family":"Demoen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Garcia de la Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,6]]},"reference":[{"key":"9147_CR1","unstructured":"Bessi\u00e8re, C., Coletta, R., Petit, T. (2007). Learning implied global constraints. In Veloso, M.M. (Ed.), International joint conference on artificial intelligence (pp. 44\u201349)."},{"key":"9147_CR2","first-page":"135","volume-title":"The CRC handbook of combinatorial designs","author":"C Colbourn","year":"2007","unstructured":"Colbourn, C., Dinitz, J., Wanless, I. (2007). Latin squares. In Colbourn, C., Dinitz, J. (Eds.), The CRC handbook of combinatorial designs (pp. 135\u2013152). Chapman & Hall\/CRC, Boca Raton."},{"key":"9147_CR3","doi-asserted-by":"crossref","unstructured":"Demoen, B., & Garcia de\u00a0la Banda, M. (2013). Redundant sudoku rules. Journal of Theory and Practice of Logic Programming. doi: 10.1017\/S1471068412000361","DOI":"10.1017\/S1471068412000361"},{"issue":"18","key":"9147_CR4","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1016\/j.artint.2008.10.006","volume":"172","author":"IP Gent","year":"2008","unstructured":"Gent, I.P., Miguel, I., Nightingale, P. (2008). Generalised arc consistency for the alldifferent constraint: An empirical survey. Artificial Intelligence, 172(18), 1973\u20132000. doi: 10.1016\/j.artint.2008.10.006 .","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9147_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02284624","volume":"17","author":"HJ Greenberg","year":"1996","unstructured":"Greenberg, H.J. (1996). Consistency, redundancy, and implied equalities in linear systems. Annals of Mathematics and Artificial Intelligence 17(1), 37\u201383.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9147_CR6","unstructured":"van Hoeve, W.J. (2001). The alldifferent constraint: a survey. arXiv: 0105015 . Accessed 24 Aug 2013"},{"key":"9147_CR7","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C., & Gomes, C.P. (2004). The cardinality matrix constraint. In Principles and practice of constraint programming\u2013CP 2004 (pp. 572\u2013587). Springer.","DOI":"10.1007\/978-3-540-30201-8_42"},{"key":"9147_CR8","unstructured":"Rossi, F., van Beek, P., Walsh, T. (Eds.) (2006). Handbook of constraint programming. Elsevier."},{"issue":"4","key":"9147_CR9","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1090\/S0002-9939-1951-0042361-0","volume":"2","author":"H Ryser","year":"1951","unstructured":"Ryser, H. (1951). A combinatorial theorem with an application to Latin rectangles. Proceedings of the American Mathematical Society, 2(4), 550\u2013552.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9147_CR10","first-page":"420","volume":"28","author":"J Telgen","year":"1978","unstructured":"Telgen, J. (1978). Redundant constraints in linear programming problems. Operations Research Verfahren, 28, 420\u2013433.","journal-title":"Operations Research Verfahren"},{"issue":"1\u20132","key":"9147_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1017\/S1471068411000445","volume":"12","author":"NF Zhou","year":"2012","unstructured":"Zhou, N.F. (2012). The language features and architecture of B-Prolog. Theory and Practice of Logic Programming, 12(1\u20132), 189\u2013218.","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9147-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9147-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9147-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:17Z","timestamp":1559243657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9147-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,6]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9147"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9147-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,6]]}}}