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.

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-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 ...
  • Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice 

    Spracklen, Patrick; Akgun, Ozgur; Miguel, Ian James (Springer, 2018) - Conference item
    Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to ...
  • Metamorphic testing of constraint solvers 

    Akgun, Ozgur; Gent, Ian Philip; Jefferson, Christopher Anthony; Miguel, Ian James; Nightingale, Peter William (Springer, 2018) - Conference item
    Constraint solvers are complex pieces of software and are notoriously difficult to debug. In large part this is due to the difficulty of pinpointing the source of an error in the vast searches these solvers perform, since ...

View more