Switch to: References

Add citations

You must login to add citations.
  1. Probabilistic Justification Logic.Joseph Lurie - 2018 - Philosophies 3 (1):2.
    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 Note on Strong Axiomatization of Gödel Justification Logic.Nicholas Pischke - 2020 - Studia Logica 108 (4):687-724.
    Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators “t : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these operators, one can therefore not only reason about modal effects on propositions but also about dynamics inside the justifications themselves. We (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A logic of defeasible argumentation: Constructing arguments in justification logic.Stipe Pandžić - 2022 - Argument and Computation 13 (1):3-47.
    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  
  • Logic of confidence.Pavel Naumov & Jia Tao - 2015 - Synthese 192 (6):1821-1838.
    The article studies knowledge in multiagent systems where data available to the agents may have small errors. To reason about such uncertain knowledge, a formal semantics is introduced in which indistinguishability relations, commonly used in the semantics for epistemic logic S5, are replaced with metrics to capture how much two epistemic worlds are different from an agent’s point of view. The main result is a logical system sound and complete with respect to the proposed semantics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • First steps towards probabilistic justification logic.Ioannis Kokkinis, Petar Maksimović, Zoran Ognjanović & Thomas Studer - 2015 - Logic Journal of the IGPL 23 (4):662-687.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Pavelka-style fuzzy justification logics.Meghdad Ghari - 2016 - Logic Journal of the IGPL 24 (5):743-773.
    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  
  • 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.
    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