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 (https://twitter.com/mohmaj) Tu...


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

Notice

AISB event Bulletin Item

CFP: LCC09: Logic and Computational Complexity

www.cs.indiana.edu/lcc

LCC'09 WORKSHOP ANNOUNCEMENT

The Tenth International Workshop on Logic and Computational Complexity
(LCC'09, www.cs.indiana.edu/lcc)
will be held in Los Angeles on August 10, 2009, as an affiliated meeting
of LiCS'09 (www2.informatik.hu-berlin.de/lics/lics09),
and in conjunction with SAS'09 (sas09.cs.ucdavis.edu).

LCC meetings are aimed at the foundational interconnections
between formal logic and computational complexity,
as present, for example, in implicit computational complexity
(descriptive methods, weak deductive formalisms, modal and linear logic,
type systems); complexity aspects of finite model theory and databases;
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.

The LCC'09 program will consist of invited lectures as well as
contributed papers selected by the program committee.
This year there will be no published proceedings, and work submitted
or published elsewhere is welcome, provided all pertinent information
is disclosed at submission time.  Papers should be written in English,
be accessible to non-specialists, start with a clear statement of the
issues and results, and not exceed 15 pages.

Proposed papers should be uploaded to
http://www.easychair.org/conferences/?conf=lcc090,
by Monday, May 18, 2009,
with expected notification date of Monday, June 1.
For additional information see www.cs.indiana.edu/lcc,
or email inquiries to lcc@cs.indiana.edu.
Further information about previous LCC meetings can be found at
http://www.cis.syr.edu/~royer/lcc.


PROGRAM COMMITTEE

 * Patrick Baillot (CNRS-ENS Lyons, Co-chair)
 * Markus Lohrey (Leipzig, Co-Chair)
 * Albert Atserias (UP de Catalunya)
 * Pablo Barcelo (U de Chile)
 * Arnold Beckmann (Swansea)
 * Lauri Hella (Tampere)
 * Andrei Krokhin (Durham)
 * Chris Pollett (San Jose SU)


STEERING COMMITTEE: Michael Benedikt (Oxford, Co-chair),
Daniel Leivant (Indiana U, Co-chair), Robert Constable (Cornell),
Anuj Dawar (Cambridge), Fernando Ferreira (Lisbon),
Martin Hofmann (U Munich), Neil Immerman (U Mass. Amherst),
Neil Jones (Copenhagen), Bruce Kapron (U Victoria),
Jean-Yves Marion (LORIA Nancy), Luke Ong (Oxford),
Martin Otto (Darmstadt), James Royer (Syracuse),
Helmut Schwichtenberg (U Munich), and Pawel Urzyczyn (Warsaw)