Switch to: References

Citations of:

First steps towards probabilistic justification logic

Ioannis Kokkinis, Petar Maksimović, Zoran Ognjanović & Thomas Studer

Logic Journal of the IGPL 23 (4):662-687 (2015)

Add citations

You must login to add citations.

Probabilistic Justification Logic.Joseph Lurie - 2018 - Philosophies 3 (1):2.details 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 (...) Download Export citation Bookmark 1 citation
A logic of defeasible argumentation: Constructing arguments in justification logic.Stipe Pandžić - 2022 - Argument and Computation 13 (1):3-47.details In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a logic of structured defeasible arguments using the language of justification logic. In this logic, we introduce defeasible justification assertions of the type t : F that read as “t is a defeasible reason that justifies F”. Such formulas are then interpreted as arguments and their acceptance semantics is given (...) Download Export citation Bookmark
Temporal Justification Logic.S. Bucheli, M. Ghari & T. Studer - 2017 - Proceedings of the Ninth Workshop on Methods for Modalities (M4M9 2017), Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017, Electronic Proceedings in Theoretical Computer Science 243, Pages 59–74.details Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic. Download Export citation Bookmark 1 citation
Pavelka-style fuzzy justification logics.Meghdad Ghari - 2016 - Logic Journal of the IGPL 24 (5):743-773.details Justification logics provide a framework for reasoning about justifications and evidence. In this article, we study a fuzzy variant of justification logics in which an agent’s justification for a belief has certainty degree between 0 and 1. We replace the classical base of justification logics with Hájek’s rational Pavelka logic. We introduce fuzzy possible world semantics with crisp accessibility relation and also single world models for our logics. We establish soundness and graded-style completeness for both kinds of semantics. We also (...) Download Export citation Bookmark 7 citations
Probability Logics for Reasoning About Quantum Observations.Angelina Ilić Stepić, Zoran Ognjanović & Aleksandar Perović - 2023 - Logica Universalis 17 (2):175-219.details In this paper we present two families of probability logics (denoted _QLP_ and \(QLP^{ORT}\) ) suitable for reasoning about quantum observations. Assume that \(\alpha \) means “O = a”. The notion of measuring of an observable _O_ can be expressed using formulas of the form \(\square \lozenge \alpha \) which intuitively means “if we measure _O_ we obtain \(\alpha \) ”. In that way, instead of non-distributive structures (i.e., non-distributive lattices), it is possible to relay on classical logic extended with (...) Download Export citation Bookmark
How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.details Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) Download Export citation Bookmark 1 citation
Justification Logic with Confidence.Ted Shear & John Quiggin - 2020 - Studia Logica 108 (4):751-778.details Justification logics are a family of modal logics whose non-normal modalities are parametrised by a type-theoretic calculus of terms. The first justification logic was developed by Sergei Artemov to provide an explicit modal logic for arithmetical provability in which these terms were taken to pick out proofs. But, justification logics have been given various other interpretations as well. In this paper, we will rely on an interpretation in which the modality \ is read ‘S accepts \ as justification for \’. (...) Download Export citation Bookmark 2 citations

1