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


Rose wins the Loebne...

After 2 hours of judging at Bletchley Park, 'Rose' by Bruce Wilcox was declared the winner of the Loebner Prize 2014, held in conjunction with the AISB.  The event was well attended, film live by Sky News and the special guest jud...


AISB Convention 2015

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 2015 Convention will be held at the Uni...


Yasemin Erden on BBC

AISB Committee member, and Philosophy Programme Director and Lecturer, Dr Yasemin J. Erden interviewed for the BBC on 29 October 2013. Speaking on the Today programme for BBC Radio 4, as well as the Business Report for BBC world N...


Mark Bishop on BBC ...

Mark Bishop, Chair of the Study of Artificial Intelligence and the Simulation of Behaviour, appeared on Newsnight to discuss the ethics of ‘killer robots’. He was approached to give his view on a report raising questions on the et...


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: Developments in Implicit Complexity, 31 Mar - 1 Apr 2012, ESTONIA

DICE 2012 - 3rd Workshop on Developments in Implicit Complexity Tallinn (Estonia)


The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use 
logic and formal methods to provide languages for complexity-bounded computation (e.g. polytime 
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 principles implying complexity properties.

This workshop focuses on ICC methods related to programs (rather than descriptive methods). 
In this approach one relates complexity classes to restrictions on programming paradigms 
(functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak 
polymorphic types, linear logic and linear types, and interpretative measures. The two main 
objectives of this area
. to find natural implicit characterizations of various complexity
   classes of functions, thereby illuminating their nature and
. to design methods suitable for static verification of program

Therefore ICC is related on the one hand to the study of complexity classes, and on the other 
hand to static program analysis. The workshop will be open to contributions on various aspects 
of ICC including (but not exclusively):
. types for controlling complexity,
. logical systems for implicit computational complexity, . linear logic, . semantics of 
complexity-bounded computation, . rewriting and termination orderings, . interpretation-based 
methods for implicit complexity, . programming languages for complexity-bounded computation, . 
certification of complexity properties of programs, . application of implicit complexity to 
other programming paradigms
   (e.g. imperative or object-oriented languages).

The first two DICE workshops were held in 2010 in Cyprus and in 2011 in Germany, both as part of 
ETAPS conferences. Before that, several meetings on this topic had already been held with success 
in Paris (WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit computational complexity).


. Yuri Gurevich (Microsoft Research and University of Michigan) . Ulrich Schoepp (LMU Munich) _______________________________________________________________


The following deadlines are strict:

. Paper Submission (full papers): December 23rd, 2011; . 
Notification (full papers): January 20th, 2012; . 
Final Version (full papers): February 5th, 2012; . 
Submission (extended abstracts): February 18th, 2012; . 
Notification (extended abstracts): February 28th, 2012.

There will be two categories of submissions:
. Full papers, of up to 15 pages;
. Extended abstracts for short presentations (not included in the
   proceedings), of up to 3 pages.
Authors must indicate if their submission belongs to the second category (by adding 
"(Extended Abstract)" in the title). Papers must be submitted electronically, as pdf files, 
at the following
Submissions of the first category (full papers) should not have been published before or 
submitted simultaneously to another conference or journal. This restriction does not hold 
for the second category (extended abstracts). Submissions of papers authored by PC members 
are allowed and encouraged. Proceedings will be published in EPTCS.


. Guillaume Bonfante (Nancy)
. Ugo Dal Lago (Bologna, chair)
. Marco Gaboardi (Bologna and UPenn)
. Nao Hirokawa (JAIST)
. Martin Hofmann (Munchen)
. Olivier Laurent (ENS Lyon)
. Jean-Yves Moyen (Paris Nord)
. Isabel Oitavem (Lisboa)
. German Puebla (Madrid)
. Simona Ronchi Della Rocca (Torino)