Thomas Studer - RankMe

96 papers A 1B 7C 11Misc 8Journal 50Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Simplicial Belief. CoRR Christian Cachin, David Lehnherr, Thomas Studer
2025	J	`jnl`	Explicit non-normal modal logic. J. Log. Comput. Atefeh Rohani, Thomas Studer
2025	J	`jnl`	Hypergraph Semantics for Doxastic Logics. CoRR Hans van Ditmarsch, Djanira Gomes, David Lehnherr, Valentin Müller, Thomas Studer
2025	J	`jnl`	Knowledge and Common Knowledge of Strategies. CoRR Borja Sierra-Miranda, Thomas Studer
2025	B	`conf`	Non-wellfounded Proof Theory for Interpretability Logic. TABLEAUX Sebastijan Horvat, Borja Sierra-Miranda, Thomas Studer
2025	B	`conf`	Simplicial Belief. SIROCCO Christian Cachin, David Lehnherr, Thomas Studer
2025	J	`jnl`	Synergistic knowledge. Theor. Comput. Sci. Christian Cachin, David Lehnherr, Thomas Studer
2025	—	`conf`	Temporal Logics Meet Real-World Software Requirements: A Reality Check. FormaliSE Roman Bögli, Atefeh Rohani, Thomas Studer, Christos Tsigkanos, Timo Kehrer
2024	B	`conf`	Coalgebraic Proof Translations for Non-Wellfounded Proofs. AiML Borja Sierra-Miranda, Thomas Studer, Lukas Zenger
2024	J	`jnl`	Consistency and permission in deontic justification logic. J. Log. Comput. Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer
2024	C	`ed.`	Logic, Language, Information, and Computation - 30th International Workshop, WoLLIC 2024, Bern, Switzerland, June 10-13, 2024, Proceedings WoLLIC George Metcalfe, Thomas Studer, Ruy J. G. B. de Queiroz
2024	J	`jnl`	Synergistic Knowledge. CoRR Christian Cachin, David Lehnherr, Thomas Studer
2023	J	`jnl`	Belief Expansion in Subset Models. CoRR Eveline Lehmann, Thomas Studer
2023	C	`conf`	Conditional Obligations in Justification Logic. WoLLIC Federico L. G. Faroldi, Atefeh Rohani, Thomas Studer
2023	J	`jnl`	Impossible and Conflicting Obligations in Justification Logic. CoRR Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer
2023	—	`conf`	Modal and Justification Logics for Multi-agent Systems (Invited Talk). CLAR Christian Cachin, David Lehnherr, Thomas Studer
2023	—	`conf`	Providing Personalized Explanations: A Conversational Approach. CLAR Jieting Luo, Thomas Studer, Mehdi Dastani
2023	J	`jnl`	Providing personalized Explanations: a Conversational Approach. CoRR Jieting Luo, Thomas Studer, Mehdi Dastani
2023	C	`conf`	Synergistic Knowledge. SSS Christian Cachin, David Lehnherr, Thomas Studer
2023	J	`jnl`	The logic of temporal domination. CoRR Thomas Studer
2023	A	`conf`	What Do You Care About: Inferring Values from Emotions. AAMAS Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao
2023	J	`jnl`	What Do You Care About: Inferring Values from Emotions. CoRR Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao
2022	Misc	`conf`	A Logic of Interactive Proofs. LFCS David Lehnherr, Zoran Ognjanovic, Thomas Studer
2022	J	`jnl`	A logic of interactive proofs. J. Log. Comput. David Lehnherr, Zoran Ognjanovic, Thomas Studer
2022	Misc	`conf`	Development of an AI-based bioacoustic wolf monitoring system. FLAIRS Olivier Stähli, Thomas Ost, Thomas Studer
2021	J	`jnl`	A logic of interactive proofs. CoRR David Lehnherr, Zoran Ognjanovic, Thomas Studer
2021	J	`jnl`	A logic of knowing why. Synth. Chao Xu, Yanjing Wang, Thomas Studer
2021	C	`conf`	Explicit Non-normal Modal Logic. WoLLIC Atefeh Rohani, Thomas Studer
2021	J	`jnl`	Explicit non-normal modal logic. CoRR Atefeh Rohani, Thomas Studer
2021	J	`jnl`	Semirings of Evidence. J. Log. Comput. Michael Baur, Thomas Studer
2020	J	`jnl`	A logic of blockchain updates. J. Log. Comput. Kai Brünnler, Dandolo Flumini, Thomas Studer
2020	Misc	`conf`	Belief Expansion in Subset Models. LFCS Eveline Lehmann, Thomas Studer
2020	—	`conf`	Logic and Applications - LAP Meeting. Logic, Language, and Security Zvonimir Sikic, Silvia Ghilezan, Zoran Ognjanovic, Thomas Studer
2020	J	`jnl`	No-Go Theorems for Data Privacy. CoRR Thomas Studer
2020	J	`jnl`	Probabilistic justification logic. J. Log. Comput. Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
2020	—	`conf`	Semirings of Evidence. CLAR Michael Baur, Thomas Studer
2019	J	`jnl`	A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. J. Log. Comput. Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Thomas Studer
2019	C	`conf`	Bayesian Confirmation and Justifications. ECSQARU Hamzeh Mohammadi, Thomas Studer
2019	—	`conf`	Incomplete Information and Justifications. TbiLLC Dragan Doder, Zoran Ognjanovic, Nenad Savic, Thomas Studer
2019	C	`conf`	Probabilistic Consensus of the Blockchain Protocol. ECSQARU Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Dragan Doder, Thomas Studer
2019	—	`conf`	Public Announcements for Epistemic Models and Hypertheories. ICLA Nenad Savic, Thomas Studer
2019	J	`jnl`	Relevant Justification Logic. FLAP Nenad Savic, Thomas Studer
2019	C	`conf`	Subset Models for Justification Logic. WoLLIC Eveline Lehmann, Thomas Studer
2019	—	`conf`	The Logic of Temporal Domination. RIVF Thomas Studer
2018	Misc	`conf`	A Logic of Blockchain Updates. LFCS Kai Brünnler, Dandolo Flumini, Thomas Studer
2018	B	`ed.`	Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018 Advances in Modal Logic Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe, Thomas Studer
2018	B	`conf`	The Internalized Disjunction Property for Intuitionistic Justification Logic. Advances in Modal Logic Michel Marti, Thomas Studer
2017	J	`jnl`	A Logic of Blockchain Updates. CoRR Kai Brünnler, Dandolo Flumini, Thomas Studer
2017	—	`conf`	Justification Logic with Approximate Conditional Probabilities. LORI Zoran Ognjanovic, Nenad Savic, Thomas Studer
2017	—	`conf`	Temporal Justification Logic. M4M@ICLA Samuel Bucheli, Meghdad Ghari, Thomas Studer
2016	J	`jnl`	Intuitionistic Modal Logic made Explicit. FLAP Michel Marti, Thomas Studer
2016	J	`jnl`	Modular Models for Intuitionistic Justification Logic. CoRR Michel Marti, Thomas Studer
2016	Misc	`conf`	Probabilistic Justification Logic. LFCS Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
2016	J	`jnl`	Weak arithmetical interpretations for the Logic of Proofs. Log. J. IGPL Roman Kuznets, Thomas Studer
2015	J	`jnl`	First steps towards probabilistic justification logic. Log. J. IGPL Ioannis Kokkinis, Petar Maksimovic, Zoran Ognjanovic, Thomas Studer
2015	J	`jnl`	Justification logic enjoys the strong finite model property. CoRR Thomas Studer
2014	J	`jnl`	Censors for Boolean Description Logic. Trans. Data Priv. Thomas Studer, Johannes Werner
2014	J	`jnl`	Justifying induction on modal μ-formulae. Log. J. IGPL Luca Alberucci, Jürg Krähenbühl, Thomas Studer
2014	J	`jnl`	Realizing public announcements by justifications. J. Comput. Syst. Sci. Samuel Bucheli, Roman Kuznets, Thomas Studer
2013	J	`jnl`	A Universal Approach to Guarantee Data Privacy. Logica Universalis Thomas Studer
2013	J	`jnl`	Decidability for some justification logics with negative introspection. J. Symb. Log. Thomas Studer
2013	Misc	`conf`	Update as Evidence: Belief Expansion. LFCS Roman Kuznets, Thomas Studer
2012	—	`conf`	Cut-elimination for the mu-calculus with one variable FICS Grigori Mints, Thomas Studer
2012	B	`conf`	Justifications, Ontology, and Conservativity. Advances in Modal Logic Roman Kuznets, Thomas Studer
2012	J	`jnl`	Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Log. Kai Brünnler, Thomas Studer
2011	J	`jnl`	A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis Gerhard Jäger, Thomas Studer
2011	C	`conf`	An Application of Justification Logic to Protocol Verification. CIS Thomas Studer
2011	—	`conf`	Decidability for Justification Logics Revisited. TbiLLC Samuel Bucheli, Roman Kuznets, Thomas Studer
2011	J	`jnl`	Justifications for common knowledge. J. Appl. Non Class. Logics Samuel Bucheli, Roman Kuznets, Thomas Studer
2011	—	`conf`	Justified Terminological Reasoning. Ershov Memorial Conference Thomas Studer
2011	C	`conf`	Partial Realization in Dynamic Justification Logic. WoLLIC Samuel Bucheli, Roman Kuznets, Thomas Studer
2010	J	`jnl`	Explicit Evidence Systems with Common Knowledge CoRR Samuel Bucheli, Roman Kuznets, Thomas Studer
2009	J	`jnl`	Common knowledge does not have the Beth property. Inf. Process. Lett. Thomas Studer
2009	Misc	`conf`	Data Privacy for Knowledge Bases. LFCS Phiniki Stouppa, Thomas Studer
2009	—	`conf`	Privacy Preserving Modules for Ontologies. Ershov Memorial Conference Thomas Studer
2009	J	`jnl`	Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Log. Kai Brünnler, Thomas Studer
2009	—	`conf`	Two Ways to Common Knowledge. M4M Samuel Bucheli, Roman Kuznets, Thomas Studer
2008	J	`jnl`	Canonical completeness of infinitary mu. J. Log. Algebraic Methods Program. Gerhard Jäger, Mathis Kretz, Thomas Studer
2008	J	`jnl`	On contraction and the modal fragment. Math. Log. Q. Kai Brünnler, Dieter Probst, Thomas Studer
2008	J	`jnl`	On the Proof Theory of the Modal mu-Calculus. Stud Logica Thomas Studer
2007	J	`jnl`	Cut-free common knowledge. J. Appl. Log. Gerhard Jäger, Mathis Kretz, Thomas Studer
2007	C	`conf`	Improving Semantic Query Answering. DEXA Norbert Kottmann, Thomas Studer
2007	—	`conf`	Syntactic Cut-elimination for Common Knowledge. M4M Kai Brünnler, Thomas Studer
2007	Misc	`conf`	Total Public Announcements. LFCS David Steiner, Thomas Studer
2006	—	`conf`	A Formal Model of Data Privacy. Ershov Memorial Conference Phiniki Stouppa, Thomas Studer
2006	J	`jnl`	Deduction chains for common knowledge. J. Appl. Log. Mathis Kretz, Thomas Studer
2005	J	`jnl`	Explicit mathematics: power types and overloading. Ann. Pure Appl. Log. Thomas Studer
2005	—	`conf`	Probabilistic ABox Reasoning: Preliminary Results. Description Logics Michael Dürig, Thomas Studer
2005	C	`conf`	Provable Data Privacy. DEXA Kilian Stoffel, Thomas Studer
2002	J	`jnl`	Extending the system T Ann. Pure Appl. Log. Gerhard Jäger, Thomas Studer
2001	J	`jnl`	A Semantics for [lambda]: a Calculus with Overloading and Late-binding. J. Log. Comput. Thomas Studer
2001	—	`conf`	Constructive Foundations for Featherweight Java. Proof Theory in Computer Science Thomas Studer
2001	J	`jnl`	Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. Reinhard Kahle, Thomas Studer
2001	J	`jnl`	How to normalize the Jay. Theor. Comput. Sci. Dieter Probst, Thomas Studer
2001	J	`jnl`	Universes in explicit mathematics. Ann. Pure Appl. Log. Gerhard Jäger, Reinhard Kahle, Thomas Studer
2000	B	`conf`	A Theory of Explicit Mathematics Equivalent to ID CSL Reinhard Kahle, Thomas Studer