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.

Collections in this community

Recent Submissions

  • Maximal subsemigroups of finite transformation and diagram monoids 

    East, James; Kumar, Jitender; Mitchell, James D.; Wilson, Wilf A. (2018-06-15) - Journal article
    We 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 

    Donoven, C. R.; Mitchell, J. D.; Wilson, W. A. (2018-07-01) - Journal article
    A 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 

    Farka, František; Komendantskya, Ekaterina; Hammond, Kevin (2018) - Journal article
    First-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 

    Gent, Ian Philip; Miguel, Ian James; Nightingale, Peter William; McCreesh, Ciaran; Prosser, Patrick; Moore, Neil; Unsworth, Chris (2018-09) - Journal article
    As 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 ...
  • Proof-carrying plans 

    Schwaab, Christopher Joseph; Komendantskaya, Ekaterina; Hill, Alisdair; Farka, František; Petrick, Ronald; Wells, Joe; Hammond, Kevin (Springer, 2019-01) - Conference item
    It is becoming increasingly important to verify safety and security of AI applications. While declarative languages (of the kind found in automated planners and model checkers) are traditionally used for verifying AI ...

View more