Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Wayne
Last name:	Snyder
DBLP:	s/WayneSnyder
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 27  

Select a publication
Show	Title	Venue	Rating	Date
	Alberto Oliart, Wayne Snyder. Fast algorithms for uniform semi-unification.	J. Symb. Comput. 2004, Volume 37	(0)	2004
	Franz Baader, Wayne Snyder. Unification Theory.	Handbook of Automated Reasoning (in 2 volumes) 2001	(0)	2001
	James G. Schmolze, Wayne Snyder. Detecting redundancy among production rules using term rewrite semantics.	Knowl.-Based Syst. 1999, Volume 12	(0)	1999
	Alberto Oliart, Wayne Snyder. A Fast Algorithm for Uniform Semi-Unification.	Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings 1998	(0)	1998
	James G. Schmolze, Wayne Snyder. Detecting Redundant Production Rules.	AAAI/IAAI 1997	(0)	1997
	Wayne Snyder, James G. Schmolze. Rewrite Semantics for Production Rule Systems: Theory and Applications.	Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings 1996	(0)	1996
	James G. Schmolze, Wayne Snyder. A Tool for Testing Confluence of Production Rules.	Proceedings of the European Symposium on the Validation and Verification of Knowledge-Based Systems, EUROVAV '95, Chambéry, June 1995 1995	(0)	1995
	Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder. Basic Paramodulation	Inf. Comput. 1995, Volume 121	(0)	1995
	Christopher Lynch, Wayne Snyder. Redundancy Criteria for Constrained Completion.	Theor. Comput. Sci. 1995, Volume 142	(0)	1995
	Wayne Snyder. Automated Deduction with Constraints.	Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germant, September 7-9, 1994 1994	(0)	1994
	Christopher Lynch, Wayne Snyder. Redundancy Criteria for Constrained Completion.	Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings 1993	(0)	1993
	Wayne Snyder. On the Complexity of Recursive Path Orderings.	Inf. Process. Lett. 1993, Volume 46	(0)	1993
	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.	J. ACM 1993, Volume 40	(0)	1993
	Wayne Snyder. A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations.	J. Symb. Comput. 1993, Volume 15	(0)	1993
	Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder. Basic Paramodulation and Superposition.	Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings 1992	(0)	1992
	Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder. Theorem Proving Using Equational Matings and Rigid E-Unification.	J. ACM 1992, Volume 39	(0)	1992
	Wayne Snyder, Christopher Lynch. Goal Directed Strategies for Paramodulation.	Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings 1991	(0)	1991
	Wayne Snyder. Higher Order E-Unification.	10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings 1990	(0)	1990
	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.	Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings 1991	(0)	1990
	Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder. Rigid E-Unification: NP-Completeness and Applications to Equational Matings	Inf. Comput. 1990, Volume 87	(0)	1990
	Wayne Snyder. Efficient Ground Completion: An	Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings 1989	(0)	1989
	Wayne Snyder, Jean H. Gallier. Higher-Order Unification Revisited: Complete Sets of Transformations.	J. Symb. Comput. 1989, Volume 8	(0)	1989
	Jean H. Gallier, Wayne Snyder. Complete Sets of Transformations for General E-Unification.	Theor. Comput. Sci. 1989, Volume 67	(0)	1989
	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.	9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings 1988	(0)	1988
	Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted. Rigid E-Unification is NP-Complete	Proceedings, Third Annual Symposium on Logic in Computer Science, 5-8 July 1988, Edinburgh, Scotland, UK 1988	(0)	1988

Your query returned 27 matches in the database.