Projects per year
Abstract
The number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed Constraint Satisfaction to show that the number of nonequivalent semigroups of order 10 is 12,418,001,077,381,302,684. This solves a previously open problem in Mathematics, and has directly led to improvements in Constraint Satisfaction technology.
Original language  English 

Title of host publication  Principles and Practice of Constraint Programming 
Subtitle of host publication  18th International Conference, CP 2012, Québec City, QC, Canada, October 812, 2012. Proceedings 
Editors  Michela Milano 
Publisher  Springer 
Pages  883899 
Number of pages  17 
ISBN (Electronic)  9783642335587 
ISBN (Print)  9783642335570 
DOIs  
Publication status  Published  2012 
Event  18th International Conference on Principles and Practice of Constraint Programming, CP 2012  Quebec, Canada Duration: 8 Oct 2012 → 12 Oct 2012 
Publication series
Name  Lecture Notes in Computer Science 

Volume  7514 
ISSN (Print)  03029743 
Conference
Conference  18th International Conference on Principles and Practice of Constraint Programming, CP 2012 

Country/Territory  Canada 
City  Quebec 
Period  8/10/12 → 12/10/12 
Fingerprint
Dive into the research topics of 'The semigroups of order 10'. Together they form a unique fingerprint.Projects
 1 Finished

A Constraint Solver Synthesiser: A Constraint Solver Synthesiser
Miguel, I. J., Balasubramaniam, D., Gent, I. P., Kelsey, T. & Linton, S. A.
1/10/09 → 30/09/14
Project: Standard