AISB Convention 2015

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2015 Convention will be held at the Uni...


Yasemin Erden on BBC

AISB Committee member, and Philosophy Programme Director and Lecturer, Dr Yasemin J. Erden interviewed for the BBC on 29 October 2013. Speaking on the Today programme for BBC Radio 4, as well as the Business Report for BBC world N...


Mark Bishop on BBC ...

Mark Bishop, Chair of the Study of Artificial Intelligence and the Simulation of Behaviour, appeared on Newsnight to discuss the ethics of ‘killer robots’. He was approached to give his view on a report raising questions on the et...


AISB YouTube Channel

The AISB has launched a YouTube channel: ( The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...


Lighthill Debates

The Lighthill debates from 1973 are now available on YouTube. You need to a flashplayer enabled browser to view this YouTube video  



AISB opportunities Bulletin Item

Postdoctoral position in proof complexity and SAT solving, Stockholm, SWEDEN

The Theory Group at KTH Royal Institute of Technology invites applications
 for two postdoctoral positions in theoretical computer science.

 KTH is the leading technical university in Sweden. The Theory Group at KTH
 ( offers a strong research environment covering
 a wide range of research topics such as complexity theory and
 approximation algorithms, computer and network security, cryptography,
 formal methods and natural language processing. The group has a consistent
 track record of publishing in the leading theoretical computer science
 conferences and journals worldwide, and the research conducted here has
 attracted numerous international awards and grants in recent years. We are
 now set to expand further, and these positions are just two of several new

 The postdoctoral researchers will be working in the research group of
 Jakob Nordstrom ( Much of the activities of
 this group revolve around the themes of proof complexity and SAT solving.
 However, these areas have also turned out to have deep, and sometimes
 surprising, connections to other topics such as, e.g., circuit complexity,
 communication complexity, and hardness of approximation, and therefore
 researchers in these or other related areas are more than welcome to

 The research project is financed by a Breakthrough Research Grant from the
 Swedish Research Council and a Starting Independent Researcher Grant from
 the European Research Council. In addition to the project leader, the
 group currently consists of one postdoc and two PhD students. Travel
 funding is included, and the group also receives short-term and long-term
 visitors on a regular basis.

 These are full-time employed positions for one year with a possible
 one-year extension. The successful candidates are expected to start in
 August-September 2014, although this is to some extent negotiable.

 The application deadline is December 15, 2013. More information and
 instructions how to apply can be found at . Informal
 enquiries are welcome and may be sent to Jakob Nordstrom.