Refutational theorem proving using term-rewriting systems
Artificial Intelligence
Two results in term rewriting theorem proving
Proc. of the first international conference on Rewriting techniques and applications
Equational methods in first order predicate calculus
Journal of Symbolic Computation
A new method for establishing refutational completeness in theorem proving
Proc. of the 8th international conference on Automated deduction
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Procedure Implementation Through Demodulation and Related Tricks
Proceedings of the 6th Conference on Automated Deduction
Completion of a set of rules modulo a set of equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Discriminator varieties and symbolic computation
Journal of Symbolic Computation
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
A Certified Polynomial-Based Decision Procedure for Propositional Logic
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
A taxonomy of theorem-proving strategies
Artificial intelligence today
| Hi-index | 0.00 |
In this paper we extend the term rewriting approach to first order theorem proving, as described in Hsiang & Dershowitz 1983), to the theory of first order predicate calculus with equality. Consequently, we have showed that the term rewriting method can indeed be made to be as powerful as paramodulation and resolution combined.