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 PARTICIPATION: Colloquium on the Theory of Software Verification, 13 March 2012, Cachan, FRANCE

A special event with two talks, followed by the Habilitation defense of Laurent Doyen. The 
confirmed invited speakers are:

     * Prof. Rupak Majumdar, MPI Kaiserslautern & UCLA
     * Prof. Moshe Y. Vardi, Rice University


   Tuesday, March 13th, 2012

   10:00  Moshe Vardi, The Rise and Fall of Linear Temporal Logic

   11:30  Rupak Majumdar, TBA

   14:30  Laurent Doyen, Games and Automata: From Boolean to Quantitative


The event is open to the public and free. For organizational purposes, please let us know if you 
plan to attend one of the two morning talks, you can register at
A confirmation will be sent to you by e-mail.


The talks will take place on the campus of ENS Cachan (Ecole normale superieure de Cachan). Travel 
instructions are available at:


This event is organized by Laurent Doyen and Alain Finkel.
See for up-to-date information.

                ABSTRACTS OF THE TALKS

Moshe Y. Vardi (Rice University, USA)

The Rise and Fall of Linear Temporal Logic

One of the surprising developments in the area of program verification in the late part of the 20th
Century is the emergence of Linear Temporal Logic (LTL), a logic that emerged in philisophical 
studies of free will, as the cannonical language for describing temporal behavior of computer 
systems. LTL, however, is not expressive enough for industrial applications. 
The first decade of the 21 Century saw the emergence of industrial temporal logics such as ForSpec,
PSL, and SVA. These logics, however, are not clean enough to serve as objects of theoretical study.
This talk will describe the rise and fall of LTL, and will propose a new cannonical temporal logic:
Linear Dynamic Logic (LDL).

Rupak Majumdar (MPI, Germany & UCLA, USA) =========================================


Laurent Doyen (LSV, ENS Cachan & CNRS, France) ==============================================
Habilitation Thesis

Games and Automata: From Boolean to Quantitative Verification

Abstract. This talk presents a selection of results in the traditional verification of finite-state
games and automata (new efficient algorithms for decision problems in games and automata theory), 
then presents extensions of the traditional models to quantitative games and automata, and new 
results in complexity, algorithmics, and expressive power of the new models.