Search the dblp DataBase
Wayne Snyder :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Leo Bachmair , Harald Ganzinger , Christopher Lynch , Wayne Snyder Basic Paramodulation and Superposition. [Citation Graph (1, 0)][DBLP ] CADE, 1992, pp:462-476 [Conf ] Leo Bachmair , Harald Ganzinger , Christopher Lynch , Wayne Snyder Basic Paramodulation [Citation Graph (1, 0)][DBLP ] Inf. Comput., 1995, v:121, n:2, pp:172-192 [Journal ] Jean H. Gallier , Wayne Snyder Complete Sets of Transformations for General E-Unification. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1989, v:67, n:2&3, pp:203-260 [Journal ] James G. Schmolze , Wayne Snyder Detecting Redundant Production Rules. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 1997, pp:417-423 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] CADE, 1988, pp:182-196 [Conf ] Alberto Oliart , Wayne Snyder A Fast Algorithm for Uniform Semi-Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1998, pp:239-253 [Conf ] Wayne Snyder Higher Order E-Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:573-587 [Conf ] Wayne Snyder , James G. Schmolze Rewrite Semantics for Production Rule Systems: Theory and Applications. [Citation Graph (0, 0)][DBLP ] CADE, 1996, pp:508-522 [Conf ] Wayne Snyder Automated Deduction with Constraints. [Citation Graph (0, 0)][DBLP ] CCL, 1994, pp:1-2 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:454-461 [Conf ] James G. Schmolze , Wayne Snyder A Tool for Testing Confluence of Production Rules. [Citation Graph (0, 0)][DBLP ] EUROVAV, 1995, pp:91-104 [Conf ] Jean H. Gallier , Stan Raatz , Wayne Snyder Theorem Proving Using Rigid E-Unification Equational Matings [Citation Graph (0, 0)][DBLP ] LICS, 1987, pp:338-346 [Conf ] Jean H. Gallier , Wayne Snyder , Paliath Narendran , David A. Plaisted Rigid E-Unification is NP-Complete [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:218-227 [Conf ] Jean H. Gallier , Wayne Snyder A General Complete E -Unification Procedure. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:216-227 [Conf ] Christopher Lynch , Wayne Snyder Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP ] RTA, 1993, pp:2-16 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:419-433 [Conf ] Wayne Snyder , Christopher Lynch Goal Directed Strategies for Paramodulation. [Citation Graph (0, 0)][DBLP ] RTA, 1991, pp:150-161 [Conf ] Jean H. Gallier , Paliath Narendran , David A. Plaisted , Wayne Snyder Rigid E-Unification: NP-Completeness and Applications to Equational Matings [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:87, n:1/2, pp:129-195 [Journal ] Wayne Snyder On the Complexity of Recursive Path Orderings. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:46, n:5, pp:257-262 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:1, pp:1-16 [Journal ] Jean H. Gallier , Paliath Narendran , Stan Raatz , Wayne Snyder Theorem Proving Using Equational Matings and Rigid E-Unification. [Citation Graph (0, 0)][DBLP ] J. ACM, 1992, v:39, n:2, pp:377-429 [Journal ] Alberto Oliart , Wayne Snyder Fast algorithms for uniform semi-unification. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2004, v:37, n:4, pp:455-484 [Journal ] Wayne Snyder A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1993, v:15, n:4, pp:415-450 [Journal ] Wayne Snyder , Jean H. Gallier Higher-Order Unification Revisited: Complete Sets of Transformations. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1989, v:8, n:1/2, pp:101-140 [Journal ] James G. Schmolze , Wayne Snyder Detecting redundancy among production rules using term rewrite semantics. [Citation Graph (0, 0)][DBLP ] Knowl.-Based Syst., 1999, v:12, n:1-2, pp:3-11 [Journal ] Christopher Lynch , Wayne Snyder Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:142, n:2, pp:141-177 [Journal ] Search in 0.002secs, Finished in 0.305secs