# The Complexity of Non-Iterated Probabilistic Justification Logic

```@inproceedings{Kokkinis2016TheCO,
title={The Complexity of Non-Iterated Probabilistic Justification Logic},
author={Ioannis Kokkinis},
booktitle={FoIKS},
year={2016}
}```
• Ioannis Kokkinis
• Published in FoIKS 20 July 2015
• Philosophy, Mathematics, Computer Science
The logic \$\$\mathsf {PJ}\$\$ is a probabilistic logic defined by adding non-iterated probability operators to the basic justification logic \$\$\mathsf {J}\$\$. In this paper we establish upper and lower bounds for the complexity of the derivability problem in the logic \$\$\mathsf {PJ}\$\$. The main result of the paper is that the complexity of the derivability problem in \$\$\mathsf {PJ}\$\$ remains the same as the complexity of the derivability problem in the underlying logic \$\$\mathsf {J}\$\$, which is…
6 Citations
Justification Logic with Confidence
• Philosophy
Stud Logica
• 2020
The justification logic with confidence is constructed, motivation is provided in terms of the notion of confidence deriving recent work by Paul and Quiggin, and axiomatise the semantics of JC to provide a sound and complete semantics.
The complexity of satisfiability in non-iterated and iterated probabilistic logics
• Ioannis Kokkinis
• Mathematics, Philosophy
Annals of Mathematics and Artificial Intelligence
• 2018
Tight complexity bounds are obtained for the satisfiability problem in PL and PPL when L is classical propositional logic or justification logic, which are parameterized in the complexity of satisfiability of conjunctions of positive and negative formulas that have neither a probabilistic nor a classical operator as a top-connective.
Probabilistic Justification Logic
• Philosophy, Mathematics
LFCS
• 2016
A probabilistic justification logic is presented to study rational belief, degrees of belief and justifications, and its satisfiability problem is decidable and it is used to provide a solution to the lottery paradox.
Uncertain Reasoning in Justification Logic
This thesis introduces two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J, and proves soundness and completeness theorems for these logics and establishes decidability procedures.
Justification Logic with Approximate Conditional Probabilities
• Philosophy, Computer Science
LORI
• 2017
A new logic of this kind, \(\mathsf {CPJ}\), is introduced, which extends justification logic and supports non-monotonic reasoning with and about evidences.
Probabilistic justification logic
• Philosophy
J. Log. Comput.
• 2020
A probabilistic justification logic, PPJ, is presented as a framework for uncertain reasoning about rational belief, degrees of belief and justifications and it is established that the satisfiability problem is decidable.