Computing in Horn clause theories
Computing in Horn clause theories
On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Overview of LP, The Larch Power
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
A Mechanizable Induction Principle for Equational Specifications
Proceedings of the 9th International Conference on Automated Deduction
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such a scheme a test-set. Then, for proving a property, we just instanciate it with terms from the test-set and apply pure algebraic simplification to the result. This method avoids completion and explicit induction. However it retains their positive features, namely the completeness of the former and the robustness of the latter.