scientific article
From MaRDI portal
Publication:3204443
zbMath0717.03006MaRDI QIDQ3204443
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
knowledgePSPACENPcomplexity of the decision problem for epistemic logics based on Montague and Scott's semantics
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
A non-minimal but very weak axiomatization of common belief ⋮ Belief closure: A semantics of common knowledge for modal propositional logic ⋮ Orthopartitions and possibility distributions ⋮ Epistemic closure and epistemic logic. I: Relevant alternatives and subjunctivism ⋮ Tractable reasoning using logic programs with intensional concepts ⋮ Complexity of the universal theory of modal algebras ⋮ Reaching agreements through argumentation: a logical model and implementation ⋮ SAT-based explicit LTL reasoning and its application to satisfiability checking ⋮ NP reasoning in the monotone \(\mu\)-calculus ⋮ Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics
