InKreSAT: Modal Reasoning via Incremental Reduction to SAT
From MaRDI portal
Publication:4928458
DOI10.1007/978-3-642-38574-2_31zbMath1381.68272OpenAlexW139679001MaRDI QIDQ4928458
Publication date: 14 June 2013
Published in: Automated Deduction – CADE-24 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38574-2_31
Related Items (8)
CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT ⋮ Verified Decision Procedures for Modal Logics. ⋮ \(\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 ⋮ InKreSAT ⋮ 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
Uses Software
This page was built for publication: InKreSAT: Modal Reasoning via Incremental Reduction to SAT
