Pages that link to "Item:Q2848690"
From MaRDI portal
The following pages link to Integrating a SAT solver with an LCF-style theorem prover (Q2848690):
Displaying 10 items.
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver (Q286803) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- Pegasus: sound continuous invariant generation (Q2147687) (← links)
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses (Q3100209) (← links)
- SAT-Enhanced Mizar Proof Checking (Q5495946) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703770) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- Pegasus: a framework for sound continuous invariant generation (Q6535946) (← links)
- Incorporating a database of graphs into a proof assistant (Q6648164) (← links)