Solving linear and non-linear constraints using logic-based methods
Solving systems of linear inequalities and closely related optimisation problems are fundamental mathematical problems with a wide range of applications such verification, constraint solving, planning and scheduling. Recently we have discovered two novel algorithms for solving linear constraints: conflict resolution  and bound propagation . These methods were inspired by techniques which made propositional satisfiability scalable to industrial-size problems: unit propagation, backjumping and learning. This is just one example of the sort of project that might be available in this research group. The precise project will be decided upon in consultation with the supervisor.
Requirements: Candidates should have a strong interest in logic/math, willingness to program and experiment with new ideas.
Candidates who have been offered a place for PhD study in the School of Computer Science may be considered for funding by the School. Further details on School funding can be found at: http://www.cs.manchester.ac.uk/study/postgraduate-research/programmes/phd/funding/school-studentships/.
How good is research at University of Manchester in Computer Science and Informatics?
FTE Category A staff submitted: 44.86
Research output data provided by the Research Excellence Framework (REF)
Click here to see the results for all UK universities