Efficient automated theorem proving for first-order logic
Automated theorem proving has applications ranging from proving theorems in mathematics to verifying correctness of hardware and software. Automated theorem proving is rooted in mathematical logic and combines theoretical methods such as completeness theorems for logical calculi and decision procedures together with implementation techniques for efficient inferences and simplifications. Although theorem proving had a considerable success over recent years many problems coming from applications are still out of reach for current theorem proving methods.This PhD will be focused on developing novel theoretical and practical methods for making automated theorem proving scale to problems that can not be solved by the current state-of-the-art automated methods. The candidate is expected to have a strong background in logic and/or formal methods, good implementation skills are desirable.