A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Quantification in tail-recursive function definitions
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
| Hi-index | 0.00 |
ACL2 allows users to define predicates whose logical behavior mimics that of universally or existentially quantified formulae. Proof support for such quantification, however, is quite limited. We present an ACL2 framework that employs tables, computed hints and clause processing to identify quantified formulae and to skolemize or instantiate them when possible. We demonstrate how the framework can be used to prove automatically the forall-p-append example presented in the ACL2 documentation.