InKreSAT

swMATH23448MaRDI QIDQ35221

No author found.

Described by source

• InKreSAT: Modal Reasoning via Incremental Reduction to SAT

Related Items (8)

CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT ⋮ Verified Decision Procedures for Modal Logics. ⋮ 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 ⋮ : A Resolution-Based Prover for Multimodal K ⋮ SAT-based explicit LTL reasoning and its application to satisfiability checking ⋮ Local is best: efficient reductions to modal logic \textsf{K} ⋮ Modal Logic S5 Satisfiability in Answer Set Programming

This page was built for software: InKreSAT