AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie ( Tu...


Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...



AISB opportunities Bulletin Item

PhD student position in Algorithms, Oxford, UK


Funded Doctoral Studentship in Oxford University's Department of Computer Science


Supervisor: Dr Stanislav Zivny
Start Date: October 2014
End Date: September 2017


The Algorithms Research Group is offering a fully funded D.Phil. studentship in
Oxford University's Department of Computer Science. The studentship provides an
annual stipend to the student of at least 13863 per annum for 3 years. The
studentship covers university and college fees for home/EU students. Overseas
candidates are eligible to apply but would have to find other sources of funding
for the university and college fees. There will also be provision for some
travel funds.

The position is associated with the Royal Society project "Structure of
Rational-Valued Functions on Discrete Domains", led by Stanislav Zivny. The goal
of this project is to understand the structure of separable rational-valued
functions on discrete domains that appear in the context of valued constraint
satisfaction problems.


The candidate is expected to have a strong background in theoretical computer
science and mathematics, in particular in computational complexity and universal
algebra, with an interest in algorithms and discrete optimisation in general.
Candidates must have good written, communication, and organisational skills, and
satisfy the usual requirements for a doctorate study at Oxford:


There is no deadline for applying. We will continue to process applications
until a suitable candidate is found, and candidates are therefore recommended to
apply as soon as possible.

To apply in the first instance candidates should send their CV, a transcript
with a list of courses and grades, and a motivation letter explaining why you
want this studentship, to:


For further information about the studentship or application process please

For further information about the project details please contact: