%0 Conference Paper
%B Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017
%D 2017
%T Temporal Justification Logic
%A Samuel Bucheli
%A Ghari, Meghdad
%A Thomas Studer
%E Ghosh, Sujata
%E Ramanujam, R.
%B Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017
%I Open Publishing Association
%P 59-74
%G eng
%U http://www.iam.unibe.ch/ltgpub/2017/bgs17.pdf
%0 Journal Article
%J Journal of Computer and System Sciences
%D 2014
%T Realizing Public Announcements by Justifications
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%K Belief revision
%K Dynamic epistemic logic
%K justification logic
%K Public announcements
%X 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.
%B Journal of Computer and System Sciences
%V 80
%P 1046-1066
%G eng
%U http://www.iam.unibe.ch/ltgpub/2012/bks12a.pdf
%R 10.1016/j.jcss.2014.04.001
%0 Book Section
%B Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers
%D 2013
%T Decidability for Justification Logics Revisited
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%E Guram Bezhanishvili
%E Sebastian Löbner
%E Vincenzo Marra
%E Frank Richter
%K decidability
%K filtration
%K justification logic
%X 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.
%B Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers
%I Springer
%V 7758
%P 166-181
%G eng
%U http://www.iam.unibe.ch/ltgpub/2013/bks13.pdf
%R 10.1007/978-3-642-36976-6_12
%0 Generic
%D 2012
%T Justification Logics with Common Knowledge
%A Samuel Bucheli
%I Universität Bern
%C Institut für Informatik und angewandte Mathematik
%G eng
%U http://www.iam.unibe.ch/ltgpub/2012/buc12.pdf
%9 phd
%0 Journal Article
%J Journal of Applied Non-classical Logics
%D 2011
%T Justifications for Common Knowledge
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%E Valentin Goranko
%E Wojtek Jamroga
%B Journal of Applied Non-classical Logics
%V 21
%P 35-60
%G eng
%U http://www.iam.unibe.ch/ltgpub/2011/bks11a.pdf
%N 1
%R 10.3166/JANCL.21.35-60
%0 Conference Paper
%B Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings
%D 2011
%T Partial Realization in Dynamic Justification Logic
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%E Lev Beklemishev
%E de Queiroz, Ruy
%B Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings
%S Lecture Notes in Artificial Intelligence
%V 6642
%P 35-51
%G eng
%U http://www.iam.unibe.ch/ltgpub/2011/bks11b.pdf
%R 10.1007/978-3-642-20920-8_9
%0 Generic
%D 2010
%T Explicit Evidence Systems with Common Knowledge
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%X 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.
%I arXiv.org
%8 may
%G eng
%U http://arxiv.org/abs/1005.0484
%9 E-print
%0 Conference Paper
%B Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10)
%D 2010
%T Justified Belief Change
%A Samuel Bucheli
%A Roman Kuznets
%A Renne, Bryan
%A Sack, Joshua
%A Thomas Studer
%E Arrazola, Xabier
%E Ponte, Mar\'ıa
%X 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.
%B Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10)
%I University of the Basque Country Press
%P 135-155
%G eng
%U http://www.iam.unibe.ch/ltgpub/2010/bkrss10.pdf
%0 Conference Paper
%B Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009
%D 2010
%T Two Ways to Common Knowledge
%A Samuel Bucheli
%A Roman Kuznets
%A Thomas Studer
%E Thomas Bolander
%E Torben Braüner
%K proof theory
%X 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.
%B Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009
%S Electronic Notes in Theoretical Computer Science
%I Elsevier
%P 83-98
%G eng
%U http://www.iam.unibe.ch/ltgpub/2010/bks10a.pdf
%R 10.1016/j.entcs.2010.04.007
%0 Generic
%D 2008
%T Explicit Mathematics with Positive Existential Stratified Comprehension, Join and Uniform Monotone Inductive Definitions
%A Samuel Bucheli
%I Universität Bern
%C Institut für Informatik und angewandte Mathematik
%G eng
%U http://www.iam.unibe.ch/ltgpub/2008/buc08.pdf
%9 masters