A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as \"It is true at no fewer than...
| Автори: | , |
|---|---|
| Формат: | Conference item |
| Опубліковано: |
IEEE
2015
|