Thomas Studer

CoRR, 2023

Conditional Obligations in Justification Logic.

[BibT_eX]

[DOI]

Federico L. G. Faroldi

Atefeh Rohani

Proceedings of the Logic, Language, Information, and Computation, 2023

Synergistic Knowledge.

[BibT_eX]

[DOI]

Christian Cachin

David Lehnherr

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Providing Personalized Explanations: A Conversational Approach.

[BibT_eX]

[DOI]

Jieting Luo

Mehdi Dastani

Proceedings of the Logic and Argumentation - 5th International Conference, 2023

Modal and Justification Logics for Multi-agent Systems (Invited Talk).

[BibT_eX]

[DOI]

Christian Cachin

David Lehnherr

Proceedings of the Logic and Argumentation - 5th International Conference, 2023

What Do You Care About: Inferring Values from Emotions.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

A logic of interactive proofs.

[BibT_eX]

[DOI]

David Lehnherr

Zoran Ognjanovic

J. Log. Comput., 2022

Development of an AI-based bioacoustic wolf monitoring system.

[BibT_eX]

[DOI]

Olivier Stähli

Thomas Ost

Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, 2022

2021

A logic of knowing why.

[BibT_eX]

[DOI]

Chao Xu

Yanjing Wang

Synth., 2021

Semirings of Evidence.

[BibT_eX]

[DOI]

Michael Baur

J. Log. Comput., 2021

Explicit Non-normal Modal Logic.

[BibT_eX]

[DOI]

Atefeh Rohani

Proceedings of the Logic, Language, Information, and Computation, 2021

2020

Probabilistic justification logic.

[BibT_eX]

[DOI]

Ioannis Kokkinis

Zoran Ognjanovic

J. Log. Comput., 2020

A logic of blockchain updates.

[BibT_eX]

[DOI]

Dandolo Flumini

J. Log. Comput., 2020

No-Go Theorems for Data Privacy.

[BibT_eX]

[DOI]

CoRR, 2020

Belief Expansion in Subset Models.

[BibT_eX]

[DOI]

Eveline Lehmann

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Logic and Applications - LAP Meeting.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2020

2019

A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol.

[BibT_eX]

[DOI]

J. Log. Comput., 2019

Relevant Justification Logic.

[BibT_eX]

[DOI]

Nenad Savic

FLAP, 2019

Subset Models for Justification Logic.

[BibT_eX]

[DOI]

Eveline Lehmann

Proceedings of the Logic, Language, Information, and Computation, 2019

Incomplete Information and Justifications.

[BibT_eX]

[DOI]

Proceedings of the Language, Logic, and Computation - 13th International Tbilisi Symposium, 2019

The Logic of Temporal Domination.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE-RIVF International Conference on Computing and Communication Technologies, 2019

Public Announcements for Epistemic Models and Hypertheories.

[BibT_eX]

[DOI]

Nenad Savic

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

Bayesian Confirmation and Justifications.

[BibT_eX]

[DOI]

Hamzeh Mohammadi

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2019

Probabilistic Consensus of the Blockchain Protocol.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2019

2018

The Internalized Disjunction Property for Intuitionistic Justification Logic.

[BibT_eX]

[DOI]

Michel Marti

Proceedings of the Advances in Modal Logic 12, 2018

2017

Temporal Justification Logic.

[BibT_eX]

[DOI]

Meghdad Ghari

Proceedings of the Ninth Workshop on Methods for Modalities, 2017

Justification Logic with Approximate Conditional Probabilities.

[BibT_eX]

[DOI]

Zoran Ognjanovic

Nenad Savic

Proceedings of the Logic, Rationality, and Interaction - 6th International Workshop, 2017

2016

Weak arithmetical interpretations for the Logic of Proofs.

[BibT_eX]

[DOI]

Log. J. IGPL, 2016

Intuitionistic Modal Logic made Explicit.

[BibT_eX]

[DOI]

Michel Marti

FLAP, 2016

Modular Models for Intuitionistic Justification Logic.

[BibT_eX]

[DOI]

Michel Marti

CoRR, 2016

2015

First steps towards probabilistic justification logic.

[BibT_eX]

[DOI]

Log. J. IGPL, 2015

Justification logic enjoys the strong finite model property.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Censors for Boolean Description Logic.

[BibT_eX]

[DOI]

Johannes Werner

Trans. Data Priv., 2014

Realizing public announcements by justifications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Justifying induction on modal μ-formulae.

[BibT_eX]

[DOI]

Luca Alberucci

Jürg Krähenbühl

Log. J. IGPL, 2014

2013

A Universal Approach to Guarantee Data Privacy.

[BibT_eX]

[DOI]

Logica Universalis, 2013

Decidability for some justification logics with negative introspection.

[BibT_eX]

[DOI]

J. Symb. Log., 2013

Update as Evidence: Belief Expansion.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012

Cut-elimination for the mu-calculus with one variable

[BibT_eX]

[DOI]

Grigori Mints

Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

Syntactic cut-elimination for a fragment of the modal mu-calculus.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

Justifications, Ontology, and Conservativity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 9, 2012

2011

A Buchholz Rule for Modal Fixed Point Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2011

Justifications for common knowledge.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2011

Partial Realization in Dynamic Justification Logic.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information and Computation, 2011

Decidability for Justification Logics Revisited.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, and Computation, 2011

Justified Terminological Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2011

An Application of Justification Logic to Protocol Verification.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Computational Intelligence and Security, 2011

2010

Explicit Evidence Systems with Common Knowledge

[BibT_eX]

[DOI]

CoRR, 2010

2009

Common knowledge does not have the Beth property.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Two Ways to Common Knowledge.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Methods for Modalities, 2009

Data Privacy for Knowledge Bases.

[BibT_eX]

[DOI]

Phiniki Stouppa

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Privacy Preserving Modules for Ontologies.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2009

2008

On the Proof Theory of the Modal mu-Calculus.

[BibT_eX]

[DOI]

Stud Logica, 2008

On contraction and the modal fragment.

[BibT_eX]

[DOI]

Dieter Probst

Math. Log. Q., 2008

Canonical completeness of infinitary mu.

[BibT_eX]

[DOI]

Mathis Kretz

J. Log. Algebraic Methods Program., 2008

2007

Cut-free common knowledge.

[BibT_eX]

[DOI]

Mathis Kretz

J. Appl. Log., 2007

Syntactic Cut-elimination for Common Knowledge.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Methods for Modalities, 2007

Total Public Announcements.

[BibT_eX]

[DOI]

David Steiner

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Improving Semantic Query Answering.

[BibT_eX]

[DOI]

Norbert Kottmann

Proceedings of the Database and Expert Systems Applications, 18th International Conference, 2007

2006

Deduction chains for common knowledge.

[BibT_eX]

[DOI]

Mathis Kretz

J. Appl. Log., 2006

A Formal Model of Data Privacy.

[BibT_eX]

[DOI]

Phiniki Stouppa

Proceedings of the Perspectives of Systems Informatics, 2006

2005

Explicit mathematics: power types and overloading.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

Probabilistic ABox Reasoning: Preliminary Results.

[BibT_eX]

[DOI]

Michael Dürig

Proceedings of the 2005 International Workshop on Description Logics (DL2005), 2005

Provable Data Privacy.

[BibT_eX]

[DOI]

Kilian Stoffel

Proceedings of the Database and Expert Systems Applications, 16th International Conference, 2005

2002

Extending the system T<sub>0</sub> of explicit mathematics: the limit and Mahlo axioms.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2002

2001

How to normalize the Jay.

[BibT_eX]

[DOI]

Dieter Probst

Theor. Comput. Sci., 2001

A Semantics for [lambda]: a Calculus with Overloading and Late-binding.

[BibT_eX]

[DOI]

J. Log. Comput., 2001

Formalizing non-termination of recursive programs.

[BibT_eX]

[DOI]

Reinhard Kahle

J. Log. Algebraic Methods Program., 2001

Universes in explicit mathematics.

[BibT_eX]

[DOI]

Reinhard Kahle

Ann. Pure Appl. Log., 2001

Constructive Foundations for Featherweight Java.

[BibT_eX]

[DOI]

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000

A Theory of Explicit Mathematics Equivalent to ID<sub>1</sub>.

[BibT_eX]

[DOI]

Reinhard Kahle