Building decision procedures for modal logics from propositional decision procedures: The case study of modal K(m).
From MaRDI portal
(Redirected from Publication:1854375)
Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
Recommendations
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- Evaluating optimized decision procedures for propositional modal K(m) satisfiability
- Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability
- Modal Satisfiability via SMT Solving
- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
Cites work
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 1149437 (Why is no real title available?)
- A guide to completeness and complexity for modal logics of knowledge and belief
- A machine program for theorem-proving
- Embedding complex decision procedures inside an interactive theorem prover.
- Exploiting the deep structure of constraint problems
- First-order modal tableaux
- Multilanguage hierarchical logics, or: How we can do without modal logics
- Ordered binary decision diagrams and the Davis-Putnam procedure
- Strongly analytic tableaux for normal modal logics
- The Taming of the Cut. Classical Refutations with Analytic Cut
Cited in
(24)- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
- scientific article; zbMATH DE number 1614702 (Why is no real title available?)
- A conflict-driven solving procedure for poly-power constraints
- Automated reasoning in modal and description logics via SAT encoding: the case study of \(K_m/\mathcal{ALC}\)-satisfiability
- Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
- InKreSAT: modal reasoning via incremental reduction to SAT
- scientific article; zbMATH DE number 1538057 (Why is no real title available?)
- Generalizing DPLL and satisfiability for equalities
- BDD-based decision procedures for the modal logic K ★
- Evaluating optimized decision procedures for propositional modal \(\mathbf K(m)\) satisfiability
- Modal Satisfiability via SMT Solving
- SAT-based decision procedures for classical modal logics
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- The SAT-based approach to separation logic
- Implementing tableau calculi using BDDs: BDDTab system description
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving
- Optimizing terminological reasoning for expressive description logics
- Tableau reductions: towards an optimal decision procedure for the modal necessity
- Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability
- scientific article; zbMATH DE number 3877148 (Why is no real title available?)
- Complexity analysis of propositional resolution with autarky pruning
- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
- Formulating the template ILP consistency problem as a constraint satisfaction problem
- Towards an efficient library for SAT: A manifesto
This page was built for publication: Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854375)
