What You Always Wanted to Know about Rigid E-Unification
Authors:
- 1 April 1998
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 20 (1-2) , 47-80
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Basic ParamodulationInformation and Computation, 1995
- Theorem Proving with Ordering and Equality Constrained ClausesJournal of Symbolic Computation, 1995
- Rigid E-unification simplified1995
- Protein: A PROver with a Theory Extension INterface1994
- A completion-based method for mixed universal and rigid E-unification1994
- Consolution as a Framework for Comparing CalculiJournal of Symbolic Computation, 1993
- Basic superposition is complete1992
- Gentzen-type systems and resolution rules part I propositional logic1990
- How to choose the weights in the Knuth Bendix ordering1987
- A simple non-termination test for the Knuth-Bendix method1986