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


Read More...

AISB convention 2017

  In the run up to AISB2017 convention (http://aisb2017.cs.bath.ac.uk/index.html), I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid...


Read More...

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


Read More...

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


Read More...

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


Read More...

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


Read More...
012345

Notice

AISB event Bulletin Item

CALL FOR PARTICIPATION: "Logical Approaches to Barriers in Complexity II", 26-30 March 2011, UK

http://www.newton.ac.uk/programmes/SAS/sasw01.html

Newton Institute Workshop "Logical Approaches to Barriers in Complexity II" 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"
******************************************************************

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.

TUTORIAL SPEAKERS:

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

INVITED SPEAKERS:

      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)


PARTICIPATION:

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

          http://www.newton.ac.uk/cgi/wsapply?CODE=SASW01

      The Deadline for receiving the application is

          26th January 2012


CONTACT:

     For further questions concerning this workshop please contact
     a.beckmannswansea.ac.uk