Pages that link to "Item:Q2180511"
From MaRDI portal
The following pages link to A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic (Q2180511):
Displaying 7 items.
- Efficient SAT-based proof search in intuitionistic propositional logic (Q2055856) (← links)
- SAT-based proof search in intermediate propositional logics (Q2104497) (← links)
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT (Q2142066) (← links)
- Towards bit-width-independent proofs in SMT solvers (Q2305428) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- Non-classical logics in satisfiability modulo theories (Q6541143) (← links)
- General clauses for SAT-based proof search in intuitionistic propositional logic (Q6611961) (← links)