Results 11  20
of
231
Explicit Logics of Knowledge and Conservativity
, 2008
"... Several justification logics have evolved, starting with the logic LP, (Artemov 2001). These can be thought of as explicit versions of modal logics, or logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justifica ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Several justification logics have evolved, starting with the logic LP, (Artemov 2001). These can be thought of as explicit versions of modal logics, or logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit
Justification logics and conservative extensions
 CUNY Ph.D. Program in Computer Science
, 2007
"... Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come
The Logic of Justification
 Cornell University
, 2008
"... We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read t is a justification for F. Justification Logic absorbs basic principles origin ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the wellknown Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a robust system of justifications
Provability logic
 Handbook of Philosophical Logic, 2nd ed
, 2004
"... We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read t is a justification for F. Justification Logic absorbs basic principles origin ..."
Abstract

Cited by 44 (14 self)
 Add to MetaCart
originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the wellknown Justified True Belief vs. Knowledge problem. As a case study, we formalize Gettier examples in Justification Logic and reveal hidden assumptions and redundancies in Gettier
Updating Beliefs with Incomplete Observations
"... Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental problem in general, and of particular interest for Bayesian networks. Recently, Gr unwald and Halpern have shown that co ..."
Abstract

Cited by 46 (14 self)
 Add to MetaCart
that commonly used updating strategies fail in this case, except under very special assumptions. In this paper we propose a new method for updating probabilities with incomplete observations. Our approach is deliberately conservative: we make no assumptions about the socalled incompleteness mechanism
UPDATING BELIEFS WITH INCOMPLETE OBSERVATIONS
"... ABSTRACT. Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental problem in general, and of particular interest for Bayesian networks. Recently, Grünwald and Halpern have shown t ..."
Abstract
 Add to MetaCart
that commonly used updating strategies fail in this case, except under very special assumptions. In this paper we propose a new method for updating probabilities with incomplete observations. Our approach is deliberately conservative: we make no assumptions about the socalled incompleteness mechanism
DEFINING KNOWLEDGE IN TERMS OF BELIEF: THE MODAL LOGIC PERSPECTIVE
"... Abstract. The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last 50 years, is studied here in the framework of epistemic and doxastic logics. Three notions of definability are considered: explicit definability, implicit defi ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last 50 years, is studied here in the framework of epistemic and doxastic logics. Three notions of definability are considered: explicit definability, implicit
Justifications, Ontology, and Conservativity
"... Artemov recently presented an ontologically transparent semantics for justifications that interprets justifications as sets of formulas they justify. However, this semantics of modular models has only been studied for the case of the basic justification logic J, corresponding to the modal logic K, a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Artemov recently presented an ontologically transparent semantics for justifications that interprets justifications as sets of formulas they justify. However, this semantics of modular models has only been studied for the case of the basic justification logic J, corresponding to the modal logic K
A Conservative Approach to Distributed Belief Fusion
 In Proc. of the Third International Conference on Information Fusion
, 2000
"... In this paper, we develop logics for merging beliefs of agents with di#erent degrees of reliability. The logics are obtained by combining the multiagent epistemic logic from [8] and multisources reasoning systems from [2]. Every ordering for the reliability of the agents is represented by a modal o ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
In this paper, we develop logics for merging beliefs of agents with di#erent degrees of reliability. The logics are obtained by combining the multiagent epistemic logic from [8] and multisources reasoning systems from [2]. Every ordering for the reliability of the agents is represented by a modal
Analysis of Cryptographic Protocols using Logics of Belief: an Overview
, 2001
"... When designing a cryptographic protocol or explaining it, one often uses arguments such as "since this message was signed by machine B, machine A can be sure it came from B" in informal proofs justifying how the protocol works. Since it is, in such informal proofs, often easy to overlook a ..."
Abstract
 Add to MetaCart
an essential assumption, such as a trust relation or the belief that a message is not a replay from a previous session, it seems desirable to write such proofs in a formal system. While such logics do not replace the recent techniques of automatic proofs of safety properties, they help in pointing
Results 11  20
of
231