31,944 research outputs found
Probabilistic justification logic
We present a probabilistic justification logic, PPJâ , as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for PPJ with respect to the class of so-called measurable Kripke-like models and show that the satisfiability problem is decidable. We discuss how PPJ provides insight into the well-known lottery paradox
Subset models for justification logic
We introduce a new semantics for justification logic based on subset
relations. Instead of using the established and more symbolic interpretation of
justifications, we model justifications as sets of possible worlds. We
introduce a new justification logic that is sound and complete with respect to
our semantics. Moreover, we present another variant of our semantics that
corresponds to traditional justification logic.
These types of models offer us a versatile tool to work with justifications,
e.g.~by extending them with a probability measure to capture uncertain
justifications. Following this strategy we will show that they subsume
Artemov's approach to aggregating probabilistic evidence
Uncertain Reasoning in Justification Logic
This thesis studies the combination of two well known formal systems for knowledge representation: probabilistic logic and justification logic. Our aim is to design a formal framework that allows the analysis of epistemic situations with incomplete information. In order to achieve this we introduce two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. We prove soundness and completeness theorems for our logics and establish decidability procedures. Both our logics rely on an infinitary rule so that strong completeness can be achieved. One of the most interesting mathematical results for our logics is the fact that adding only one iteration of the probability operator to the justification logic J does not increase the computational complexity of the logic
Probabilistic Justification Logic
Justification logics are constructive analogues of modal logics. They are often used as epistemic logics, particularly as models of evidentialist justification. However, in this role, justification (and modal) logics are defective insofar as they represent justification with a necessity-like operator, whereas actual evidentialist justification is usually probabilistic. This paper first examines and rejects extant candidates for solving this problem: Milnikelâs Logic of Uncertain Justifications, Ghariâs HĂĄjekâPavelka-Style Justification Logics and a version of probabilistic justification logic developed by Kokkinis et al. It then proposes a new solution to the problem in the form of a justification logic that incorporates the essential features of both a fuzzy logic and a probabilistic logic
Bayesian Confirmation and Justifications
We introduce a family of probabilistic justification logics that feature Bayesian confirmations. Our logics include new justification terms representing evidence that make a proposition firm in the sense of making it more probable. We present syntax and semantics of our logic and establish soundness and strong completeness. Moreover, we show how to formalize in our logic the screening-off condition for transitivity of Bayesian confirmations
Bayesian Confirmation and Justifications
We introduce a family of probabilistic justification logics that feature Bayesian confirmations. Our logics include new justification terms representing evidence that make a proposition firm in the sense of making it more probable. We present syntax and semantics of our logic and establish soundness and strong completeness. Moreover, we show how to formalize in our logic the screening-off condition for transitivity of Bayesian confirmations
The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic
Probabilistic choice, where each branch of a choice is weighted according to a probability distribution, is an established approach for modelling processes, quantifying uncertainty in the environment and other sources of randomness. This paper uncovers new insight showing probabilistic choice has a purely logical interpretation as an operator in an extension of linear logic. By forbidding projection and injection, we reveal additive operators between the standard with and plus operators of linear logic. We call these operators the sub-additives. The attention of the reader is drawn to two sub-additive operators: the first being sound with respect to probabilistic choice; while the second arises due to the fact that probabilistic choice cannot be self-dual, hence has a de Morgan dual counterpart. The proof theoretic justification for the sub-additives is a cut elimination result, employing a technique called decomposition. The justification from the perspective of modelling probabilistic concurrent processes is that implication is sound with respect to established notions of probabilistic refinement, and is fully compositional
- âŠ