New uses of linear arithmetic in automated theorem proving by induction
- 1 March 1996
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 16 (1) , 39-78
- https://doi.org/10.1007/bf00244459
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A mechanizable induction principle for equational specificationsPublished by Springer Nature ,2005
- An overview of Rewrite Rule Laboratory (RRL)Computers & Mathematics with Applications, 1995
- An overview of the Tecton proof systemTheoretical Computer Science, 1994
- An automated tool for analyzing completeness of equational specificationsPublished by Association for Computing Machinery (ACM) ,1994
- Sufficient-completeness, ground-reducibility and their complexityActa Informatica, 1991
- Automatic proofs by induction in theories without constructorsInformation and Computation, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987