scientific article; zbMATH DE number 4181308

MaRDI QIDQ3204443zbMATH OpenFDO

Authors Moshe Y. Vardi

Publication date 1989

zbMATH Keywords

knowledgePSPACENPcomplexity of the decision problem for epistemic logics based on Montague and Scott's semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• A guide to completeness and complexity for modal logics of knowledge and belief
• Efficient reasoning in multiagent epistemic logics
• Some computational constraints in epistemic logic
• Epistemic logic and logical omniscience: A survey
• The Dynamics of Syntactic Knowledge

Cited in

(28)

• Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics
• Complexity of the universal theory of modal algebras
• On the finite model property of non-normal modal logics
• A new epistemic characterization of \(\varepsilon\)-proper rationalizability
• The Dynamics of Syntactic Knowledge
• Epistemic properties of knowledge hierarchies
• Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi
• Tractable reasoning using logic programs with intensional concepts
• Orthopartitions and possibility distributions
• A guide to completeness and complexity for modal logics of knowledge and belief
• scientific article; zbMATH DE number 2236617 (Why is no real title available?)
• Efficient reasoning in multiagent epistemic logics
• Reaching agreements through argumentation: a logical model and implementation
• Exploring the tractability border in epistemic tasks
• A non-minimal but very weak axiomatization of common belief
• scientific article; zbMATH DE number 1755761 (Why is no real title available?)
• Belief closure: A semantics of common knowledge for modal propositional logic
• An internal version of epistemic logic
• Revisiting Epistemic Specifications
• Epistemic closure and epistemic logic. I: Relevant alternatives and subjunctivism
• Situated Modeling of Epistemic Puzzles
• CoNP complexity for combinations of non-normal modal logics
• Resolution calculi for non-normal modal logics
• Non-normal Modal description logics
• An epistemic logic with hypotheses
• NP reasoning in the monotone \(\mu\)-calculus
• Some computational constraints in epistemic logic
• SAT-based explicit LTL reasoning and its application to satisfiability checking

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204443)