{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:00:24Z","timestamp":1776866424844,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642335570","type":"print"},{"value":"9783642335587","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_63","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"883-899","source":"Crossref","is-referenced-by-count":11,"title":["The Semigroups of Order 10"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Distler","sequence":"first","affiliation":[]},{"given":"Chris","family":"Jefferson","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Kelsey","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Kotthoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"Amazon Elastic Compute Cloud, Amazon EC2 (2008), http:\/\/aws.amazon.com\/ec2\/"},{"issue":"1-3","key":"63_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1016544907275","volume":"26","author":"R.T. Bilous","year":"2002","unstructured":"Bilous, R.T., Van Rees, G.H.J.: An enumeration of binary self-dual codes of length 32. Des. Codes Cryptography\u00a026(1-3), 61\u201386 (2002), http:\/\/dx.doi.org\/10.1023\/A:1016544907275","journal-title":"Des. Codes Cryptography"},{"key":"63_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11564751_5","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"D. Cohen","year":"2005","unstructured":"Cohen, D., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 17\u201331. Springer, Heidelberg (2005)"},{"key":"63_CR4","first-page":"148","volume-title":"KR 1996: Principles of Knowledge Representation and Reasoning","author":"J.M. Crawford","year":"1996","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Aiello, L.C., Doyle, J., Shapiro, S. (eds.) KR 1996: Principles of Knowledge Representation and Reasoning, pp. 148\u2013159. Morgan Kaufmann, San Francisco (1996)"},{"key":"63_CR5","unstructured":"Distler, A.: Classification and Enumeration of Finite Semigroups. Shaker Verlag, Aachen (2010), also PhD thesis, University of St Andrews (2010), http:\/\/hdl.handle.net\/10023\/945"},{"key":"63_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-85110-3_7","volume-title":"Intelligent Computer Mathematics","author":"A. Distler","year":"2008","unstructured":"Distler, A., Kelsey, T.: The Monoids of Order Eight and Nine. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC\/Calculemus\/MKM 2008. LNCS (LNAI), vol.\u00a05144, pp. 61\u201376. Springer, Heidelberg (2008)"},{"issue":"1","key":"63_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-009-9140-y","volume":"56","author":"A. Distler","year":"2009","unstructured":"Distler, A., Kelsey, T.: The monoids of orders eight, nine & ten. Ann. Math. Artif. Intell.\u00a056(1), 3\u201321 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"63_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.37236\/2441","volume":"19","author":"A. Distler","year":"2012","unstructured":"Distler, A., Mitchell, J.D.: The number of nilpotent semigroups of degree 3. Electron. J. Combin. 19(2), Research Paper 51 (2012)","journal-title":"Electron. J. Combin."},{"key":"63_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1090\/S0002-9939-1955-0069814-7","volume":"6","author":"G.E. Forsythe","year":"1955","unstructured":"Forsythe, G.E.: SWAC computes 126 distinct semigroups of order 4. Proc. Amer. Math. Soc.\u00a06, 443\u2013447 (1955)","journal-title":"Proc. Amer. Math. Soc."},{"key":"63_CR10","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.artint.2006.03.002","volume":"170","author":"A.M. Frisch","year":"2006","unstructured":"Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artificial Intelligence\u00a0170, 834 (2006)","journal-title":"Artificial Intelligence"},{"key":"63_CR11","unstructured":"The GAP\u00a0Group, GAP \u2013 Groups, Algorithms, and Programming, Version 4.4.12 (2008), http:\/\/www.gap-system.org"},{"key":"63_CR12","unstructured":"Gecode: Generic constraint development environment, http:\/\/www.gecode.org\/"},{"key":"63_CR13","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) The European Conference on Artificial Intelligence 2006 (ECAI 2006), pp. 98\u2013102. IOS Press (2006)"},{"key":"63_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11889205_15","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"I.P. Gent","year":"2006","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Watched Literals for Constraint Propagation in Minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 182\u2013197. Springer, Heidelberg (2006)"},{"key":"63_CR15","series-title":"New Series","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511946.001.0001","volume-title":"Fundamentals of semigroup theory, London Mathematical Society Monographs","author":"J.M. Howie","year":"1995","unstructured":"Howie, J.M.: Fundamentals of semigroup theory, London Mathematical Society Monographs. New Series, vol.\u00a012. The Clarendon Press, Oxford University Press, New York (1995), Oxford Science Publications"},{"key":"63_CR16","unstructured":"Jefferson, C.: Quicklex - a case study in implementing constraints with dynamic triggers. In: Proceedings of the ERCIM Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2011 (2011)"},{"issue":"1","key":"63_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02194655","volume":"14","author":"H. J\u00fcrgensen","year":"1977","unstructured":"J\u00fcrgensen, H., Wick, P.: Die Halbgruppen der Ordnungen \u2264\u20097. Semigroup Forum\u00a014(1), 69\u201379 (1977)","journal-title":"Semigroup Forum"},{"key":"63_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10822-010-9359-z","volume":"24","author":"A. Katritzky","year":"2010","unstructured":"Katritzky, A., Hall, C., El-Gendy, B., Draghici, B.: Tautomerism in drug discovery. Journal of Computer-Aided Molecular Design\u00a024, 475\u2013484 (2010), http:\/\/dx.doi.org\/10.1007\/s10822-010-9359-z , doi:10.1007\/s10822-010-9359-z","journal-title":"Journal of Computer-Aided Molecular Design"},{"issue":"1","key":"63_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1090\/S0002-9904-1956-09973-2","volume":"62","author":"V.L. Klee Jr.","year":"1956","unstructured":"Klee Jr., V.L.: The November meeting in Los Angeles. Bull. Amer. Math. Soc.\u00a062(1), 13\u201323 (1956), http:\/\/dx.doi.org\/10.1090\/S0002-9904-1956-09973-2","journal-title":"Bull. Amer. Math. Soc."},{"key":"63_CR20","unstructured":"Kotthoff, L., Moore, N.C.: Distributed solving through model splitting. In: 3rd Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 26\u201334 (2010)"},{"key":"63_CR21","doi-asserted-by":"crossref","unstructured":"Kreher, D., Stinson, D.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press (1998)","DOI":"10.1145\/309739.309744"},{"key":"63_CR22","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 131\u2013136 (2007)"},{"issue":"147","key":"63_CR23","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1090\/S0025-5718-1979-0528064-2","volume":"33","author":"B.D. McKay","year":"1979","unstructured":"McKay, B.D.: Transitive graphs with fewer than twenty vertices. Math. Comp.\u00a033(147), 1101\u20131121 (1979), contains microfiche supplement","journal-title":"Math. Comp."},{"key":"63_CR24","first-page":"161","volume":"30","author":"B.D. McKay","year":"1990","unstructured":"McKay, B.D., Royle, G.F.: The transitive graphs with at most 26 vertices. Ars Combin.\u00a030, 161\u2013176 (1990)","journal-title":"Ars Combin."},{"issue":"1","key":"63_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1021\/ci800340j","volume":"49","author":"F. Milletti","year":"2009","unstructured":"Milletti, F., Storchi, L., Sforna, G., Cross, S., Cruciani, G.: Tautomer enumeration and stability prediction for virtual screening on large chemical databases. Journal of Chemical Information and Modeling\u00a049(1), 68\u201375 (2009), http:\/\/pubs.acs.org\/doi\/abs\/10.1021\/ci800340j","journal-title":"Journal of Chemical Information and Modeling"},{"key":"63_CR26","unstructured":"Motzkin, T.S., Selfridge, J.L.: Semigroups of order five. Presented in [19] (1955)"},{"key":"63_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/978-3-540-45193-8_81","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"K.E. Petrie","year":"2003","unstructured":"Petrie, K.E., Smith, B.M.: Symmetry Breaking in Graceful Graphs. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 930\u2013934. Springer, Heidelberg (2003)"},{"key":"63_CR28","first-page":"2","volume":"2","author":"R.J. Plemmons","year":"1967","unstructured":"Plemmons, R.J.: There are 15973 semigroups of order 6. Math. Algorithms\u00a02, 2\u201317 (1967)","journal-title":"Math. Algorithms"},{"key":"63_CR29","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)"},{"issue":"1","key":"63_CR30","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF02573467","volume":"49","author":"S. Satoh","year":"1994","unstructured":"Satoh, S., Yama, K., Tokizawa, M.: Semigroups of order 8. Semigroup Forum\u00a049(1), 7\u201329 (1994)","journal-title":"Semigroup Forum"},{"issue":"2-4","key":"63_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D. Thain","year":"2005","unstructured":"Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: The Condor experience. Concurrency \u2013 Practice and Experience\u00a017(2-4), 323\u2013356 (2005)","journal-title":"Concurrency \u2013 Practice and Experience"},{"key":"63_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-00202-1_13","volume-title":"WALCOM: Algorithms and Computation","author":"K. Yamanaka","year":"2009","unstructured":"Yamanaka, K., Otachi, Y., Nakano, S.-I.: Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract). In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 141\u2013150. Springer, Heidelberg (2009), http:\/\/dx.doi.org\/10.1007\/978-3-642-00202-1_13"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T23:52:01Z","timestamp":1714434721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}