Gerald E. Peterson

12 papers A* 2A 2Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
1995 J jnl
Using Taguchi's method of experimental design to control errors in layered perceptrons.
IEEE Trans. Neural Networks
Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward, William E. Bond
1994 J jnl
Constrained term-rewriting induction with applications.
Methods Log. Comput. Sci.
Gerald E. Peterson
1991 J jnl
Using Forcing to Prove Completeness of Resolution and Paramodulation.
J. Symb. Comput.
John Pais, Gerald E. Peterson
1990 A conf
Complete Sets of Reductions with Constraints.
CADE
Gerald E. Peterson
1990 A* conf
Solving Term Inequalities.
AAAI
Gerald E. Peterson
1989 — conf
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity.
RTA
Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson
1988 — conf
Automated Circuit Diagnosis Using First Order Logic Tools.
IEA/AIE (Vol. 1)
Barbara A. Smith, Ralph W. Wilkerson, Gerald E. Peterson
1983 J jnl
A Technique for Establishing Completeness Results in Theorem Proving with Equality.
SIAM J. Comput.
Gerald E. Peterson
1983 A conf
Using generalized programs in the teaching of computer science.
SIGCSE
Gerald E. Peterson
1981 J jnl
Complete Sets of Reductions for Some Equational Theories.
J. ACM
Gerald E. Peterson, Mark E. Stickel
1980 A* conf
A Technique for Establishing Completeness Results in Theorem Proving with Equality.
AAAI
Gerald E. Peterson
1976 J jnl
Theorem Proving with Lemmas.
J. ACM
Gerald E. Peterson