InKreSAT

swMATH23448MaRDI QIDQ35221FDOQ35221

Author name not available (Why is that?)

Described by source

• InKreSAT: modal reasoning via incremental reduction to SAT

Cited In (8)

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

This page was built for software: InKreSAT