Wayne Snyder - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2004

Fast algorithms for uniform semi-unificationAlberto Oliart, Wayne Snyder. JSC, 37(4):455-484, 2004. [doi]

2001

Unification TheoryFranz Baader, Wayne Snyder. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 445-532, Elsevier and MIT Press, 2001.

1999

Detecting redundancy among production rules using term rewrite semanticsJames G. Schmolze, Wayne Snyder. kbs, 12(1-2):3-11, 1999. [doi]

1998

A Fast Algorithm for Uniform Semi-UnificationAlberto Oliart, Wayne Snyder. cade 1998: 239-253 [doi]

1997

Detecting Redundant Production RulesJames G. Schmolze, Wayne Snyder. AAAI 1997: 417-423

1996

Rewrite Semantics for Production Rule Systems: Theory and ApplicationsWayne Snyder, James G. Schmolze. cade 1996: 508-522

1995

Basic ParamodulationLeo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder. iandc, 121(2):172-192, September 1995.

Redundancy Criteria for Constrained CompletionChristopher Lynch, Wayne Snyder. TCS, 142(2):141-177, 1995. [doi]

A Tool for Testing Confluence of Production RulesJames G. Schmolze, Wayne Snyder. eurovav 1995: 91-104

1994

Automated Deduction with ConstraintsWayne Snyder. iccl 1994: 1-2

1993

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial TimeJean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. JACM, 40(1):1-16, 1993. [doi]

Redundancy Criteria for Constrained CompletionChristopher Lynch, Wayne Snyder. RTA 1993: 2-16

A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground EquationsWayne Snyder. JSC, 15(4):415-450, 1993.

On the Complexity of Recursive Path OrderingsWayne Snyder. ipl, 46(5):257-262, 1993.

Proof theory for general unificationWayne Snyder. Volume 11 of Progress in computer science and applied logic, Birkhäuser, 1993.

1992

Basic Paramodulation and SuperpositionLeo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder. cade 1992: 462-476

Theorem Proving Using Equational Matings and Rigid E-UnificationJean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder. JACM, 39(2):377-429, 1992. [doi]

1991

Goal Directed Strategies for ParamodulationWayne Snyder, Christopher Lynch. RTA 1991: 150-161

1990

Rigid E-Unification: NP-Completeness and Applications to Equational MatingsJean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder. iandc, 87(1/2):129-195, July/August 1990.

Higher Order E-UnificationWayne Snyder. cade 1990: 573-587

An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of EqualityWayne Snyder, Christopher Lynch. ctrs 1991: 454-461

1989

Complete Sets of Transformations for General E-UnificationJean H. Gallier, Wayne Snyder. TCS, 67(2&3):203-260, 1989.

Efficient Ground Completion: An ::::O(n log n):::: Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations EWayne Snyder. RTA 1989: 419-433

Higher-Order Unification Revisited: Complete Sets of TransformationsWayne Snyder, Jean H. Gallier. JSC, 8(1/2):101-140, 1989.

1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial TimeJean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. cade 1988: 182-196

Rigid E-Unification is NP-CompleteJean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted. lics 1988: 218-227

1987

Theorem Proving Using Rigid E-Unification Equational MatingsJean H. Gallier, Stan Raatz, Wayne Snyder. lics 1987: 338-346

A General Complete ::::E::::-Unification ProcedureJean H. Gallier, Wayne Snyder. RTA 1987: 216-227

Sign in or sign up to see more results.

runs on WebDSL