Travelled to:1 × Canada
1 × France
1 × Germany
1 × Italy
1 × United Kingdom
5 × USA
Collaborated with:J.H.Gallier C.Lynch ∅ S.Raatz A.Oliart J.G.Schmolze P.Narendran D.A.Plaisted L.Bachmair H.Ganzinger
Talks about:unif (5) complet (4) ground (4) rewrit (3) equat (3) set (3) paramodul (2) algorithm (2) equival (2) system (2)
Person: Wayne Snyder
DBLP: Snyder:Wayne
Contributed to:
19981996
199319921991199019891988
198819871987Wrote 11 papers:
- CADE-1998-OliartS #algorithm #performance
- A Fast Algorithm for Uniform Semi-Unification (AO, WS), pp. 239–253.
- CADE-1996-SnyderS #semantics #theory and practice
- Rewrite Semantics for Production Rule Systems: Theory and Applications (WS, JGS), pp. 508–522.
- RTA-1993-LynchS
- Redundancy Criteria for Constrained Completion (CL, WS), pp. 2–16.
- CADE-1992-BachmairGLS
- Basic Paramodulation and Superposition (LB, HG, CL, WS), pp. 462–476.
- RTA-1991-SnyderL
- Goal Directed Strategies for Paramodulation (WS, CL), pp. 150–161.
- CADE-1990-Snyder #higher-order
- Higher Order E-Unification (WS), pp. 573–587.
- RTA-1989-Snyder #algorithm #equation #generative #performance #set
- 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 (WS), pp. 419–433.
- CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting
- Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
- LICS-1988-GallierSNP
- Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
- LICS-1987-GallierRS #equation #proving #theorem proving #using
- Theorem Proving Using Rigid E-Unification Equational Matings (JHG, SR, WS), pp. 338–346.
- RTA-1987-GallierS
- A General Complete E-Unification Procedure (JHG, WS), pp. 216–227.