| 2004 |
|---|
| 27 | EE | Alberto Oliart,
Wayne Snyder:
Fast algorithms for uniform semi-unification.
J. Symb. Comput. 37(4): 455-484 (2004) |
| 2001 |
|---|
| 26 | | Franz Baader,
Wayne Snyder:
Unification Theory.
Handbook of Automated Reasoning 2001: 445-532 |
| 1999 |
|---|
| 25 | EE | James G. Schmolze,
Wayne Snyder:
Detecting redundancy among production rules using term rewrite semantics.
Knowl.-Based Syst. 12(1-2): 3-11 (1999) |
| 1998 |
|---|
| 24 | EE | Alberto Oliart,
Wayne Snyder:
A Fast Algorithm for Uniform Semi-Unification.
CADE 1998: 239-253 |
| 1997 |
|---|
| 23 | | James G. Schmolze,
Wayne Snyder:
Detecting Redundant Production Rules.
AAAI/IAAI 1997: 417-423 |
| 1996 |
|---|
| 22 | | Wayne Snyder,
James G. Schmolze:
Rewrite Semantics for Production Rule Systems: Theory and Applications.
CADE 1996: 508-522 |
| 1995 |
|---|
| 21 | | James G. Schmolze,
Wayne Snyder:
A Tool for Testing Confluence of Production Rules.
EUROVAV 1995: 91-104 |
| 20 | | Leo Bachmair,
Harald Ganzinger,
Christopher Lynch,
Wayne Snyder:
Basic Paramodulation
Inf. Comput. 121(2): 172-192 (1995) |
| 19 | EE | Christopher Lynch,
Wayne Snyder:
Redundancy Criteria for Constrained Completion.
Theor. Comput. Sci. 142(2): 141-177 (1995) |
| 1994 |
|---|
| 18 | | Wayne Snyder:
Automated Deduction with Constraints.
CCL 1994: 1-2 |
| 1993 |
|---|
| 17 | | Christopher Lynch,
Wayne Snyder:
Redundancy Criteria for Constrained Completion.
RTA 1993: 2-16 |
| 16 | | Wayne Snyder:
On the Complexity of Recursive Path Orderings.
Inf. Process. Lett. 46(5): 257-262 (1993) |
| 15 | EE | Jean H. Gallier,
Paliath Narendran,
David A. Plaisted,
Stan Raatz,
Wayne Snyder:
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM 40(1): 1-16 (1993) |
| 14 | | Wayne Snyder:
A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations.
J. Symb. Comput. 15(4): 415-450 (1993) |
| 1992 |
|---|
| 13 | | Leo Bachmair,
Harald Ganzinger,
Christopher Lynch,
Wayne Snyder:
Basic Paramodulation and Superposition.
CADE 1992: 462-476 |
| 12 | EE | Jean H. Gallier,
Paliath Narendran,
Stan Raatz,
Wayne Snyder:
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM 39(2): 377-429 (1992) |
| 1991 |
|---|
| 11 | | Wayne Snyder,
Christopher Lynch:
Goal Directed Strategies for Paramodulation.
RTA 1991: 150-161 |
| 1990 |
|---|
| 10 | | Wayne Snyder:
Higher Order E-Unification.
CADE 1990: 573-587 |
| 9 | | Wayne Snyder,
Christopher Lynch:
An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality.
CTRS 1990: 454-461 |
| 8 | | Jean H. Gallier,
Paliath Narendran,
David A. Plaisted,
Wayne Snyder:
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Inf. Comput. 87(1/2): 129-195 (1990) |
| 1989 |
|---|
| 7 | | Wayne Snyder:
Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E.
RTA 1989: 419-433 |
| 6 | | Wayne Snyder,
Jean H. Gallier:
Higher-Order Unification Revisited: Complete Sets of Transformations.
J. Symb. Comput. 8(1/2): 101-140 (1989) |
| 5 | | Jean H. Gallier,
Wayne Snyder:
Complete Sets of Transformations for General E-Unification.
Theor. Comput. Sci. 67(2&3): 203-260 (1989) |
| 1988 |
|---|
| 4 | | Jean H. Gallier,
Paliath Narendran,
David A. Plaisted,
Stan Raatz,
Wayne Snyder:
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
CADE 1988: 182-196 |
| 3 | | Jean H. Gallier,
Wayne Snyder,
Paliath Narendran,
David A. Plaisted:
Rigid E-Unification is NP-Complete
LICS 1988: 218-227 |
| 1987 |
|---|
| 2 | | Jean H. Gallier,
Stan Raatz,
Wayne Snyder:
Theorem Proving Using Rigid E-Unification Equational Matings
LICS 1987: 338-346 |
| 1 | | Jean H. Gallier,
Wayne Snyder:
A General Complete E-Unification Procedure.
RTA 1987: 216-227 |
