# Wayne Snyder

Affiliations:- Boston University, USA

According to our database

Collaborative distances:

^{1}, Wayne Snyder authored at least 27 papers between 1987 and 2004.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2004

J. Symb. Comput., 2004

2001

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

1999

Knowl. Based Syst., 1999

1998

Proceedings of the Automated Deduction, 1998

1997

Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

Inf. Comput., September, 1995

Theor. Comput. Sci., 1995

A Tool for Testing Confluence of Production Rules.

Proceedings of the European Symposium on the Validation and Verification of Knowledge-Based Systems, 1995

1994

Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993

A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations.

J. Symb. Comput., 1993

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.

J. ACM, 1993

Inf. Process. Lett., 1993

Proof theory for general unification.

Progress in computer science and applied logic 11, Birkhäuser, ISBN: 978-0-8176-3593-0, 1993

1992

J. ACM, 1992

Proceedings of the Automated Deduction, 1992

1991

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

Inf. Comput., 1990

An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality.

Proceedings of the Conditional and Typed Rewriting Systems, 1990

Proceedings of the 10th International Conference on Automated Deduction, 1990

1989

Theor. Comput. Sci., 1989

J. Symb. Comput., 1989

Efficient Ground Completion: An <i>O(n log n)</i> Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E.

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1988

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.

Proceedings of the 9th International Conference on Automated Deduction, 1988

1987

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Theorem Proving Using Rigid E-Unification Equational Matings

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987