NEXP-Completeness and Universal Hardness Results for Justification Logic

DOI10.1007/978-3-319-20297-6_3zbMath1464.68333arXiv1503.00362OpenAlexW1565822158MaRDI QIDQ3194706

Antonis Achilleos

Publication date: 20 October 2015

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

Full work available at URL: https://arxiv.org/abs/1503.00362

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Modal Logics with Hard Diamond-Free Fragments ⋮ NEXP-Completeness and Universal Hardness Results for Justification Logic ⋮ The complexity of satisfiability in non-iterated and iterated probabilistic logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower complexity bounds in justification logic
• The logic of proofs, semantically
• Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
• Interacting explicit evidence systems
• Complexity results for classes of quantificational formulas
• A complexity question in justification logic
• On the complexity of the reflected logic of proofs
• Explicit Provability and Constructive Semantics
• On the Complexity of Two-Agent Justification Logic
• NEXP-Completeness and Universal Hardness Results for Justification Logic
• Self-referentiality of Justified Knowledge
• Justification Logic
• THE LOGIC OF JUSTIFICATION

This page was built for publication: NEXP-Completeness and Universal Hardness Results for Justification Logic