Gerald E. Peterson

According to our database, Gerald E. Peterson authored at least 11 papers between 1976 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1995

Using Taguchi's method of experimental design to control errors in layered perceptrons.

Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward, William E. Bond

IEEE Trans. Neural Networks, 1995

1994

Constrained term-rewriting induction with applications.

Gerald E. Peterson

Methods Log. Comput. Sci., 1994

1991

Using Forcing to Prove Completeness of Resolution and Paramodulation.

John Pais, Gerald E. Peterson

J. Symb. Comput., 1991

1990

Complete Sets of Reductions with Constraints.

Gerald E. Peterson

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

Solving Term Inequalities.

Gerald E. Peterson

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989

Complete Sets of Reductions Modulo Associativity, Commutativity and Identity.

Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson

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

1988

Automated Circuit Diagnosis Using First Order Logic Tools.

Barbara A. Smith, Ralph W. Wilkerson, Gerald E. Peterson

Proceedings of the First International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, IEA/AIE 1988, June 1-3, 1988, Tullahoma, TN, USA. ACM, 1988, 1988

1983

A Technique for Establishing Completeness Results in Theorem Proving with Equality.

Gerald E. Peterson

SIAM J. Comput., 1983

Using generalized programs in the teaching of computer science.

Gerald E. Peterson

Proceedings of the 14th SIGCSE Technical Symposium on Computer Science Education, 1983

1981

Complete Sets of Reductions for Some Equational Theories.

Gerald E. Peterson, Mark E. Stickel

J. ACM, 1981

1976

Theorem Proving with Lemmas.

Gerald E. Peterson

J. ACM, 1976