The following pages link to Generalized modal satisfiability (Q988571):
Displaying 16 items.
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Semantics and computation of the generalized modus ponens: The long paper (Q582262) (← links)
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691) (← links)
- Complexity results for modal dependence logic (Q1956378) (← links)
- Complexity of Model Checking for Modal Dependence Logic (Q2891371) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- Generalised modal realisation as a practical and efficient tool for FWL implementation (Q3015116) (← links)
- Generalized Davis-Putnam and satisfiability problems in mathematics (Q3577911) (← links)
- Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
- On the complexity of elementary modal logics (Q4910732) (← links)
- Modal Satisfiability via SMT Solving (Q5256336) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
- Generalized Modal Satisfiability (Q5449825) (← links)
