Pages that link to "Item:Q4304492"
From MaRDI portal
The following pages link to Rewrite-based Equational Theorem Proving with Selection and Simplification (Q4304492):
Displaying 14 items.
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Superposition with lambdas (Q5918381) (← links)
- A comprehensive framework for saturation theorem proving (Q5918558) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
- Superposition with lambdas (Q5919500) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)
- A comprehensive framework for saturation theorem proving (Q5970776) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Unifying splitting (Q6103590) (← links)
- SCL(EQ): SCL for first-order logic with equality (Q6111523) (← links)
- Equational Theorem Proving for Clauses over Strings (Q6118747) (← links)
- SAT-Inspired Higher-Order Eliminations (Q6135757) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- Superposition for higher-order logic (Q6156638) (← links)