{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:19Z","timestamp":1725564919448},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_20","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T23:35:03Z","timestamp":1283988903000},"page":"288-302","source":"Crossref","is-referenced-by-count":8,"title":["Redundant Modeling for the QuasiGroup Completion Problem"],"prefix":"10.1007","author":[{"given":"Iv\u00e1n","family":"Dot\u00fa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro","family":"del Val","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Cebri\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Regin, J.C.: Mac and combined heuristics: two reason to forsake FC (and CBJ?) on hard problems. In: 2nd Int. Conf. on Principles and Practice of Constraint Programming pp. 61\u201375 (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bitner, J., Reingold, E.M.: Backtrack programming techniques. Communications of the ACM\u00a018, 651\u2013655","DOI":"10.1145\/361219.361224"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up constraint propagation by redundant modeling. In: 2nd Int. Conf. on Principles and Practice of Constraint Programming, pp. 91\u2013103 (1996)","DOI":"10.1007\/3-540-61551-2_68"},{"key":"20_CR4","unstructured":"Colbourn, C.: The complexity of completing partial latin squares. Discrete applied Mathematics"},{"key":"20_CR5","unstructured":"Gomes, C., Shmoys, D.B.: The promise of LP to Boost CSP Techniques for Combinatorial Problems. In: CP-AI-OR 2002, pp. 291\u2013305 (2002)"},{"key":"20_CR6","unstructured":"Gomes, C., Shmoys, D.B.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Proble. In: Proc. Computational Symposium on Graph Coloring and Extensions (2002)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C. Gomes","year":"2000","unstructured":"Gomes, C., Selman, B., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning\u00a024, 67\u2013100 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR8","unstructured":"Regin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"20_CR9","unstructured":"Sergiou, K., Walsh, T.: The difference all-difference makes. In: Proc. IJCAI 1999 (1999)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0898-1221(94)00219-B","volume":"29","author":"J. Slaney","year":"1995","unstructured":"Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: Quasigroup Existence Problems. Computers and Mathematics with Applications\u00a029, 115\u2013132 (1995)","journal-title":"Computers and Mathematics with Applications"},{"key":"20_CR11","unstructured":"Barbara, M.S.: Modeling a Permutation Problem. In: Proceedings of ECAI 2000 Workshop on Modeling and Solving Problems with Constraints (2000)"},{"key":"20_CR12","unstructured":"van Beek, P., Chen, X.: CPlan: A Constraint Programming Approach to Planning. In: AAAI 1999, pp. 585\u2013590 (1999)"},{"key":"20_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45653-8_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Walsh","year":"2001","unstructured":"Walsh, T.: Permutation Problems and Channeling Constraints. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, p. 377. Springer, Heidelberg (2001)"},{"key":"20_CR14","unstructured":"Smith, B.M.: Dual Models in Constraint Programming. School Computing Research Report 2001.02, University of Leeds (January 2001)"},{"key":"20_CR15","first-page":"167","volume-title":"Constraints","author":"B.M.W. Cheng","year":"1999","unstructured":"Cheng, B.M.W., et al.: Increasing Constraint Propagation by Redundant Modeling: an Experience Report. In: Constraints, pp. 167\u2013192. Kluwer Academic Publishers, Dordrecht (1999)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T06:19:14Z","timestamp":1553062754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}