Experiment with an automatic theorem-prover having partial ordering inference rules
From MaRDI portal
Publication:3214440
DOI10.1145/355611.362538zbMath0271.68062OpenAlexW2052377886WikidataQ128253400 ScholiaQ128253400MaRDI QIDQ3214440
Lewis M. Norton, James R. Slagle
Publication date: 1973
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355611.362538
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics ⋮ Non-resolution theorem proving ⋮ Automatic theorem proving in set theory ⋮ A pragmatic approach to resolution-based theorem proving ⋮ Str∔ve and integers ⋮ Refutational theorem proving using term-rewriting systems
This page was built for publication: Experiment with an automatic theorem-prover having partial ordering inference rules
