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 opportunities Bulletin Item

Postdoctoral position in Theoretical Computer Science, Stockholm, SWEDEN

KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications
for a postdoctoral position in Theoretical Computer Science with a focus
on proof complexity and connections to SAT solving.

KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH ( offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.

We are seeking a postdoc for the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving.

This project aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
We are particularly interested in exploring the possibility of basing SAT
solvers on stronger proof systems than are currently being used. In order
to do so, however, a crucial step is to obtain a better understanding of
the corresponding proof systems, and in this context there are a number of
well-known and relatively longstanding open questions in proof complexity
that we want to study and try to solve. A more detailed description of the
project can be found at

The project is led by Jakob Nordstrm ( and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. The group currently consists of one postdoctoral
researcher and two PhD students (in addition to the project leader).
Travel funding is included, and the group also receives short-term and
long-term visitors on a regular basis.

This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent

To receive full consideration, applications should be received by January
14, 2013. More information and instructions how to apply can be found at Informal
enquiries are welcome and may be sent to Jakob Nordstrom.