Cited in
(14)- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Leviathan
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- Modal logic S5 satisfiability in answer set programming
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- FaCT++
- Spartacus
- HyLoRes
- BDDTab
- An assumption-based approach for solving the minimal S5-satisfiability problem
- MOIN
- \({\mathrm{K}{_ \mathrm{S}} \mathrm{P}}\): a resolution-based prover for multimodal K
- Verified Decision Procedures for Modal Logics.
- Local is best: efficient reductions to modal logic \textsf{K}
This page was built for software: InKreSAT
