TY - CONF
T1 - Temporal Justification Logic
T2 - Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017
Y1 - 2017
A1 - Samuel Bucheli
A1 - Ghari, Meghdad
A1 - Thomas Studer
ED - Ghosh, Sujata
ED - Ramanujam, R.
JF - Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017
PB - Open Publishing Association
UR - http://www.iam.unibe.ch/ltgpub/2017/bgs17.pdf
ER -
TY - JOUR
T1 - Realizing Public Announcements by Justifications
JF - Journal of Computer and System Sciences
Y1 - 2014
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
KW - Belief revision
KW - Dynamic epistemic logic
KW - justification logic
KW - Public announcements
AB - Modal public announcement logics study how beliefs change after public announcements. However, these logics cannot express the reason for a new belief. Justification logics fill this gap since they can formally represent evidence and justifications for an agent's belief. We present ${\sf OPAL(K)}$ and ${\sf JPAL(K)}$, two alternative justification counterparts of Gerbrandy–Groeneveld's public announcement logic ${\sf PAL(K)}$. We show that ${\sf PAL(K)}$ is the forgetful projection of both ${\sf OPAL(K)}$ and ${\sf JPAL(K)}$. We also establish that ${\sf JPAL(K)}$ partially realizes ${\sf PAL(K)}$. The question whether a similar result holds for ${\sf OPAL(K)}$ is still open.
VL - 80
UR - http://www.iam.unibe.ch/ltgpub/2012/bks12a.pdf
ER -
TY - CHAP
T1 - Decidability for Justification Logics Revisited
T2 - Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers
Y1 - 2013
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
ED - Guram Bezhanishvili
ED - Sebastian Löbner
ED - Vincenzo Marra
ED - Frank Richter
KW - decidability
KW - filtration
KW - justification logic
AB - Justification logics are propositional modal-like logics that instead of statements \emph{$A$ is known} include statements of the form \emph{$A$ is known for reason $t$} where the term $t$ can represent an informal justification for $A$ or a formal proof of $A$. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in order to obtain decidability results. Apart from reproving already known results in a uniform way, we also prove new results. In particular, we use our submodel construction to establish decidability for a justification logic with common knowledge for which so far no decidability proof was available.
JF - Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers
PB - Springer
VL - 7758
UR - http://www.iam.unibe.ch/ltgpub/2013/bks13.pdf
ER -
TY - Generic
T1 - Justification Logics with Common Knowledge
Y1 - 2012
A1 - Samuel Bucheli
PB - Universität Bern
CY - Institut für Informatik und angewandte Mathematik
UR - http://www.iam.unibe.ch/ltgpub/2012/buc12.pdf
ER -
TY - JOUR
T1 - Justifications for Common Knowledge
JF - Journal of Applied Non-classical Logics
Y1 - 2011
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
ED - Valentin Goranko
ED - Wojtek Jamroga
VL - 21
UR - http://www.iam.unibe.ch/ltgpub/2011/bks11a.pdf
IS - 1
N1 - To appear, 2011
ER -
TY - CONF
T1 - Partial Realization in Dynamic Justification Logic
T2 - Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings
Y1 - 2011
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
ED - Lev Beklemishev
ED - de Queiroz, Ruy
JF - Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings
T3 - Lecture Notes in Artificial Intelligence
VL - 6642
UR - http://www.iam.unibe.ch/ltgpub/2011/bks11b.pdf
ER -
TY - Generic
T1 - Explicit Evidence Systems with Common Knowledge
Y1 - 2010
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
AB - Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs $\mathsf{LP}$. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of $\mathsf{LP}$. We discuss the relationship of our logic to the multi-agent modal logic $\mathsf{S4}$ with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic.
PB - arXiv.org
UR - http://arxiv.org/abs/1005.0484
ER -
TY - CONF
T1 - Justified Belief Change
T2 - Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10)
Y1 - 2010
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Renne, Bryan
A1 - Sack, Joshua
A1 - Thomas Studer
ED - Arrazola, Xabier
ED - Ponte, Mar\'ıa
AB - Justification Logic is a framework for reasoning about evidence and justification. Public Announcement Logic is a framework for reasoning about belief changes caused by public announcements. This paper develops JPAL, a dynamic justification logic of public announcements that corresponds to the modal theory of public announcements due to Gerbrandy and Groeneveld. JPAL allows us to reason about evidence brought about by and changed by Gerbrandy–Groeneveld-style public announcements.
JF - Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10)
PB - University of the Basque Country Press
UR - http://www.iam.unibe.ch/ltgpub/2010/bkrss10.pdf
ER -
TY - CONF
T1 - Two Ways to Common Knowledge
T2 - Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009
Y1 - 2010
A1 - Samuel Bucheli
A1 - Roman Kuznets
A1 - Thomas Studer
ED - Thomas Bolander
ED - Torben Braüner
KW - proof theory
AB - It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towards such a system. We argue that the standard induction rule is not well suited to axiomatize evidence-based common knowledge. As an alternative, we study two different deductive systems for the logic of common knowledge. The first system makes use of an induction axiom whereas the second one is based on co-inductive proof theory. We show the soundness and completeness for both systems.
JF - Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009
T3 - Electronic Notes in Theoretical Computer Science
PB - Elsevier
UR - http://www.iam.unibe.ch/ltgpub/2010/bks10a.pdf
ER -
TY - Generic
T1 - Explicit Mathematics with Positive Existential Stratified Comprehension, Join and Uniform Monotone Inductive Definitions
Y1 - 2008
A1 - Samuel Bucheli
PB - Universität Bern
CY - Institut für Informatik und angewandte Mathematik
UR - http://www.iam.unibe.ch/ltgpub/2008/buc08.pdf
ER -