Wayne Snyder

According to our database1, Wayne Snyder authored at least 27 papers between 1987 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2004
Fast algorithms for uniform semi-unification.
J. Symb. Comput., 2004

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

1999
Detecting redundancy among production rules using term rewrite semantics.
Knowl.-Based Syst., 1999

1998
A Fast Algorithm for Uniform Semi-Unification.
Proceedings of the Automated Deduction, 1998

1997
Detecting Redundant Production Rules.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Rewrite Semantics for Production Rule Systems: Theory and Applications.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
Basic Paramodulation
Inf. Comput., September, 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
Automated Deduction with Constraints.
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

On the Complexity of Recursive Path Orderings.
Inf. Process. Lett., 1993

Redundancy Criteria for Constrained Completion.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Proof theory for general unification.
Progress in computer science and applied logic 11, Birkhäuser, ISBN: 978-0-8176-3593-0, 1993

1992
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM, 1992

Basic Paramodulation and Superposition.
Proceedings of the Automated Deduction, 1992

1991
Goal Directed Strategies for Paramodulation.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
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

Higher Order E-Unification.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1989
Complete Sets of Transformations for General E-Unification.
Theor. Comput. Sci., 1989

Higher-Order Unification Revisited: Complete Sets of Transformations.
J. Symb. Comput., 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 E.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1988
Rigid E-Unification is NP-Complete
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
A General Complete E-Unification Procedure.
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


  Loading...