Pages that link to "Item:Q2554609"
From MaRDI portal
The following pages link to Theorem proving with variable-constrained resolution (Q2554609):
Displaying 4 items.
- Using rewriting rules for connection graphs to prove theorems (Q1137877) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- On an unsatisfiability-satisfiability prover (Q1264000) (← links)
- What you always wanted to know about rigid E-unification (Q5235253) (← links)