Search the dblp DataBase
Gerald E. Peterson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Gerald E. Peterson
A Technique for Establishing Completeness Results in Theorem Proving with Equality. [Citation Graph (0, 0)][DBLP]
AAAI, 1980, pp:87-89 [Conf] - Gerald E. Peterson
Solving Term Inequalities. [Citation Graph (0, 0)][DBLP]
AAAI, 1990, pp:258-263 [Conf] - Gerald E. Peterson
Complete Sets of Reductions with Constraints. [Citation Graph (0, 0)][DBLP]
CADE, 1990, pp:381-395 [Conf] - Barbara A. Smith, Ralph W. Wilkerson, Gerald E. Peterson
Automated Circuit Diagnosis Using First Order Logic Tools. [Citation Graph (0, 0)][DBLP]
IEA/AIE (Vol. 1), 1988, pp:456-465 [Conf] - Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. [Citation Graph (0, 0)][DBLP]
RTA, 1989, pp:29-44 [Conf] - Gerald E. Peterson, Mark E. Stickel
Complete Sets of Reductions for Some Equational Theories. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:2, pp:233-264 [Journal] - John Pais, Gerald E. Peterson
Using Forcing to Prove Completeness of Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 1991, v:11, n:1/2, pp:3-19 [Journal] - Gerald E. Peterson
A Technique for Establishing Completeness Results in Theorem Proving with Equality. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1983, v:12, n:1, pp:82-100 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002