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


Erden in AI roundtab...

On Friday 4th September, philosopher and AISB member Dr Yasemin J Erden, participated in an AI roundtable at Second Home, hosted by Index Ventures and SwiftKey.   Joining her on the panel were colleagues from academia and indu...


AISB Convention 2016

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 2016 Convention will be held at the Uni...


Bishop and AI news

Stephen Hawking thinks computers may surpass human intelligence and take over the world. This view is based on the ideology that all aspects of human mentality will eventually be realised by a program running on a suitable compu...


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


Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


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



AISB event Bulletin Item

2nd CALL FOR PAPERS: Logical Approaches to Barriers in Complexity II, 26-30 Mar 2012, Cambridge (U.K.)

Organisers: Arnold Beckmann (Swansea) and Anuj Dawar (Cambridge)
        in association with the Newton Institute programme
          "Semantics and Syntax: A Legacy of Alan Turing"

    Deadline for application for participation:  26th January 2012


Computational complexity theory has its origin in logic. The fundamental goal of this area is to 
understand the limits of efficient computation (that is understanding the class of problems which 
can be solved quickly and with restricted resources) and the sources of intractability (that is 
what takes some problems inherently beyond the reach of such efficient solutions). The most famous 
open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize 
problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some 
of which promise to provide deep insights in the nature and limits of efficient computation.

In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity,
propositional proof complexity and bounded arithmetic. Despite considerable progress by research 
communities in each of these areas, the main open problems remain. In finite model theory the major
open problem is whether there is a logic capturing on all structures the complexity class P of 
polynomial time decidable languages. In bounded arithmetic the major open problem is to prove 
strong independence results that would separate its levels. In propositional proof complexity the 
major open problem is to prove strong lower bounds for expressive propositional proof systems.

The workshop will bring together leading researchers covering all research areas within the scope 
of the workshop. We will especially focus on work that draws on methods from the different areas 
which appeal to the whole community.


      Samuel R. Buss (University of California, San Diego)
      Stephan Kreutzer (Technische Universitt Berlin)


      Albert Atserias (Universitat Politcnica de Catalunya [UPC])
      Yijia Chen (Shanghai Jiao Tong University)
      Stefan Dantchev (Durham University)
      Arnaud Durand (Universit Denis-Diderot Paris 7)
      Bjarki Holm (University of Cambridge)
      Juha Kontinen (University of Helsinki)
      Jan Krajicek (Charles University in Prague)
      Phuong The Nguyen (University of Montreal)
      Rahul Santhanam (University of Edinburgh)
      Nicole Schweikardt (Goethe University)
      Neil Thapen (Academy of Sciences of the Czech Republic)


      Andrew Hodges (Oxford University)


      The application form for participation in this workshop
      can be found at

      The Deadline for receiving the application is

          26th January 2012


      For further questions concerning this workshop please contact