Pages that link to "Item:Q2351156"
From MaRDI portal
The following pages link to Reducing higher-order theorem proving to a sequence of SAT problems (Q2351156):
Displaying 10 items.
- Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning (Q682374) (← links)
- TacticToe: learning to prove with tactics (Q2031416) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Extracting Higher-Order Goals from the Mizar Mathematical Library (Q2817297) (← links)
- The CADE-26 automated theorem proving system competition – CASC-26 (Q5145427) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- Reductions for non-clausal theorem proving (Q5958754) (← links)
- Certified SAT solving with GPU accelerated inprocessing (Q6564174) (← links)