Pages that link to "Item:Q5613968"
From MaRDI portal
The following pages link to The Unit Proof and the Input Proof in Theorem Proving (Q5613968):
Displaying 10 items.
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
- Complexity and related enhancements for automated theorem-proving programs (Q1229761) (← links)
- Problem representations and formal properties of heuristic search (Q1238643) (← links)
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence (Q1314288) (← links)
- Experiments with a heuristic theorem-proving program for predicate calculus with equality (Q2551695) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- A note on linear resolution strategies in consequence-finding (Q2557565) (← links)
- Breadth-first search: some surprising results (Q2559927) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)