Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic
From MaRDI portal
Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic
Cites work
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- \({\mathrm{K}{_ \mathrm{S}} \mathrm{P}}\): a resolution-based prover for multimodal K
- A benchmark method for the propositional modal logics K, KT, S4
- A Modal-Layered Resolution Calculus for K
- Anti-prenexing and Prenexing for Modal Logics
- BDD-based decision procedures for the modal logic K ★
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Clausal resolution for normal modal logics
- Clausal Tableaux for Multimodal Logics of Belief
- Deciding regular grammar logics with converse through first-order logic
- Efficient local reductions to basic modal logic
- scientific article; zbMATH DE number 1612541 (Why is no real title available?)
- scientific article; zbMATH DE number 2196594 (Why is no real title available?)
- Implementing tableau calculi using BDDs: BDDTab system description
- InKreSAT: modal reasoning via incremental reduction to SAT
- Local is best: efficient reductions to modal logic \textsf{K}
- Local reductions for the modal cube
- Modal logic
- Modal Resolution
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
- Reducing Modal Consequence Relations
- Theorem provers for every normal modal logic
This page was built for publication: Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492757)
