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


Read More...

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


Read More...

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


Read More...

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


Read More...

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


Read More...

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


Read More...

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


Read More...

AISB convention 2017

  In the run up to AISB2017 convention (http://aisb2017.cs.bath.ac.uk/index.html), I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid...


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

Notice

AISB opportunities Bulletin Item

Postdoctoral positions in theoretical computer science (proof complexity and SAT solving), Stockholm, SWEDEN)

http://www.csc.kth.se/~jakobn/openings/D-2017-0137-Eng.php

The Theory Group at KTH Royal Institute of Technology invites applications 
for postdoctoral positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in 
Sweden. The Theoretical Computer Science Group at KTH (https://www.kth.se/en/csc/forskning/tcs/) 
offers a strong research environment spanning a wide range of research 
topics such as complexity theory and approximation algorithms, computer 
and network security, cryptography, formal methods and natural language 
processing. We have one of Europe's most prominent groups in algorithms 
and complexity theory, and the research conducted here has attracted 
numerous international awards and grants in recent years.

The postdoctoral researchers will be working in the research group of 
Jakob Nordström (http://www.csc.kth.se/~jakobn/). Much of the activities of this 
research group revolve around the themes of proof complexity and SAT 
solving. Examples of theoretical questions of interest are analyzing proof 
systems formalizing the computational power of Groebner bases (polynomial 
calculus) and integer linear programming (cutting planes), and in proving 
stronger lower bound in the hierarchy of Frege proof systems. Another 
interesting area is the use of linear and semidefinite programming to 
solve hard combinatorial problems and of proof complexity to establish 
when problems are beyond the reach of such methods. Problems of the kind 
above have turned out to have deep, and sometimes surprising, connections 
to other topics such as, e.g., circuit complexity, communication 
complexity, and hardness of approximation, and therefore researchers in 
these or other related areas are more than welcome to apply.

The research project is financed by a Consolidator Grant and a 
Breakthrough Research Grant from the Swedish Research Council as well as 
by a Starting Independent Researcher Grant from the European Research 
Council. A more detailed description of the project can be found at 
http://www.csc.kth.se/~jakobn/project-proofcplx/. The group currently consists of 
two postdoctoral researchers and four PhD students (in addition to the 
PI). There are also several other professors, postdocs, and PhD students 
in the TCS Group working on other aspects of algorithms and computational 
complexity (in particular, within the research project Approximation and 
Proof Complexity http://apc.csc.kth.se/), and so this is a unique 
opportunity to explore new connections between different areas of 
theoretical computer science within a vibrant and growing research 
environment.

Within the overall framework sketched above, the postdocs will be expected 
and encouraged to contribute to and influence the research agenda. Taking 
part in teaching graduate seminar courses is encouraged but not required. 
Travel funding is included, and the group also receives short-term and 
long-term visitors on a regular basis.

These postdoc positions are full-time employed positions for one year with 
a possible one-year extension. The expected starting date is in 
August-September 2017, although this is to some extent negotiable.

The application deadline is March 31, 2017. See 
http://www.csc.kth.se/~jakobn/openings/D-2017-0137-Eng.php for the full 
announcement with more information and instructions for how to apply. 
Informal enquiries are welcome and may be sent to jakobn@kth.se.