A New Class of Automated Theorem-Proving Algorithms
From MaRDI portal
Publication:4773313
DOI10.1145/321812.321814zbMath0286.68046OpenAlexW2063042358MaRDI QIDQ4773313
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321812.321814
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Fast and slow enigmas and parental guidance ⋮ Make E Smart Again (Short Paper) ⋮ ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description) ⋮ Hierarchical deduction ⋮ Experiments with discrimination-tree indexing and path indexing for term retrieval ⋮ An implementation of hyper-resolution ⋮ Non-resolution theorem proving ⋮ ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\) ⋮ Layered clause selection for theory reasoning (short paper) ⋮ Guiding an automated theorem prover with neural rewriting
This page was built for publication: A New Class of Automated Theorem-Proving Algorithms
