Semi-Automated Mathematics

Authors:
J. R. Guard;F. C. Oglesby;J. H. Bennett;L. G. Settle
Affiliations:
Applied Logic Corporation, Princeton, New Jersey;Applied Logic Corporation, Princeton, New Jersey;Applied Logic Corporation, Princeton, New Jersey;Applied Logic Corporation, Princeton, New Jersey
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 0
Cited 13

Proofs as programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unification theory

Journal of Symbolic Computation
Higher-order unification revisited: Complete sets of transformations

Journal of Symbolic Computation
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
The Automation of Proof: A Historical and Sociological Exploration

IEEE Annals of the History of Computing
Theorem Proving for Verification (Invited Tutorial)

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automated theory formation in mathematics

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Terminator

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Reducing the derivation of redundant clauses in reasoning systems

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
A man-machine theorem proving system

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A short survey of automated reasoning

AB'07 Proceedings of the 2nd international conference on Algebraic biology
Rough resolution: a refinement of resolution to remove large literals

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fifth in a series of experiments in semi-automated mathematics is described. These experiments culminated in large complex computer programs which allow a mathematician to prove mathematical theorems on an man/machine basis. SAM V, the fifth program, is oriented primarily toward the development of efficient automatic techniques for handling some of the more basic processes of mathematical deduction, and toward the realization of efficient real-time interaction between man and machine through the use of cathode-ray tube displays. SAM V's most notable success is the solution of an open problem in lattice theory.