Automated theorem proving searches a formal space of definitions, lemmas and inference rules to construct a proof. Systems may use symbolic search, decision procedures, satisfiability solvers, heuristics or learned guidance to decide which steps to attempt.
Artificial intelligence can improve proof search by proposing useful lemmas and tactics. A generated proof should still be checked by a trusted proof system, separating the potentially complex search process from the smaller mechanism that verifies correctness.
Acronyms and aliases
ATP acronymautomated proof search variant
Related terms
Frequently asked questions
What problems can automated theorem proving solve?
It can prove logical formulas, mathematical theorems and software properties that have been expressed in a supported formal language.
Does an automated theorem prover always find a proof?
No. A statement may be false, outside the supported logic or too difficult for the available search strategy and computing resources.
