{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:21:12Z","timestamp":1743034872865,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878261"},{"type":"electronic","value":"9783540878278"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_30","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"349-358","source":"Crossref","is-referenced-by-count":1,"title":["Computer Search for Large Sets of Idempotent Quasigroups"],"prefix":"10.1007","author":[{"given":"Feifei","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Chang, Y.: The Spectrum for Large Sets of Idempotent Quasigroups. Journal of Combinatorial Designs (2000)","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<79::AID-JCD1>3.3.CO;2-8"},{"key":"30_CR2","volume-title":"Handbook of Combinatorial Designs","author":"C.J. Colbourn","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007)","edition":"2"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Dubois, O., Dequen, G.: The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. In: Proc. of the 7th International Conference on Principles and Practice of Constraint Programming (2001)","DOI":"10.1007\/3-540-45578-7_8"},{"key":"30_CR4","unstructured":"Fujita, M., Slaney, J.K., Bennett, F.: Automatic Generation of Some Results in Finite Algebra. In: Proc. IJCAI, pp. 52\u201359 (1993)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Jia, X., Zhang, J.: A Powerful Technique to Eliminate Isomorphism in Finite Model Search. In: Proc. IJCAR, pp. 318\u2013331 (2006)","DOI":"10.1007\/11814771_29"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0012-365X(84)90104-3","volume":"52","author":"C.C. Lindner","year":"1984","unstructured":"Lindner, C.C., Stinson, D.R.: Steiner Pentagon Systems. Discrete Math.\u00a052, 67\u201374 (1984)","journal-title":"Discrete Math."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace4 Reference Manual and Guide. Technical Memorandum 264, Argonne National Laboratory, Argonne, IL, USA (2003)","DOI":"10.2172\/822574"},{"key":"30_CR8","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":"30_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0195-6698(88)80031-3","volume":"9","author":"L. Teirlinck","year":"1988","unstructured":"Teirlinck, L., Lindner, C.C.: The Construction of Large Sets of Idempotent Quasigroups. Eur. J. of Combin.\u00a09, 83\u201389 (1988)","journal-title":"Eur. J. of Combin."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, H.: SATO: An Efficient Propositional Prover. In: Proc. of CADE, pp. 272\u2013275 (1997)","DOI":"10.1007\/3-540-63104-6_28"},{"issue":"1\/2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1006351428454","volume":"24","author":"H. Zhang","year":"2000","unstructured":"Zhang, H., Stickel, M.: Implementing the Davis-Putnam Method. Journal of Automated Reasoning\u00a024(1\/2), 277\u2013296 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"30_CR12","unstructured":"Zhang, J., Zhang, H.: SEM: a System for Enumerating Models. In: Proc. of International Joint Conference on Artificial Intelligence, pp. 11\u201318 (1995)"},{"key":"30_CR13","unstructured":"Zhu, L.: Large Set Problems for Various Idempotent Quasigroups (July 2006)"},{"key":"30_CR14","unstructured":"Zhu, L.: Personal Communication (September 2007)"}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:14:02Z","timestamp":1715238842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}