Chapter 1 IVY: A PREPROCESSOR AND PROOF CHECKER FOR FIRST-ORDER LOGIC
Abstract:
Abstract This case study shows how non-ACL2 programs can be combined with ACL2 functions in such a way that useful properties can be proved about the composite programs. Nothing is proved about the non-ACL2 programs. Instead, the results of the non-ACL2 programs are checked at run time by ACL2 functions, and properties of these checker functions are proved. The application is resolution/paramodulation automated theorem proving for first-order logic. The top ACL2 function takes a conjecture, preprocesses the conjecture, and calls a non-ACL2 program to search for a proof or countermodel. If the non-ACL2 program succeeds, ACL2 functions check the proof or countermodel. The top ACL2 function is proved sound with respect to finite interpretations.
Citations
| 263 | Otter 3.0 Reference Manual and Guide – McCune - 1994 |
| 70 | A Davis-Putnam program and its application to finite first-order model search – McCune - 1994 |
| 28 | Otter--the CADE-13 competition incarnations – McCune, Wos - 1997 |
| 20 | Automatic proofs and counterexamples for some ortholattice identities – McCune - 1998 |
| 5 | Automated Reasoning: Introduction and Applications, 2nd edition – Wos, Overbeek, et al. - 1992 |
| 1 | MACE: Models and Counterexamples. URL http://www.mcs.anl.gov/AR/mace – McCune - 1994 |
