CFProposal AISB2018

  The Society for the Study of Artificial Intelligence and Simulation for Behaviour (AISB) is soliciting proposals for symposia to be held at the AISB 2018 convention.The longest running convention on Artificial Intelligence, A...


Insurance AI Analy...

Insurance AI Analytics Summit, October 9-10, London Join us for Europe’s only AI event dedicated to insurance where 300 attendees will unite from analytics, pricing, marketing, claims and underwriting. You’ll find out how advan...


AISB 2018 Convention

  The longest running convention on Artificial Intelligence, AISB 2018 will be held at the University of Liverpool, chaired by Floriana Grasso and Louise Dennis. As in the past years, AISB 2018 will provide a unique forum for p...


AI Summit London

     The AI Summit London: The World’s Number One AI Event for Business  Date: 9-10 May 2017 Venue: Business Design Centre, London. The AI Summit is the world’s first and largest/number one conference exhibition dedicated to t...


AISB Wired Health

    AISB and WIRED events have partnered to bring together inspirational high-profile speakers. Join hundreds of healthcare, pharmaceutical and technology influencers and leaders at the 4th Annual WIRED Health event, taking pl...


Hugh Gene Loebner

  The AISB were sad to learn last week of the passing of philanthropist and inventor Hugh Gene Loebner PhD, who died peacefully in his home in New York at the age of 74.  Hugh was founder and sponsor of The Loebner Prize, an an...


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


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


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



AISB opportunities Bulletin Item

Postdoctoral position in computer science, Munich (Germany)

A position for a research assistant in a DFG project is available.

Project title: Pointers as an abstract data type:
complexity-theoretic and programming-language aspects (PURPLE)

Investigators: Martin Hofmann and Ulrich Schpp

Duration: 36 months

Start date: as soon as possible but not later than June 2011.

Remuneration: German scale 13 TV-L (38k-54k EUR according to age,
experience, family status)

Background: PhD in theoretical informatics with some topical overlap,
see project description. Candidates with an excellent Diploma or
Master in this area are also encouraged to apply; in this case the project work may lead to a PhD.

Location: The project will be carried out at the Institute for
Informatics of Ludwig-Maximilians-Universitt Munich, Germany. LMU is an equal opportunities employer.

Applications should be sent by E-Mail to Sigrid Roden as a single PDF file containing in particular CV,
research statement, and the names of two potential referees. There is
no deadline. Applications will be assessed on an on-going basis until
the position is filled.

Questions about the position can be directed to the investigators
{mhofmann, schoepp}

Project description:

In programming languages and logics, graphs and similar data
structures are often treated as structured data rather than
bit-sequences or words. This means that elements of abstract data
structures are often accessed using pointers, which support only a
restricted set of operations, such as lookup, update and test for
equality. The concrete representation of pointers remains
hidden. Traditional computability and complexity theory, on the other
hand, rely on concrete representations of data.

In this project we want to explore the expressivity of abstract
pointer concepts in the sense of complexity theory. In particular we
aim at a separation of programming language versions of LOGSPACE and
PTIME. For example, we conjecture that the PTIME-complete problem of
Horn-satisfiability cannot be solved with a constant number of
abstract pointers, even in the presence of non-determinism or an
oracle for reachability.

Additionally, we want to contribute to the formal specification and
verification of programs with abstract pointers. For instance, we
would like to ascribe rigorous meaning to preconditions like `It makes
no guarantees as to the iteration order of the set ...' in the
specification of the HashSet class in java.util.

For further background reading, we refer to:

- Project proposal to Deutsche Forschungsgemeinschaft (DFG):

- Martin Hofmann und Ulrich Schpp. Pure Pointer Programs with
Iteration.  ACM Transactions on Computational Logic, 2010.

- Martin Hofmann und Ulrich Schpp. Pointer Programs and Undirected
Reachability. Logic in Computer Science (LICS), 2009.  Extended
version: Electronic Colloquium on Computational Complexity (ECCC)
15(090), 2008