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: Theoretical Aspects of Computer Science, 5-8 Mar 2014, Lyon, FRANCE



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, parameterized complexity, randomness in

* logic in computer science, including: semantics, specification and
  verification, rewriting and deduction;

* current challenges, for example: natural computing, quantum
  computing, mobile and net computing.



- Edith Cohen, Microsoft Research (Silicon Valley)
- Samir Datta, Chennai Mathematical Institute
- Laurent Doyen, CNRS, LSV, cole Normale Suprieure de Cachan
- Yuval Emek, Technion
- Kousha Etessami, University of Edinburgh
- Martin Hofmann, Ludwig-Maximilians-Universitt Mnchen
- Stefan Kratsch, Technische Universitt Berlin
- Jerzy Marcinkowski, Uniwersytet Wroc?awski
- Wim Martens, Universitt Bayreuth
- Ernst W. Mayr, TUM - Technische Universitt Mnchen (co-chair)
- Gonzalo Navarro, Universidad de Chile
- Eldar Fischer, Technion
- Joachim Niehren, INRIA Lille
- Simon Perdrix, CNRS, Universit de Grenoble
- Natacha Portier, cole Normale Suprieure de Lyon (co-chair)
- Alex Rabinovich, Tel Aviv University
- Venkatesh Raman, The Institute of Mathematical Sciences, Chennai
- Heiko Rglin, Universitt Bonn
- Nitin Saxena, Indian Institute of Technology Kanpur
- Sven Schewe, University of Liverpool
- Henning Schnoor, Christian-Albrechts-Universitt zu Kiel
- Micha Sharir, Tel Aviv University
- Wojciech Szpankowski, Purdue University
- Ioan Todinca, Universit d'Orlans
- Stphane Vialette, Universit de Marne-la-Valle
- Marius Zimand, Towson University



- Javier Esparza, TUM - Technische Universitt Mnchen
- Peter Bro Miltersen, Aarhus University
- Luc Segoufin, INRIA, cole Normale Suprieure de Cachan



Neeraj Kayal, Microsoft Research India: Arithmetic Circuit Complexity



Authors are invited to submit a draft of a full paper with at most 12 
pages. The usage of pdflatex and the LIPIcs style file (see below) are 
mandatory; no changes to font size, page geometry etc. are permitted. 
Submissions not in the correct format or submitted after the deadline will 
not be considered.

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 or 
to journals is not allowed. PC members are excluded from submitting. The 
submission site, which opens on June 15, 2013, 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 will be 
on the conference website,



Submission website opens: Jun 15, 2013

Submission deadline: Sep 20, 2013 (23:59:59 GMT/UTC)

Notification: Dec 6, 2013

Final version due: Jan 8, 2014

Symposium: Mar 5-Mar 8, 2014



LIPIcs homepage:

tar ball:


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