Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
Principles of automated theorem proving
Principles of automated theorem proving
Symbolic Model Checking
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
| Hi-index | 0.00 |
The two approaches to automated theorem proving are proof finding and consequence finding. A proof finding program attempts to find a proof for a certain given theorem. A consequence-finding program is given some axioms and then tries to deduce consequences from the axioms and to select "interesting" consequences.