乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:34:21Z","timestamp":1725982461352},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319942049"},{"type":"electronic","value":"9783319942056"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94205-6_24","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T12:22:50Z","timestamp":1530274970000},"page":"354-369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing"],"prefix":"10.1007","author":[{"given":"Pei","family":"Huang","sequence":"first","affiliation":[]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Cunjing","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hantao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,30]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Baumgartner, J., Mony, H., Paruthi, V., Kanzelman, R., Janssen, G.: Scalable sequential equivalence checking across arbitrary design transformations. In: International Conference on Computer Design, pp. 259\u2013266 (2006)","DOI":"10.1109\/ICCD.2006.4380826"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.jcta.2004.06.007","volume":"108","author":"H Cao","year":"2004","unstructured":"Cao, H., Ji, L., Zhu, L.: Large sets of disjoint packings on 6k + 5 points. J. Comb. Theory Ser. A 108(2), 169\u2013183 (2004)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"247","key":"24_CR3","first-page":"50","volume":"37","author":"A Cayley","year":"1946","unstructured":"Cayley, A.: On the triadic arrangements of seven and fifteen things. Philos. Mag. 37(247), 50\u201353 (1946)","journal-title":"Philos. Mag."},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<79::AID-JCD1>3.0.CO;2-H","volume":"8","author":"Y Chang","year":"2015","unstructured":"Chang, Y.: The spectrum for large sets of idempotent quasigroups. J. Comb. Des. 8(2), 79\u201382 (2015)","journal-title":"J. Comb. Des."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"24_CR6","unstructured":"Fujita, M., Slaney, J.K., Bennett, F.: Automatic generation of some results in finite algebra. In: International Joint Conference on Artificial Intelligence, pp. 52\u201357. Morgan Kaufmann (1993)"},{"key":"24_CR7","unstructured":"Gligoroski, D., Markovski, S., Knapskog, S.J.: A public key block cipher based on multivariate quadratic quasigroups. CoRR, abs\/0808.0247 (2008)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, E.I., Prasad, M.R., Brayton, R.K.: Using SAT for combinational equivalence checking. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 114\u2013121 (2001)","DOI":"10.1109\/DATE.2001.915010"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38574-2_24","volume-title":"Automated Deduction \u2013 CADE-24","author":"MJH Heule","year":"2013","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Verifying refutations with extended resolution. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 345\u2013359. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_24"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-40970-2_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"MJH Heule","year":"2016","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the Boolean pythagorean triples problem via cube-and-conquer. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 228\u2013245. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_15"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kaiss, D., Skaba, M., Hanna, Z., Khasidashvili, Z.: Industrial strength SAT-based alignability algorithm for hardware equivalence verification. In: Formal Methods in Computer-Aided Design, pp. 20\u201326 (2007)","DOI":"10.1109\/FAMCAD.2007.37"},{"key":"24_CR12","first-page":"559","volume":"12","author":"C Koscielny","year":"2002","unstructured":"Koscielny, C.: Generating quasigroups for cryptographic applications. Int. J. Appl. Math. Comput. Sci. 12, 559\u2013569 (2002)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0097-3165(83)90053-5","volume":"37","author":"L Jiaxi","year":"1983","unstructured":"Jiaxi, L.: On large sets of disjoint steiner triple systems II. J. Comb. Theory 37(2), 147\u2013155 (1983)","journal-title":"J. Comb. Theory"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-87827-8_30","volume-title":"Computer Mathematics","author":"F Ma","year":"2008","unstructured":"Ma, F., Zhang, J.: Computer search for large sets of idempotent quasigroups. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol. 5081, pp. 349\u2013358. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87827-8_30"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace4 reference manual and guide. CoRR, cs.SC\/0310055 (2003)","DOI":"10.2172\/822574"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.K., E\u00e9n, N.: Improvements to combinational equivalence checking. In: International Conference on Computer-Aided Design, pp. 836\u2013843 (2006)","DOI":"10.1109\/ICCAD.2006.320087"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"24_CR18","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, New York (2006)"},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0898-1221(94)00219-B","volume":"29","author":"JK Slaney","year":"1995","unstructured":"Slaney, J.K., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: quasigroup existence problems. Comput. Math. Appl. 29(2), 115\u2013132 (1995)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","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. Comb. 9(1), 83\u201389 (1988)","journal-title":"Eur. J. Comb."},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-09284-3_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"N Wetzler","year":"2014","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 422\u2013429. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_31"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/jcd.20154","volume":"16","author":"L Yuan","year":"2008","unstructured":"Yuan, L., Kang, Q.: Some infinite families of large sets of Kirkman triple systems. J. Comb. Des. 16(3), 202\u2013212 (2008)","journal-title":"J. Comb. Des."},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","volume-title":"Automated Deduction\u2014CADE-14","author":"H Zhang","year":"1997","unstructured":"Zhang, H.: SATO: an efficient prepositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 272\u2013275. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63104-6_28"},{"key":"24_CR24","unstructured":"Zhang, H.: Combinatorial designs by SAT solvers. In: Handbook of Satisfiability, pp. 533\u2013568. IOS Press (2009)"},{"issue":"1\u20132","key":"24_CR25","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. J. Autom. Reason. 24(1\u20132), 277\u2013296 (2000)","journal-title":"J. Autom. Reason."},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Automatic symmetry breaking method combined with SAT. In: ACM Symposium on Applied, Computing, pp. 17\u201321 (2001)","DOI":"10.1145\/372202.372206"},{"key":"24_CR27","unstructured":"Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: International Joint Conference on Artificial Intelligence, vol. 2, pp. 298\u2013303 (1995)"},{"key":"24_CR28","unstructured":"Zhu, L.: Personal communication, September 2007"},{"key":"24_CR29","unstructured":"Zhu, L.: Large set problems for various idempotent quasigroups (2014)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94205-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T01:23:34Z","timestamp":1571534614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94205-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942049","9783319942056"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94205-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}