Reasoning about knowledge
Models for the Logic of Proofs
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
On the Complexity of Explicit Modal Logics
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Making knowledge explicit: how hard it is
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On the complexity of the reflected logic of proofs
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Introducing Justification into Epistemic Logic
Journal of Logic and Computation
DKAL: Distributed-Knowledge Authorization Language
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Complexity issues in justification logic
Complexity issues in justification logic
Logical omniscience as a computational complexity problem
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Logic of proofs for bounded arithmetic
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Multi-agent explicit knowledge
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Partial realization in dynamic justification logic
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Justified terminological reasoning
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Distributed knowledge with justifications
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
| Hi-index | 0.00 |
In this case study we describe an approach to a general logical framework for tracking evidence within epistemic contexts. We consider as basic an example which features two justifications for a true statement, one which is correct and one which is not. We formalize this example in a system of Justification Logic with two knowers: the object agent and the observer, and we show that whereas the object agent does not logically distinguish between factive and non-factive justifications, such distinctions can be attained at the observer level by analyzing the structure of evidence terms. Basic logic properties of the corresponding two-agent Justification Logic system have been established, which include Kripke-Fitting completeness. We also argue that a similar evidence-tracking approach can be applied to analyzing paraconsistent systems.