All of our academic staff are research active, working with a team of post-graduate and post-doctoral researchers and a lively population of research students. Our research focuses on core themes of theoretical and practical computer science: artificial intelligence and symbolic computation, networked and distributed systems, systems engineering, and human computer interaction.

For more information please visit the School of Computer science home page.

Recent Submissions

  • Formal verification of CNL health recommendations 

    Rahman, Fahrurrozi; Bowles, Juliana Kuster Filipe (Springer, 2017) - Conference item
    Clinical texts, such as therapy algorithms, are often described in natural language and may include hidden inconsistencies, gaps and potential deadlocks. In this paper, we propose an approach to identify such problems with ...
  • Self-stabilising target counting in wireless sensor networks using Euler integration 

    Pianini, Danilo; Dobson, Simon Andrew; Viroli, Mirko (IEEE Computer Society, 2017) - Conference item
    Target counting is an established challenge for sensor networks: given a set of sensors that can count (but not identify) targets, how many targets are there? The problem is complicated because of the need to disambiguate ...
  • Generalized support and formal development of constraint propagators 

    Caldwell, James Lynn; Gent, Ian Philip; Nightingale, Peter William (2017-08-31) - Journal article
    Constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) and a set of constraints that express relations ...
  • Machine learning based detection of Kepler objects of interest 

    Nigri, Eduardo; Arandelovic, Ognjen (2017-07-10) - Conference paper
  • Complexity of n-Queens Completion 

    Gent, Ian Philip; Jefferson, Christopher Anthony; Nightingale, Peter William (2017-08) - Journal article
    The n-Queens problem is to place n chess queens on an n by n chessboard so that no two queens are on the same row, column or diagonal. The n-Queens Completion problem is a variant, dating to 1850, in which some queens are ...

View more