BriefGPT.xyz
May, 2009
关于分级模态逻辑可满足性问题复杂度的注记
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
HTML
PDF
Yevgeny Kazakov, Ian Pratt-Hartmann
TL;DR
本文研究了带有基数约束的分级模态逻辑在几个已知框架类别下的可满足性复杂度及其判定问题，并获得了紧密的复杂度界限，尤其是针对具有传递性框架的情况下缺乏树型模型性质的问题。
Abstract
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 augme
→