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


Read More...

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


Read More...

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


Read More...

AISB YouTube Channel

The AISB has launched a YouTube channel: http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...


Read More...

Lighthill Debates

The Lighthill debates from 1973 are now available on YouTube. You need to a flashplayer enabled browser to view this YouTube video  


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)