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-carrying plans
(Springer, 2019-01) - Conference itemIt 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
(Springer, 2018) - Conference itemStreamlined 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
(Springer, 2018) - Conference itemConstraint 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 ...
RSS 1.0