Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research

The Centre for Interdisciplinary Research in Computational Algebra (CIRCA) was established in 2000 to foster new and existing collaborative research between members of the Schools of Computer Science and of Mathematics and Statistics in the area of computational abstract algebra.
For more information please visit the Centre for Interdisciplinary Research in Computational Algebra (CIRCA) home page.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Recent Submissions
-
Maximal subsemigroups of finite transformation and diagram monoids
(2018-06-15) - Journal articleWe describe and count the maximal subsemigroups of many well-known transformation monoids, and diagram monoids, using a new unified framework that allows the treatment of several classes of monoids simultaneously. The ... -
Computing maximal subsemigroups of a finite semigroup
(2018-07-01) - Journal articleA proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, ... -
Proof-relevant Horn clauses for dependent type inference and term synthesis
(2018) - Journal articleFirst-order resolution has been used for type inference for many years, including in Hindley-Milner type inference, type-classes, and constrained data types. Dependent types are a new trend in functional languages. In this ... -
A review of literature on parallel constraint solving
(2018-09) - Journal articleAs multi-core computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating ... -
How people visually represent discrete constraint problems
(2019-01-24) - Journal articleProblems such as timetabling or personnel allocation can be modeled and solved using discrete constraint programming languages. However, while existing constraint solving software solves such problems quickly in many cases, ...