First-order theorem proving using conditional rewrite rules
Authors:
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 1-20
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Rewrite method for theorem proving in first order theory with equalityJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Seventy-five problems for testing automatic theorem proversJournal of Automated Reasoning, 1986
- A new method for establishing refutational completeness in theorem proving1986
- A superposition oriented theorem proverTheoretical Computer Science, 1985
- Contextual rewritingLecture Notes in Computer Science, 1985
- Two results in term rewriting theorem provingLecture Notes in Computer Science, 1985
- Automated deduction by theory resolutionJournal of Automated Reasoning, 1985
- A Technique for Establishing Completeness Results in Theorem Proving with EqualitySIAM Journal on Computing, 1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981