Semi-Automated Mathematics
From MaRDI portal
Publication:5565138
DOI10.1145/321495.321500zbMath0175.28205OpenAlexW1985789487MaRDI QIDQ5565138
J. R. Guard, J. H. Bennett, F. C. Oglesby, L. G. Settle
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321495.321500
Related Items (11)
Unification theory ⋮ Formalization of real analysis: a survey of proof assistants and libraries ⋮ Struktursätze der Algebra und Kompliziertheit logischer Schemata. III Algebraische Theorien und Verallgemeinerungen ⋮ Non-resolution theorem proving ⋮ Associative-commutative deduction with constraints ⋮ An examination of the geometry theorem machine ⋮ Resolution graphs ⋮ Higher-order unification revisited: Complete sets of transformations ⋮ A man-machine theorem-proving system ⋮ Basic research problems: The problem of choosing the representation, inference rule, and strategy ⋮ The problem of choosing the type of subsumption to use
This page was built for publication: Semi-Automated Mathematics
