The Complexity of Non-Iterated Probabilistic Justification Logic

DOI10.1007/978-3-319-30024-5_16zbMath1459.03026arXiv1507.05500OpenAlexW2478189217MaRDI QIDQ2807085

Ioannis Kokkinis

Publication date: 19 May 2016

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

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

zbMATH Keywords

complexityderivabilitysatisfiabilityjustification logicprobabilistic logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logics of knowledge and belief (including belief change) (03B42) Probability and inductive logic (03B48)

Related Items (2)

Justification logic with confidence ⋮ The complexity of satisfiability in non-iterated and iterated probabilistic logics

This page was built for publication: The Complexity of Non-Iterated Probabilistic Justification Logic