Automating inductionless induction using test sets
- 28 February 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 11 (1-2) , 83-111
- https://doi.org/10.1016/s0747-7171(08)80133-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Automatic proofs by induction in theories without constructorsInformation and Computation, 1989
- Only prime superpositions need be considered in the Knuth-Bendix completion procedureJournal of Symbolic Computation, 1988
- On sufficient-completeness and related properties of term rewriting systemsActa Informatica, 1987
- Semantic confluence tests and completion methodsInformation and Control, 1985
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980