Two results in term rewriting theorem proving
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 301-324
- https://doi.org/10.1007/3-540-15976-2_15
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Rewrite methods for clausal and non-clausal theorem provingPublished by Springer Nature ,2006
- An equational approach to theorem proving in first-order predicate calculusACM SIGSOFT Software Engineering Notes, 1985
- Completion of a set of rules modulo a set of equationsPublished by Association for Computing Machinery (ACM) ,1984
- A Technique for Establishing Completeness Results in Theorem Proving with EqualitySIAM Journal on Computing, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Completely non-clausal theorem provingArtificial Intelligence, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A theoretical basis for the reduction of polynomials to canonical formsACM SIGSAM Bulletin, 1976