Thomas Studer

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 43

Top Topics

Logical Framework

Providing Personalized

Top Venues

J. Log. Comput.

Publications

Christian Cachin, David Lehnherr, Thomas Studer
Synergistic Knowledge. CoRR (2024)
Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer
Consistency and permission in deontic justification logic. J. Log. Comput. 34 (4) (2024)
Christian Cachin, David Lehnherr, Thomas Studer
Synergistic Knowledge. SSS (2023)
Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao
What Do You Care About: Inferring Values from Emotions. AAMAS (2023)
Jieting Luo, Thomas Studer, Mehdi Dastani
Providing Personalized Explanations: A Conversational Approach. CLAR (2023)
Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer
Impossible and Conflicting Obligations in Justification Logic. CoRR (2023)
Eveline Lehmann, Thomas Studer
Belief Expansion in Subset Models. CoRR (2023)
Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao
What Do You Care About: Inferring Values from Emotions. CoRR (2023)
Jieting Luo, Thomas Studer, Mehdi Dastani
Providing personalized Explanations: a Conversational Approach. CoRR (2023)
Christian Cachin, David Lehnherr, Thomas Studer
Modal and Justification Logics for Multi-agent Systems (Invited Talk). CLAR (2023)
Federico L. G. Faroldi, Atefeh Rohani, Thomas Studer
Conditional Obligations in Justification Logic. WoLLIC (2023)
Thomas Studer
The logic of temporal domination. CoRR (2023)
David Lehnherr, Zoran Ognjanovic, Thomas Studer
A logic of interactive proofs. J. Log. Comput. 32 (8) (2022)
Olivier Stähli, Thomas Ost, Thomas Studer
Development of an AI-based bioacoustic wolf monitoring system. FLAIRS (2022)
David Lehnherr, Zoran Ognjanovic, Thomas Studer
A Logic of Interactive Proofs. LFCS (2022)
David Lehnherr, Zoran Ognjanovic, Thomas Studer
A logic of interactive proofs. CoRR (2021)
Michael Baur, Thomas Studer
Semirings of Evidence. J. Log. Comput. 31 (8) (2021)
Atefeh Rohani, Thomas Studer
Explicit non-normal modal logic. CoRR (2021)
Atefeh Rohani, Thomas Studer
Explicit Non-normal Modal Logic. WoLLIC (2021)
Chao Xu, Yanjing Wang, Thomas Studer
A logic of knowing why. Synth. 198 (2) (2021)
Kai Brünnler, Dandolo Flumini, Thomas Studer
A logic of blockchain updates. J. Log. Comput. 30 (8) (2020)
Thomas Studer
No-Go Theorems for Data Privacy. CoRR (2020)
Michael Baur, Thomas Studer
Semirings of Evidence. CLAR (2020)
Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
Probabilistic justification logic. J. Log. Comput. 30 (1) (2020)
Zvonimir Sikic, Silvia Ghilezan, Zoran Ognjanovic, Thomas Studer
Logic and Applications - LAP Meeting. Logic, Language, and Security (2020)
Eveline Lehmann, Thomas Studer
Belief Expansion in Subset Models. LFCS (2020)
Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Thomas Studer
A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. J. Log. Comput. 29 (5) (2019)
Eveline Lehmann, Thomas Studer
Subset Models for Justification Logic. WoLLIC (2019)
Hamzeh Mohammadi, Thomas Studer
Bayesian Confirmation and Justifications. ECSQARU (2019)
Thomas Studer
The Logic of Temporal Domination. RIVF (2019)
Dragan Doder, Zoran Ognjanovic, Nenad Savic, Thomas Studer
Incomplete Information and Justifications. TbiLLC (2019)
Nenad Savic, Thomas Studer
Relevant Justification Logic. FLAP 6 (2) (2019)
Nenad Savic, Thomas Studer
Public Announcements for Epistemic Models and Hypertheories. ICLA (2019)
Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Dragan Doder, Thomas Studer
Probabilistic Consensus of the Blockchain Protocol. ECSQARU (2019)
Michel Marti, Thomas Studer
The Internalized Disjunction Property for Intuitionistic Justification Logic. Advances in Modal Logic (2018)
Kai Brünnler, Dandolo Flumini, Thomas Studer
A Logic of Blockchain Updates. LFCS (2018)
Samuel Bucheli, Meghdad Ghari, Thomas Studer
Temporal Justification Logic. M4M@ICLA (2017)
Kai Brünnler, Dandolo Flumini, Thomas Studer
A Logic of Blockchain Updates. CoRR (2017)
Zoran Ognjanovic, Nenad Savic, Thomas Studer
Justification Logic with Approximate Conditional Probabilities. LORI (2017)
Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
Probabilistic Justification Logic. LFCS (2016)
Michel Marti, Thomas Studer
Modular Models for Intuitionistic Justification Logic. CoRR (2016)
Michel Marti, Thomas Studer
Intuitionistic Modal Logic made Explicit. FLAP 3 (5) (2016)
Roman Kuznets, Thomas Studer
Weak arithmetical interpretations for the Logic of Proofs. Log. J. IGPL 24 (3) (2016)
Thomas Studer
Justification logic enjoys the strong finite model property. CoRR (2015)
Ioannis Kokkinis, Petar Maksimovic, Zoran Ognjanovic, Thomas Studer
First steps towards probabilistic justification logic. Log. J. IGPL 23 (4) (2015)
Thomas Studer, Johannes Werner
Censors for Boolean Description Logic. Trans. Data Priv. 7 (3) (2014)
Luca Alberucci, Jürg Krähenbühl, Thomas Studer
Justifying induction on modal μ-formulae. Log. J. IGPL 22 (6) (2014)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Realizing public announcements by justifications. J. Comput. Syst. Sci. 80 (6) (2014)
Thomas Studer
Decidability for some justification logics with negative introspection. J. Symb. Log. 78 (2) (2013)
Thomas Studer
A Universal Approach to Guarantee Data Privacy. Logica Universalis 7 (2) (2013)
Roman Kuznets, Thomas Studer
Update as Evidence: Belief Expansion. LFCS (2013)
Grigori Mints, Thomas Studer
Cut-elimination for the mu-calculus with one variable FICS (2012)
Kai Brünnler, Thomas Studer
Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Log. 163 (12) (2012)
Roman Kuznets, Thomas Studer
Justifications, Ontology, and Conservativity. Advances in Modal Logic (2012)
Thomas Studer
Justified Terminological Reasoning. Ershov Memorial Conference (2011)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Justifications for common knowledge. J. Appl. Non Class. Logics 21 (1) (2011)
Thomas Studer
An Application of Justification Logic to Protocol Verification. CIS (2011)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Decidability for Justification Logics Revisited. TbiLLC (2011)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Partial Realization in Dynamic Justification Logic. WoLLIC (2011)
Gerhard Jäger, Thomas Studer
A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis 5 (1) (2011)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Two Ways to Common Knowledge. Electron. Notes Theor. Comput. Sci. 262 (2010)
Samuel Bucheli, Roman Kuznets, Thomas Studer
Explicit Evidence Systems with Common Knowledge CoRR (2010)
Thomas Studer
Common knowledge does not have the Beth property. Inf. Process. Lett. 109 (12) (2009)
Thomas Studer
Privacy Preserving Modules for Ontologies. Ershov Memorial Conference (2009)
Kai Brünnler, Thomas Studer
Syntactic Cut-elimination for Common Knowledge. Electron. Notes Theor. Comput. Sci. 231 (2009)
Phiniki Stouppa, Thomas Studer
Data Privacy for Knowledge Bases. LFCS (2009)
Kai Brünnler, Thomas Studer
Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Log. 160 (1) (2009)
Thomas Studer
On the Proof Theory of the Modal mu-Calculus. Stud Logica 89 (3) (2008)
Gerhard Jäger, Mathis Kretz, Thomas Studer
Canonical completeness of infinitary mu. J. Log. Algebraic Methods Program. 76 (2) (2008)
Kai Brünnler, Dieter Probst, Thomas Studer
On contraction and the modal fragment. Math. Log. Q. 54 (4) (2008)
David Steiner, Thomas Studer
Total Public Announcements. LFCS (2007)
Gerhard Jäger, Mathis Kretz, Thomas Studer
Cut-free common knowledge. J. Appl. Log. 5 (4) (2007)
Norbert Kottmann, Thomas Studer
Improving Semantic Query Answering. DEXA (2007)
Mathis Kretz, Thomas Studer
Deduction chains for common knowledge. J. Appl. Log. 4 (3) (2006)
Phiniki Stouppa, Thomas Studer
A Formal Model of Data Privacy. Ershov Memorial Conference (2006)
Kilian Stoffel, Thomas Studer
Provable Data Privacy. DEXA (2005)
Thomas Studer
Explicit mathematics: power types and overloading. Ann. Pure Appl. Log. 134 (2-3) (2005)
Michael Dürig, Thomas Studer
Probabilistic ABox Reasoning: Preliminary Results. Description Logics (2005)
Gerhard Jäger, Thomas Studer
of explicit mathematics: the limit and Mahlo axioms. Ann. Pure Appl. Log. 114 (1-3) (2002)
Reinhard Kahle, Thomas Studer
Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. 49 (1-2) (2001)
Thomas Studer
Constructive Foundations for Featherweight Java. Proof Theory in Computer Science (2001)
Gerhard Jäger, Reinhard Kahle, Thomas Studer
Universes in explicit mathematics. Ann. Pure Appl. Log. 109 (3) (2001)
Dieter Probst, Thomas Studer
How to normalize the Jay. Theor. Comput. Sci. 254 (1-2) (2001)
Thomas Studer
A Semantics for [lambda]: a Calculus with Overloading and Late-binding. J. Log. Comput. 11 (4) (2001)
Reinhard Kahle, Thomas Studer
. CSL (2000)