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

  • Automatically improving constraint models in Savile Row through associative-commutative common subexpression elimination 

    Nightingale, Peter; Akgun, Ozgur; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian (Springer, 2014-09-08) - Conference item
    When solving a problem using constraint programming, constraint modelling is widely acknowledged as an important and difficult task. Even a constraint modelling expert may explore many models and spend considerable time ...

  • Qualitative modelling via constraint programming 

    Kelsey, Tom; Kotthoff, Lars; Jefferson, Christopher Anthony; Linton, Stephen Alexander; Miguel, Ian James; Nightingale, Peter; Gent, Ian Philip (2014-04) - Journal article
    Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences. The aim is to be able to model the behaviour of systems without ...

  • 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 ...

View more