MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Equational reasoning and term rewriting systems (1993) [42 citations — 6 self]

Download:
pdf | ps
by David A. Plaisted
Handbook of logic in artificial intelligence and logic programming
http://www.loria.fr/~vigneron/RewritingHP/documents/plaisted.ps.gz
Add To MetaCart

Abstract:

Citations

738 A machine-oriented logic based on the resolution principle – Robinson - 1965
68 A unification algorithm for associative-commutative functions – Stickel - 1981
68 On the Church–Rosser property for the direct sum of term rewriting systems – Toyama - 1987
29 Termination for the Direct Sum of Left-Linear Term Rewriting Systems – Toyama, Klop, et al. - 1989
27 Generating Polynomial Orderings – Steinbach - 1994
15 Extensions and comparison of simplification orderings – STEINBACH - 1989
11 A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm – Winkler, Buchberger - 1985
9 Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient Parallel Execution – Sekar, Pawagi, et al. - 1989
7 Efficient ground completion: An O(nlogn) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations – Snyder - 1989
7 Unnecessary inferences in associative-commutative completion procedures – Zhang, Kapur - 1990
5 Semantics of a logic programming language with a reducibility predicate – Tamaki - 1984
4 termination is decidable for ground systems – Fair - 1989
4 First order theorem proving using conditional rewrite rules – Zhang, Kapur - 1988
3 Boolean algebra admits no convergent term rewriting system – Socher-Ambrosius - 1991
1 Term rewriting techniques for logic programming i: completion – Smith, Plaisted - 1988