Pages that link to "Item:Q1854375"
From MaRDI portal
The following pages link to Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375):
Displaying 15 items.
- Tableau reductions: towards an optimal decision procedure for the modal necessity (Q313007) (← links)
- Formulating the template ILP consistency problem as a constraint satisfaction problem (Q487650) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- Evaluating optimized decision procedures for propositional modal \(\mathbf K(m)\) satisfiability (Q1610668) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Optimizing terminological reasoning for expressive description logics (Q2462645) (← links)
- Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- SAT-based decision procedures for classical modal logics (Q2751042) (← links)
- Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability (Q2751043) (← links)
- BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
- Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability (Q3651467) (← links)
- Modal Satisfiability via SMT Solving (Q5256336) (← links)
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving (Q6108819) (← links)