|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ALLEN, J., AND LUCKHAM, D. An interactive theorem-proving program. Machine Intelligence 6, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1970, pp. 321- 336.
|
| |
2
|
ANDERSON, R. Completeness results for E-resolution. Proc. of the AFIPS 1970 SJCC, pp. 653-656.
|
| |
3
|
CHANG, C.L. Renamable paramodulation for automatic theorem proving with equality. Artif. Intel. 1 (1970), 247-256.
|
| |
4
|
DARLING~ON, J. Theorem provers as question answerers. Proe. of, the International Joint Conference on Artificial Intelligence, 1969, D. Walker and L. Norton, Eds.
|
 |
5
|
|
| |
6
|
GILMORE, P. A proof method for quantification theory: Its justification and realization. IBM J. Reg. Dsv. 4 (Jan. 1960), 28-35.
|
 |
7
|
|
| |
8
|
KOWALSKI, R. The case for using axioms in automatic demonstrations. Symposium on Automatic Demonstration (Lecture Notes in Mathematics, Vol. 125). Springer-Verlag, New York, 1970, pp. 112-127.
|
| |
9
|
KOWALSKI, R., AND HAYES, P. Semantic trees in automatic theorem proving. Machine Intelligence 4, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 87-101.
|
| |
10
|
McCARTHY, J. Programs with common sense. Proe. of the Symposium on the Mechanization of Thought Processes. Her Majesty's Stationery Office, London, 1959, pp. 75-84.
|
| |
11
|
|
| |
12
|
ROBINSON, G., AND WOS, L. Paramodulation and theorem proving in first order theories with equality. Machine Intelligence ~,, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 135-150.
|
 |
13
|
|
| |
14
|
ROBINSON, J.A. A review of automatic theorem proving. Proc. of the Symposia in Applied Mathematics, Vol. 19. American Mathematical Society, Providence, R.I., 1967, pp. 1-18.
|
| |
15
|
SLAeLE, J. R. Artificial Intelligence: The Heuristic Programming Approach. McGraw- Hill, New York, 1971.
|
 |
16
|
|
 |
17
|
|
| |
18
|
WANG, H. Formalization and automatic theorem proving. Information Processing 1965 (Proc. of the IFIP Congress 65), Vol. 1, W. Kalenich, Ed., Spartan Books, Washington, D.C., 1965, pp. 51-58.
|
| |
19
|
Wos, L., CARSON, D., AND ROBINSON, G. The unit preference strategy in theorem proving. Proc. of the AFIPS 1964 FJCC, pp. 616-621.
|
 |
20
|
|
| |
21
|
Wos, L., AND ROBINSON, G. Maximal models and refutation completeness: Semidecision procedures in automatic theorem proving. In Word Problems in Group Theory: The Burnside Problem and Decision Problems, W. W. Boone, F. B. Cannonito, and R. C. Lyndon, Eds., North-Holland Pub. Co., Amsterdam, 1971.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|