![]() |
| * | 1991 | |
|---|---|---|
| 8 | John Pais, Gerald E. Peterson: Using Forcing to Prove Completeness of Resolution and Paramodulation. J. Symb. Comput. 11(1/2): 3-19 (1991) | |
| 1990 | ||
| 7 | Gerald E. Peterson: Solving Term Inequalities. AAAI 1990: 258-263 | |
| 6 | EE | Gerald E. Peterson: Complete Sets of Reductions with Constraints. CADE 1990: 381-395 |
| 1989 | ||
| 5 | EE | Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson: Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. RTA 1989: 29-44 |
| 1988 | ||
| 4 | EE | Barbara A. Smith, Ralph W. Wilkerson, Gerald E. Peterson: Automated Circuit Diagnosis Using First Order Logic Tools. IEA/AIE (Vol. 1) 1988: 456-465 |
| 1983 | ||
| 3 | Gerald E. Peterson: A Technique for Establishing Completeness Results in Theorem Proving with Equality. SIAM J. Comput. 12(1): 82-100 (1983) | |
| 1981 | ||
| 2 | EE | Gerald E. Peterson, Mark E. Stickel: Complete Sets of Reductions for Some Equational Theories. J. ACM 28(2): 233-264 (1981) |
| 1980 | ||
| 1 | Gerald E. Peterson: A Technique for Establishing Completeness Results in Theorem Proving with Equality. AAAI 1980: 87-89 | |
| 1 | Timothy B. Baird | [5] |
| 2 | John Pais | [8] |
| 3 | Barbara A. Smith | [4] |
| 4 | Mark E. Stickel | [2] |
| 5 | Ralph W. Wilkerson | [4] [5] |