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


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


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


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



AISB event Bulletin Item

CFP: Proof, Computation, Complexity (PCC09)

8th Proof, Computation and Complexity
PCC 2009
2 - 3 July 2009
LORIA - Nancy, France

Aim and scope
The aim of PCC is to stimulate research in proof theory, computation, and
complexity, focusing on issues which combine logical and computational aspects.
Topics may include applications of formal inference systems in computer science,
as well as new developments in proof theory motivated by computer science
demands. Specific areas of interest are (non-exhaustively listed) foundations
for specification and programming languages, logical methods in specification
and program development including program extraction from proofs, type theory,
new developments in structural proof theory, and implicit computational complexity.

Past events were held
- 2008 in Oslo
- 2007 in Swansea, colocated with the British Mathematical Colloquium 2007,
- 2006 in Ilmenau,
- 2005 in Lisbon, as affiliated Workshop to ICALP '05,
- 2004 in Dresden, in conjunction with the Summer School on Proof Theory and
Automated Theorem Proving,
- 2003 in Dresden, in conjunction with the Summer School on Proof Theory,
Computation, and Complexity, and
- 2002 in Tbingen.

- Guillaume Bonfante, Nancy
- Jean-Yves Marion, Nancy
- Reinhard Kahle, Lisbon
- Ulrich Berger, Swansea
- Monika Seisenberger, Swansea
- Birgit Elbl, Muenchen

Invited Speakers
- Patrick Baillot, Lyon
- Philippe de Groote, Nancy
- Lars Kristiansen, Oslo

PCC is intended to be a lively forum for presenting and discussing recent work.
Participants who want to contribute a talk are asked to submit an abstract
(LaTeX, 1-2 pages). The collection of abstracts will be available at the meeting.

Important Dates
Submission deadline :   10 June 2009
Notification to authors :   15 June 2009
Workshop:               2-3 July 2009

Submission of abstract: {bonfante, marionjy}

When and where
The conference will be held the 2-3 of July 2009 at the LORIA
the computer science laboratory of Nancy University. More information will be
available at