Postdoctoral Research Associate in Proof-driven Query Planning (2 posts)

Oxford, UK
£31,604 - £38,833 p.a.
Nov 09, 2017
Nov 27, 2017
Medicine, Medical
Contract Type
Full Time
We have an exciting new opening for two Postdoctoral Research Associates to work with Professor Michael Benedikt on computational logic for 2 years. The foundational component of the project includes the study of decidability and complexity of guarded logics, interpolation and beth definability for guarded logics, proof systems for guarded logics and connections between automata theory and guarded logics. The project also includes applications in data management, including the analysis of privacy and its connection to logic, and the synthesis of database implementations from specifications.

You will be expected to participate in one or more of the following activities: analyse the decidability and complexity of guarded logics, develop and analyse proof systems for reasoning with guarded logics, studying interpolation via proof-theoretic or automata-theoretic means, studying the interaction between logic and data privacy and/or data integration.

You should have a first degree, and a doctoral degree in computer science or related discipline (or be close to completion) and a record of research in computational logic. All fields of computational logic will be considered.

The closing date for applications is 12.00 noon on 13 December 2017.

Please note that the University of Oxford's retirement policy has changed. With effect from 1 October 2017, all employees at Grade 8 and above have a retirement age of the 30 September before the 69th birthday. All employees at Grades 1-7 do not have a set retirement age. Further details are available here: