On the Complexity of Two-Agent Justification Logic

DOI10.1007/978-3-319-09764-0_1MaRDI QIDQ2921954zbMATH OpenOpenAlexFDO

Authors Antonis Achilleos

Publication date 14 October 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-09764-0_1

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Recommendations

• A complexity question in justification logic
• A complexity question in justification logic
• Argument evaluation in multi-agent justification logics
• Lower complexity bounds in justification logic
• Complexity of logics for multi-agent systems with restricted modal context
• Multi-agent justification logic: communication and evidence elimination
• scientific article; zbMATH DE number 5129607
• The complexity of non-iterated probabilistic justification logic
• Decidability for justification logics revisited

Cited in

(5)

• A complexity question in justification logic
• A complexity question in justification logic
• NEXP-completeness and universal hardness results for justification logic
• The NP-Completeness of Reflected Fragments of Justification Logics
• Lower complexity bounds in justification logic

This page was built for publication: On the Complexity of Two-Agent Justification Logic

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