Wayne Snyder

Publication Activity (10 Years)

Years Active: 1987-2004
Publications (10 Years): 0

Publications

Alberto Oliart, Wayne Snyder
Fast algorithms for uniform semi-unification. J. Symb. Comput. 37 (4) (2004)
James G. Schmolze, Wayne Snyder
Detecting redundancy among production rules using term rewrite semantics. Knowl. Based Syst. 12 (1-2) (1999)
Alberto Oliart, Wayne Snyder
A Fast Algorithm for Uniform Semi-Unification. CADE (1998)
James G. Schmolze, Wayne Snyder
Detecting Redundant Production Rules. AAAI/IAAI (1997)
Wayne Snyder, James G. Schmolze
Rewrite Semantics for Production Rule Systems: Theory and Applications. CADE (1996)
James G. Schmolze, Wayne Snyder
A Tool for Testing Confluence of Production Rules. EUROVAV (1995)
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation Inf. Comput. 121 (2) (1995)
Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. Theor. Comput. Sci. 142 (2) (1995)
Wayne Snyder
Automated Deduction with Constraints. CCL (1994)
Wayne Snyder
A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. J. Symb. Comput. 15 (4) (1993)
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) (1993)
Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. RTA (1993)
Wayne Snyder
On the Complexity of Recursive Path Orderings. Inf. Process. Lett. 46 (5) (1993)
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39 (2) (1992)
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation and Superposition. CADE (1992)
Wayne Snyder, Christopher Lynch
Goal Directed Strategies for Paramodulation. RTA (1991)
Wayne Snyder
Higher Order E-Unification. CADE (1990)
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)
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) (1990)
Wayne Snyder, Jean H. Gallier
Higher-Order Unification Revisited: Complete Sets of Transformations. J. Symb. Comput. 8 (1/2) (1989)
Wayne Snyder
Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. RTA (1989)
Jean H. Gallier, Wayne Snyder
Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67 (2&3) (1989)
Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
Rigid E-Unification is NP-Complete LICS (1988)
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)
Jean H. Gallier, Stan Raatz, Wayne Snyder
Theorem Proving Using Rigid E-Unification Equational Matings LICS (1987)
Jean H. Gallier, Wayne Snyder
-Unification Procedure. RTA (1987)