Modal Satisfiability via SMT Solving
From MaRDI portal
Recommendations
- Parameterized modal satisfiability
- Parameterized modal satisfiability
- Satisfiability modulo theories
- A framework for satisfiability modulo theories
- Recent Advances in Constraints
- From Propositional Satisfiability to Satisfiability Modulo Theories
- Satisfiability modulo theories and assignments
- Modal logic S5 satisfiability in answer set programming
- Foundations of satisfiability modulo theories
- Generalized modal satisfiability
Cites work
- scientific article; zbMATH DE number 49802 (Why is no real title available?)
- scientific article; zbMATH DE number 1346360 (Why is no real title available?)
- scientific article; zbMATH DE number 1735878 (Why is no real title available?)
- scientific article; zbMATH DE number 1059246 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- First-order resolution methods for modal logics
- Functional translation and second-order frame properties of modal logics
- Modal languages and bounded fragments of predicate logic
- Modal logic
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Decision Problem for Two-Variable First-Order Logic
- Resolution-based methods for modal logics
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Termination for Hybrid Tableaus
- Using tableau to decide description logics with full role negation and identity
- Using the Universal Modality: Gains and Questions
Cited in
(22)- scientific article; zbMATH DE number 1765664 (Why is no real title available?)
- SAT-based decision procedures for classical modal logics
- Generalized Modal Satisfiability
- Recent Advances in Constraints
- Solving the \$100 modal logic challenge
- Using resolution for testing modal satisfiability and building models
- CoLoSS: the coalgebraic logic satisfiability solver
- Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
- Solving constraint satisfaction problems with SAT modulo theories
- An assumption-based approach for solving the minimal S5-satisfiability problem
- scientific article; zbMATH DE number 1614702 (Why is no real title available?)
- SAT-based decision procedures for classical modal logics
- Solving graded/probabilistic modal logic via linear inequalities (system description)
- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving
- scientific article; zbMATH DE number 1538057 (Why is no real title available?)
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- Non-classical logics in satisfiability modulo theories
- InKreSAT: modal reasoning via incremental reduction to SAT
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- Constraint programming for modelling and solving modal satisfiability
- Constraint solving for finite model finding in SMT solvers
This page was built for publication: Modal Satisfiability via SMT Solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256336)
