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 opportunities Bulletin Item

CALL FOR PAPERS: Special issue on "Theory of algorithms and complexity"


We invite submissions of research articles for a special issue in the journal "Theoretical Computer
Science" (TCS) on "Combinatorial Optimization: Theory of algorithms and complexity".

This special issue is associated with the 2nd International Symposium on Combinatorial Optimization
(ISCO 2012) that took place in Athens, Greece, April 19-21, 2012. However, the invitation for 
submissions is not restricted to the papers presented at the conference. It is open to all relevant
articles in combinatorial optimization with emphasis on aspects regarding theory of algorithms and 

With this special issue, we wish to present current research on algorithmic and complexity issues 
of combinatorial optimization. This has been an overly active field in the last decades and the 
purpose of the special issue would be to identify new techniques and problem domains, expose new 
results and indicate directions for further research. High quality research papers are solicited 
to address both theoretical issues as well as questions arising in application domains.

Potential topics include (but are not limited to) the following:
algorithms and data structures,
approximation and on-line algorithms,
randomness in computing,
computational complexity,
exact and parameterized algorithms,
computational geometry,
algorithmic game theory,
graph theory and combinatorics,
parallel and distributed algorithms,
computational algebra and coding theory, combinatorial aspects in computational biology.

The deadline for submissions is September 28, 2012.

To ensure that all manuscripts are correctly identified for inclusion into the Special Issue, it 
is important that during the online submission at the TCS website, the authors select "TCS-A Comb 
Opt (Paschos/Milis/Mark)".

Papers will be refereed according to the standards of TCS and we will do our best to have the 
refereeing procedure timely finished. The tentative schedule for this procedure is:

Notification of acceptance: January 15, 2013 
Submission of revisions: February 28, 2013 
Final Decision: April 17, 2013.

Additional information about the special issue can be obtained from the guest editors.

Guest Editors:

Vangelis Markakis,
Department of Informatics,
Athens University of Economics and Business

Ioannis Milis,
Department of Informatics,
Athens University of Economics and Business

Vangelis Th. Paschos,
LAMSADE, CNRS and Universit Paris-Dauphine Institut Universitaire de France

This call is available