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

CFP: LCC09, Logic and Computational Complexity


The Tenth International Workshop on Logic and Computational Complexity
(LCC'09, will be held in Los Angeles on
August 10, 2009, as an affiliated meeting of LiCS'09
and in conjunction with SAS'09 (

LCC meetings are aimed at the foundational interconnections between
logic and computational complexity, as present, for example, in implicit
computational complexity (descriptive and type-theoretic methods);
deductive formalisms as they relate to complexity (e.g. ramification,
weak comprehension, bounded arithmetic, linear logic and resource logics);
complexity aspects of finite model theory and databases;
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.

The LCC'09 program consists of invited lectures by Andrei Bulatov,
Martin Hofmann, Phokion Kolaitis, Lars Kristiansen, and
Michel de Rougemont, as well as contributed papers.
The full program is available at

For additional information see,
or email inquiries to
Further information about previous LCC meetings can be found at


   * Patrick Baillot (CNRS-ENS Lyons, Co-chair)
   * Markus Lohrey (Leipzig, Co-Chair)
   * Albert Atserias (UP de Catalunya)
   * Pablo Barcelo (U de Chile)
   * Arnold Beckmann (Swansea)
   * Lauri Hella (Tampere)
   * Andrei Krokhin (Durham)
   * Chris Pollett (San Jose SU)

STEERING COMMITTEE: Michael Benedikt (Oxford, Co-chair),
Daniel Leivant (Indiana U, Co-chair), Robert Constable (Cornell),
Anuj Dawar (Cambridge), Fernando Ferreira (Lisbon),
Martin Hofmann (U Munich), Neil Immerman (U Mass. Amherst),
Neil Jones (Copenhagen), Bruce Kapron (U Victoria),
Jean-Yves Marion (LORIA Nancy), Luke Ong (Oxford),
Martin Otto (Darmstadt), James Royer (Syracuse),
Helmut Schwichtenberg (U Munich), and Pawel Urzyczyn (Warsaw)