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

CALL FOR PAPERS: 30th International Symposium on Theoretical Aspects of Computer Science, Feb 27-March 2, 2013, Kiel, GERMANY

STACS 2013

Authors are invited to submit papers presenting original and unpublished research on theoretical 
aspects of computer science. Typical areas include (but are not limited to):

* algorithms and data structures, including: parallel, distributed,
    approximation, and randomized algorithms, computational geometry,
    cryptography, algorithmic learning theory, analysis of algorithms;
* automata and formal languages, games;
* computational complexity, randomness in computation;
* logic in computer science, including: semantics, specification and
    verification, rewriting and deduction;
* current challenges, for example: natural computing, quantum
    computing, mobile and net computing.

- Eric Allender, Rutgers U.
- Pablo Barcel, U. de Chile
- Frdrique Bassino, U. Paris 13
- Artur Czumaj, U. of Warwick
- Herv Fournier, U. Paris Diderot
- Edward A. Hirsch, Steklov Institute, St. Petersburg
- Iordanis Kerenidis, U. Paris Diderot
- Michal Kouck, Czech Academy of Sciences
- Dieter Kratsch, U. de Lorraine
- Andrei Krokhin, Durham U.
- Antonn Ku?era, Masaryk U.
- Markus Lohrey, U. of Leipzig
- Katarzyna Paluch, U. of Wroclaw
- Natacha Portier, ENS Lyon, co-chair
- Kirk Pruhs, U. of Pittsburgh
- Peter Rossmanith, RWTH Aachen
- Gnter Rote, Freie Universitt Berlin
- Thomas Sauerwald, MPI Saarbrcken
- Sandeep Sen, IIT Delhi
- Subhash Suri, UC Santa Barbara
- Jacobo Toran, Ulm U.
- Jouko Vnnen, U. of Helsinki and U. of Amsterdam
- Thomas Wilke, Kiel U., co-chair
- Carsten Witt, Technical U. of Denmark
- Gerhard J. Woeginger, TU Eindhoven
- Marc Zeitoun, U. Bordeaux 1

- Kousha Etessami, University of Edinburgh
- Kurt Mehlhorn, MPI Saarbrcken and Saarland University
- Stphan Thomass, Ecole Normale Suprieure de Lyon

Dniel Marx, MTA SZTAKI, Hungarian Academy of Sciences: 
Algorithmic Graph Structure Theory

Authors are invited to submit a draft of a full paper with at most 12 pages (including references).
The usage of pdflatex and the LIPIcs style file (see below) are mandatory; no changes to font size,
page geometry etc. are permitted.

The paper should contain a succinct statement of the issues and of their motivation, a summary of 
the main results, and a brief explanation of their significance, accessible to non-specialist 
readers.  Proofs omitted due to space constraints must be put into an appendix to be read by the 
program committee members at their discretion.

Simultaneous submission to other conferences with published proceedings is not allowed.

The submission site, which opened on June 1, 2012, is .

Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International Proceedings in Informatics 
(LIPIcs) series, based at Schloss Dagstuhl.This guarantees perennial, free and easy electronic 
access, while the authors retain the rights over their work.

In addition, the proceedings will also be available as archives in the open access electronic 
repository HAL.

With their submission, authors consent to sign a license authorizing the program committee chairs 
to organize the electronic publication of their paper, provided the paper is accepted.

Further details are available on and on the conference website, .

Each participant of the conference will receive a USB flash drive with an electronic version of 
the proceedings. It is also planned to publish selcted papers in a journal.

Submission deadline:       Sep 21, 2012
                             website open through 23:59 UTC-12:00
Notification:              Dec 7, 2012 
Final version due:         Jan 9, 2013
Symposium:                 Feb 27-Mar 2, 2013

LIPIcs homepage:
tar ball:

******************* (for general information) (for 
information regarding paper submission)