Solving non-linear constraints over continuous functions
Primary supervisor
Additional information
- The ksmt calculus is a delta-complete decision procedure for non-linear constraints. F. Brausse, K. Korovin, M. Korovina and N. Th. Mueller CADE 2021
- A CDCL-style calculus for solving non-linear constraints F. Brausse, K. Korovin, M. Korovina and N. Th. Mueller (FroCoS'19)
Contact admissions office
Other projects with the same supervisor
- Solving mathematical problems using automated theorem provers
- Optimization and verification of systems modelled using neural networks
- Neuro-sybolic theorem proving
- Software verification with contrained Horn clauses and first-order theorem provers
- Symmetries and Automated Theorem Proving
Funding
- Competition Funded Project (Students Worldwide)
This research project is one of a number of projects at this institution. It is in competition for funding with one or more of these projects. Usually the project which receives the best applicant will be awarded the funding. Applications for this project are welcome from suitably qualified candidates worldwide. Funding may only be available to a limited set of nationalities and you should read the full department and project details for further information.
Project description
Solving non-linear constraints over continuous functions is a very challenging problem with many applications ranging from verification of embedded systems and smart contracts to formalization of the proof of the Kepler's conjecture.
The problem is in general undecidable for constraints beyond polynomials, e.g. in the presence of trigonometric functions such as sine, cosine etc. Nevertheless it is possible to solve such constraints using delta-decision procedures with arbitrary specified precision. In particular we recently developed a kSMT procedure which is delta-complete for all computable functions over the reals. kSMT is based on incremental linearisations and combines symbolic methods with methods from computable analysis. kSMT is a starting point for the project. The problem of solving non-linear constraints remains very challenging and there are a number research directions that this project can take.
Person specification
For information
- Candidates must hold a minimum of an upper Second Class UK Honours degree or international equivalent in a relevant science or engineering discipline.
- Candidates must meet the School's minimum English Language requirement.
- Candidates will be expected to comply with the University's policies and practices of equality, diversity and inclusion.
Essential
Applicants will be required to evidence the following skills and qualifications.
- This project requires mathematical engagement and ability substantially greater than for a typical Computer Science PhD. Give evidence for appropriate competence, as relevant to the project description.
- You must be capable of performing at a very high level.
- You must have a self-driven interest in uncovering and solving unknown problems and be able to work hard and creatively without constant supervision.
Desirable
Applicants will be required to evidence the following skills and qualifications.
- You will have good time management.
- You will possess determination (which is often more important than qualifications) although you'll need a good amount of both.
General
Applicants will be required to address the following.
- Comment on your transcript/predicted degree marks, outlining both strong and weak points.
- Discuss your final year Undergraduate project work - and if appropriate your MSc project work.
- How well does your previous study prepare you for undertaking Postgraduate Research?
- Why do you believe you are suitable for doing Postgraduate Research?