CFProposal AISB2018

  The Society for the Study of Artificial Intelligence and Simulation for Behaviour (AISB) is soliciting proposals for symposia to be held at the AISB 2018 convention.The longest running convention on Artificial Intelligence, A...


Insurance AI Analy...

Insurance AI Analytics Summit, October 9-10, London Join us for Europe’s only AI event dedicated to insurance where 300 attendees will unite from analytics, pricing, marketing, claims and underwriting. You’ll find out how advan...


AISB 2018 Convention

  The longest running convention on Artificial Intelligence, AISB 2018 will be held at the University of Liverpool, chaired by Floriana Grasso and Louise Dennis. As in the past years, AISB 2018 will provide a unique forum for p...


AI Summit London

     The AI Summit London: The World’s Number One AI Event for Business  Date: 9-10 May 2017 Venue: Business Design Centre, London. The AI Summit is the world’s first and largest/number one conference exhibition dedicated to t...


AISB Wired Health

    AISB and WIRED events have partnered to bring together inspirational high-profile speakers. Join hundreds of healthcare, pharmaceutical and technology influencers and leaders at the 4th Annual WIRED Health event, taking pl...


Hugh Gene Loebner

  The AISB were sad to learn last week of the passing of philanthropist and inventor Hugh Gene Loebner PhD, who died peacefully in his home in New York at the age of 74.  Hugh was founder and sponsor of The Loebner Prize, an an...


AI Europe 2016

  Partnership between AISB and AI Europe 2016: Next December 5th and 6th in London, AI Europe will bring together the European AI eco-system by gathering new tools and future technologies appearing in professional fields for th...


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


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



AISB event Bulletin Item

2nd CALL FOR PAPERS: Logical Approaches to Barriers in Complexity II, 26-30 Mar 2012, Cambridge (U.K.)

Organisers: Arnold Beckmann (Swansea) and Anuj Dawar (Cambridge)
        in association with the Newton Institute programme
          "Semantics and Syntax: A Legacy of Alan Turing"

    Deadline for application for participation:  26th January 2012


Computational complexity theory has its origin in logic. The fundamental goal of this area is to 
understand the limits of efficient computation (that is understanding the class of problems which 
can be solved quickly and with restricted resources) and the sources of intractability (that is 
what takes some problems inherently beyond the reach of such efficient solutions). The most famous 
open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize 
problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some 
of which promise to provide deep insights in the nature and limits of efficient computation.

In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity,
propositional proof complexity and bounded arithmetic. Despite considerable progress by research 
communities in each of these areas, the main open problems remain. In finite model theory the major
open problem is whether there is a logic capturing on all structures the complexity class P of 
polynomial time decidable languages. In bounded arithmetic the major open problem is to prove 
strong independence results that would separate its levels. In propositional proof complexity the 
major open problem is to prove strong lower bounds for expressive propositional proof systems.

The workshop will bring together leading researchers covering all research areas within the scope 
of the workshop. We will especially focus on work that draws on methods from the different areas 
which appeal to the whole community.


      Samuel R. Buss (University of California, San Diego)
      Stephan Kreutzer (Technische Universitt Berlin)


      Albert Atserias (Universitat Politcnica de Catalunya [UPC])
      Yijia Chen (Shanghai Jiao Tong University)
      Stefan Dantchev (Durham University)
      Arnaud Durand (Universit Denis-Diderot Paris 7)
      Bjarki Holm (University of Cambridge)
      Juha Kontinen (University of Helsinki)
      Jan Krajicek (Charles University in Prague)
      Phuong The Nguyen (University of Montreal)
      Rahul Santhanam (University of Edinburgh)
      Nicole Schweikardt (Goethe University)
      Neil Thapen (Academy of Sciences of the Czech Republic)


      Andrew Hodges (Oxford University)


      The application form for participation in this workshop
      can be found at

      The Deadline for receiving the application is

          26th January 2012


      For further questions concerning this workshop please contact