AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie ( Tu...


Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


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


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



AISB opportunities Bulletin Item

CALL FOR PAPERS: Special issue on "Implicit Computational Complexity"

-Special issue of THEORETICAL COMPUTER SCIENCE -Guest Editors: Ugo Dal Lago and Guillaume Bonfante

The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use 
logic and formal methods to delineate complexity-bounded computation (e.g. polynomial time, 
polynomial space or logspace computation). 
It aims at studying computational complexity without referring to external measuring conditions 
or a particular machine model, but only by considering language restrictions or logical/
computational  principles implying complexity properties.

Contributions on various aspects of ICC including (but not exclusively) are welcome :
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- complexity analysis,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,
- programming languages for complexity bounded computation,
- application of implicit complexity to other programming paradigms (e.g. 
imperative or object-oriented languages).

This special issue is a post-conference publication of DICE 2012 workshop. The first DICE workshop 
was held in 2010 in Paphos, Cyprus, the second in Saarbrucken in 2011, and the third one in Tallinn
in 2012 (, all of them as satellite events of ETAPS.


Submissions, in pdf format, must be sent to and no later than

OCTOBER 15th, 2012.

Papers will be processed as soon as they are submitted.

We encourage to look at and  the use of Elsevier's 
elsarticle.cls latex macro package, that can be retrieved from

See also : for updated information. For any further information, please 
contact Ugo Dal Lago (


Submission: October 15th, 2012
Notification of acceptance/rejection: March/April 2013 
Submission of final version: June/July 2013.