The Unit Proof and the Input Proof in Theorem Proving
From MaRDI portal
Publication:5613968
DOI10.1145/321607.321618zbMath0212.34202OpenAlexW2058900023MaRDI QIDQ5613968
No author found.
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321607.321618
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
On solving the equality problem in theories defined by Horn clauses ⋮ Exploiting parallelism: highly competitive semantic tree theorem prover ⋮ Unnamed Item ⋮ Achieving consistency with cutting planes ⋮ On generalized Horn formulas and \(k\)-resolution ⋮ Complexity and related enhancements for automated theorem-proving programs ⋮ Problem representations and formal properties of heuristic search ⋮ Experiments with a heuristic theorem-proving program for predicate calculus with equality ⋮ Theorem proving with variable-constrained resolution ⋮ A note on linear resolution strategies in consequence-finding ⋮ Breadth-first search: some surprising results ⋮ Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence ⋮ MRPPS?An interactive refutation proof procedure system for question-answering ⋮ Representations of the language recognition problem for a theorem prover
This page was built for publication: The Unit Proof and the Input Proof in Theorem Proving
