On the complexity of explicit modal logics

DOI10.1007/3-540-44622-2_25MaRDI QIDQ2753686zbMATH OpenFDO

Authors Roman Kuznets

Publication date 3 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44622-2_25

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of proofs (03F20) Logic programming (68N17)

Recommendations

• Making knowledge explicit: how hard it is
• Explicit provability and constructive semantics
• Derivability in certain subsystems of the logic of proofs is _2p-complete
• The logic of proofs, semantically
• Logic of proofs and provability

Cited in

(38)

• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• The complexity of satisfiability in non-iterated and iterated probabilistic logics
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• On the complexity of graded modal logics with converse
• Non-circular proofs and proof realization in modal logic
• A complexity question in justification logic
• Making knowledge explicit: how hard it is
• On the complexity of the reflected logic of proofs
• Referential logic of proofs
• On the relative complexity of labelled modal tableaux
• On the size of shortest modal descriptions
• The Logic of Justification
• Exemplaric Expressivity of Modal Logics
• NEXP-completeness and universal hardness results for justification logic
• Justification Logic
• Inf-datalog, Modal Logic and Complexities
• Tracking evidence
• Complexity Results for Modal Dependence Logic
• The NP-Completeness of Reflected Fragments of Justification Logics
• Conservativity for Logics of Justified Belief
• The logic of uncertain justifications
• Conservativity for logics of justified belief: two approaches
• Lower complexity bounds in justification logic
• A new method for bounding the complexity of modal logics
• NP trees and Carnap's modal logic
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
• scientific article; zbMATH DE number 847940 (Why is no real title available?)
• Justification Logics with Probability Operators
• Probabilistic justification logic
• Computer Science Logic
• Symmetric Logic of Proofs
• Modal logic and the polynomial hierarchy: from QBFs to K and back
• The Complexity of Decomposing Modal and First-Order Theories
• Tableaux and interpolation for propositional justification logics
• The logic of proofs, semantically
• Proof complexity of modal resolution
• Derivability in certain subsystems of the logic of proofs is _2p-complete
• Interacting explicit evidence systems

This page was built for publication: On the complexity of explicit modal logics

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