Call for Participati...

The AISB Convention is an annual conference organised by the http://aisb2017.cs.bath.ac.uk/registration.html (http://aisb2017.cs.bath.ac.uk/registration.html) The 2017 Convention will be held at the University of Bath, UK, with t...


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

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


Read More...

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


Read More...
0123456789

Notice

AISB opportunities Bulletin Item

PhD student position in SAT solving, Stockholm, SWEDEN

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

The TCS Group at KTH Royal Institute of Technology invites applications 
for a PhD position in computer science focused on SAT solving.

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 PhD student will be working in the research group of Jakob Nordstrom. 
Much of the activities of this research group revolve around the themes of 
efficient algorithms for satisfiability in propositional logic (SAT 
solving) and lower bounds on the efficiency of methods for reasoning about 
SAT (proof complexity). On the practical side, one problem of interest is 
to gain a better understanding of, and improve, the performance of current 
state-of-the-art SAT solvers --- in particular, solvers using 
conflict-driven clause learning (CDCL). We are even more interested in 
exploring new techniques that hold out the theoretical possibility of 
exponential improvements over CDCL, but seem hard to implement efficiently 
in practice, e.g., algebraic methods such as Groebner bases or geometric 
methods such as pseudo-Boolean solving (basically 0/1 integer linear 
programming).

The research project is financed by a Breakthrough Research Grant and a 
Consolidator Grant from the Swedish Research Council and 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, and so this is a unique opportunity to explore new connections 
between theoretical and practical areas of computer science within a 
vibrant and growing research environment.

This is a four-year full-time employed position, but PhD positions usually 
(though not necessarily) include 20% teaching, in which case they are 
prolonged for one more year. The successful candidate is expected to start 
at the latest in August-September 2017, although this is to some extent 
negotiable. The position is fully funded and comes with a competitive 
salary.

The application deadline is March 31, 2017. See 
http://www.csc.kth.se/~jakobn/openings/D-2017-0118-Eng.php for the full 
announcement with more information and instructions how to apply. Informal 
enquiries are welcome and may be sent to jakobn@kth.se . Please note that 
this is an additional announcement on top of the PhD position D-2016-0833 
due to additional research funding. Candidates who already applied for the 
position D-2016-0833 should not apply again --- all applicants for both 
announcements are evaluated in parallel.