Wayne Snyder

28 papers A* 2A 5Journal 11Unranked 8
YearRankTypeTitle / Venue / Authors
2004 J jnl
Fast algorithms for uniform semi-unification.
J. Symb. Comput.
Alberto Oliart, Wayne Snyder
2001 — ch.
Unification Theory.
Handbook of Automated Reasoning
Franz Baader, Wayne Snyder
1999 J jnl
Detecting redundancy among production rules using term rewrite semantics.
Knowl. Based Syst.
James G. Schmolze, Wayne Snyder
1998 A conf
A Fast Algorithm for Uniform Semi-Unification.
CADE
Alberto Oliart, Wayne Snyder
1997 — conf
Detecting Redundant Production Rules.
AAAI/IAAI
James G. Schmolze, Wayne Snyder
1996 A conf
Rewrite Semantics for Production Rule Systems: Theory and Applications.
CADE
Wayne Snyder, James G. Schmolze
1995 — conf
A Tool for Testing Confluence of Production Rules.
EUROVAV
James G. Schmolze, Wayne Snyder
1995 J jnl
Basic Paramodulation
Inf. Comput.
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
1995 J jnl
Redundancy Criteria for Constrained Completion.
Theor. Comput. Sci.
Christopher Lynch, Wayne Snyder
1994 — conf
Automated Deduction with Constraints.
CCL
Wayne Snyder
1993 J jnl
A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations.
J. Symb. Comput.
Wayne Snyder
1993 J jnl
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1993 J jnl
On the Complexity of Recursive Path Orderings.
Inf. Process. Lett.
Wayne Snyder
1993 — book
Proof theory for general unification.
Wayne Snyder
1993 — conf
Redundancy Criteria for Constrained Completion.
RTA
Christopher Lynch, Wayne Snyder
1992 A conf
Basic Paramodulation and Superposition.
CADE
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
1992 J jnl
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
1991 — conf
Goal Directed Strategies for Paramodulation.
RTA
Wayne Snyder, Christopher Lynch
1990 — conf
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
Wayne Snyder, Christopher Lynch
1990 A conf
Higher Order E-Unification.
CADE
Wayne Snyder
1990 J jnl
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Inf. Comput.
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder
1989 J jnl
Complete Sets of Transformations for General E-Unification.
Theor. Comput. Sci.
Jean H. Gallier, Wayne Snyder
1989 — conf
Efficient Ground Completion: An
RTA
Wayne Snyder
1989 J jnl
Higher-Order Unification Revisited: Complete Sets of Transformations.
J. Symb. Comput.
Wayne Snyder, Jean H. Gallier
1988 A conf
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
CADE
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1988 A* conf
Rigid E-Unification is NP-Complete
LICS
Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
1987 — conf
A General Complete
RTA
Jean H. Gallier, Wayne Snyder
1987 A* conf
Theorem Proving Using Rigid E-Unification Equational Matings
LICS
Jean H. Gallier, Stan Raatz, Wayne Snyder