- CSB - MetaPress - Google - Bing - Yahoo
 | 2004 | |
|---|---|---|
| j11 |      | Alberto Oliart, Wayne Snyder: Fast algorithms for uniform semi-unification. J. Symb. Comput. 37(4): 455-484 (2004) |
| 2001 | ||
| p1 |  | |
| 1999 | ||
| j10 | | James G. Schmolze, Wayne Snyder: Detecting redundancy among production rules using term rewrite semantics. Knowl.-Based Syst. 12(1-2): 3-11 (1999) |
| 1998 | ||
| c15 | | |
| 1997 | ||
| c14 | | |
| 1996 | ||
| c13 | | Wayne Snyder, James G. Schmolze: Rewrite Semantics for Production Rule Systems: Theory and Applications. CADE 1996: 508-522 |
| 1995 | ||
| j9 | | Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder: Basic Paramodulation. Inf. Comput. 121(2): 172-192 (1995) |
| j8 | | Christopher Lynch, Wayne Snyder: Redundancy Criteria for Constrained Completion. Theor. Comput. Sci. 142(2): 141-177 (1995) |
| c12 | | James G. Schmolze, Wayne Snyder: A Tool for Testing Confluence of Production Rules. EUROVAV 1995: 91-104 |
| 1994 | ||
| c11 | | |
| 1993 | ||
| j7 | | Wayne Snyder: On the Complexity of Recursive Path Orderings. Inf. Process. Lett. 46(5): 257-262 (1993) |
| j6 | | 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) |
| j5 | | 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) |
| c10 | | |
| 1992 | ||
| j4 | | 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) |
| c9 | | Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder: Basic Paramodulation and Superposition. CADE 1992: 462-476 |
| 1991 | ||
| c8 | | |
| 1990 | ||
| j3 | | 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) |
| c7 | | |
| c6 | | 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 |
| 1989 | ||
| j2 | | Wayne Snyder, Jean H. Gallier: Higher-Order Unification Revisited: Complete Sets of Transformations. J. Symb. Comput. 8(1/2): 101-140 (1989) |
| j1 | | Jean H. Gallier, Wayne Snyder: Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67(2&3): 203-260 (1989) |
| c5 | | 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 |
| 1988 | ||
| c4 | | 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 |
| c3 | | Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted: Rigid E-Unification is NP-Complete. LICS 1988: 218-227 |
| 1987 | ||
| c2 | | Jean H. Gallier, Stan Raatz, Wayne Snyder: Theorem Proving Using Rigid E-Unification Equational Matings. LICS 1987: 338-346 |
| c1 | | |
| 1 | Franz Baader | |
| 2 | Leo Bachmair | |
| 3 | Jean H. Gallier | |
| 4 | Harald Ganzinger | |
| 5 | Christopher Lynch | |
| 6 | Paliath Narendran | |
| 7 | Alberto Oliart | |
| 8 | David A. Plaisted | |
| 9 | Stan Raatz | |
| 10 | James G. Schmolze (Jim Schmolze) |
Data released under the ODC-BY 1.0 license — See also our legal information page