default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Studer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j33]Christian Cachin, David Lehnherr
, Thomas Studer:
Synergistic knowledge. Theor. Comput. Sci. 1023: 114902 (2025)- 2024
- [j32]Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer:
Consistency and permission in deontic justification logic. J. Log. Comput. 34(4): 640-664 (2024) - [c41]Borja Sierra-Miranda, Thomas Studer, Lukas Zenger:
Coalgebraic Proof Translations for Non-Wellfounded Proofs. AiML 2024: 527-548 - [e2]George Metcalfe, Thomas Studer, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 30th International Workshop, WoLLIC 2024, Bern, Switzerland, June 10-13, 2024, Proceedings. Lecture Notes in Computer Science 14672, Springer 2024, ISBN 978-3-031-62686-9 [contents] - [i13]Christian Cachin, David Lehnherr, Thomas Studer:
Synergistic Knowledge. CoRR abs/2403.18646 (2024) - 2023
- [c40]Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao:
What Do You Care About: Inferring Values from Emotions. AAMAS 2023: 2289-2291 - [c39]Christian Cachin, David Lehnherr, Thomas Studer:
Modal and Justification Logics for Multi-agent Systems (Invited Talk). CLAR 2023: 3-8 - [c38]Jieting Luo, Thomas Studer, Mehdi Dastani:
Providing Personalized Explanations: A Conversational Approach. CLAR 2023: 121-137 - [c37]Christian Cachin, David Lehnherr, Thomas Studer:
Synergistic Knowledge. SSS 2023: 552-567 - [c36]Federico L. G. Faroldi, Atefeh Rohani, Thomas Studer:
Conditional Obligations in Justification Logic. WoLLIC 2023: 178-193 - [i12]Thomas Studer:
The logic of temporal domination. CoRR abs/2306.01455 (2023) - [i11]Jieting Luo, Thomas Studer, Mehdi Dastani:
Providing personalized Explanations: a Conversational Approach. CoRR abs/2307.11452 (2023) - [i10]Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer:
Impossible and Conflicting Obligations in Justification Logic. CoRR abs/2309.15763 (2023) - [i9]Eveline Lehmann, Thomas Studer:
Belief Expansion in Subset Models. CoRR abs/2310.03627 (2023) - [i8]Jieting Luo, Mehdi Dastani, Thomas Studer, Beishui Liao:
What Do You Care About: Inferring Values from Emotions. CoRR abs/2311.06250 (2023) - 2022
- [j31]David Lehnherr, Zoran Ognjanovic, Thomas Studer:
A logic of interactive proofs. J. Log. Comput. 32(8): 1645-1658 (2022) - [c35]Olivier Stähli, Thomas Ost, Thomas Studer:
Development of an AI-based bioacoustic wolf monitoring system. FLAIRS 2022 - [c34]David Lehnherr, Zoran Ognjanovic, Thomas Studer:
A Logic of Interactive Proofs. LFCS 2022: 143-155 - 2021
- [j30]Michael Baur, Thomas Studer:
Semirings of Evidence. J. Log. Comput. 31(8): 2084-2106 (2021) - [j29]Chao Xu, Yanjing Wang, Thomas Studer:
A logic of knowing why. Synth. 198(2): 1259-1285 (2021) - [c33]Atefeh Rohani, Thomas Studer:
Explicit Non-normal Modal Logic. WoLLIC 2021: 64-81 - [i7]Atefeh Rohani, Thomas Studer:
Explicit non-normal modal logic. CoRR abs/2108.04486 (2021) - [i6]David Lehnherr, Zoran Ognjanovic, Thomas Studer:
A logic of interactive proofs. CoRR abs/2109.00775 (2021) - 2020
- [j28]Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer:
Probabilistic justification logic. J. Log. Comput. 30(1): 257-280 (2020) - [j27]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A logic of blockchain updates. J. Log. Comput. 30(8): 1469-1485 (2020) - [c32]Zvonimir Sikic, Silvia Ghilezan, Zoran Ognjanovic, Thomas Studer:
Logic and Applications - LAP Meeting. Logic, Language, and Security 2020: 98-100 - [c31]Michael Baur, Thomas Studer:
Semirings of Evidence. CLAR 2020: 42-57 - [c30]Eveline Lehmann, Thomas Studer:
Belief Expansion in Subset Models. LFCS 2020: 85-97 - [i5]Thomas Studer:
No-Go Theorems for Data Privacy. CoRR abs/2005.13811 (2020)
2010 – 2019
- 2019
- [j26]Nenad Savic, Thomas Studer:
Relevant Justification Logic. FLAP 6(2): 397-412 (2019) - [j25]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): 803-830 (2019) - [c29]Hamzeh Mohammadi, Thomas Studer:
Bayesian Confirmation and Justifications. ECSQARU 2019: 408-418 - [c28]Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Dragan Doder, Thomas Studer:
Probabilistic Consensus of the Blockchain Protocol. ECSQARU 2019: 469-480 - [c27]Nenad Savic, Thomas Studer:
Public Announcements for Epistemic Models and Hypertheories. ICLA 2019: 64-75 - [c26]Thomas Studer:
The Logic of Temporal Domination. RIVF 2019: 1-4 - [c25]Dragan Doder, Zoran Ognjanovic, Nenad Savic, Thomas Studer:
Incomplete Information and Justifications. TbiLLC 2019: 258-278 - [c24]Eveline Lehmann, Thomas Studer:
Subset Models for Justification Logic. WoLLIC 2019: 433-449 - 2018
- [c23]Michel Marti, Thomas Studer:
The Internalized Disjunction Property for Intuitionistic Justification Logic. Advances in Modal Logic 2018: 511-529 - [c22]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. LFCS 2018: 107-119 - [e1]Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe, Thomas Studer:
Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. College Publications 2018, ISBN 978-1-84890-255-8 [contents] - 2017
- [c21]Zoran Ognjanovic, Nenad Savic, Thomas Studer:
Justification Logic with Approximate Conditional Probabilities. LORI 2017: 681-686 - [c20]Samuel Bucheli, Meghdad Ghari, Thomas Studer:
Temporal Justification Logic. M4M@ICLA 2017: 59-74 - [i4]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. CoRR abs/1707.01766 (2017) - 2016
- [j24]Michel Marti, Thomas Studer:
Intuitionistic Modal Logic made Explicit. FLAP 3(5): 877-902 (2016) - [j23]Roman Kuznets, Thomas Studer:
Weak arithmetical interpretations for the Logic of Proofs. Log. J. IGPL 24(3): 424-440 (2016) - [c19]Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer:
Probabilistic Justification Logic. LFCS 2016: 174-186 - [i3]Michel Marti, Thomas Studer:
Modular Models for Intuitionistic Justification Logic. CoRR abs/1604.07181 (2016) - 2015
- [j22]Ioannis Kokkinis, Petar Maksimovic, Zoran Ognjanovic, Thomas Studer:
First steps towards probabilistic justification logic. Log. J. IGPL 23(4): 662-687 (2015) - [i2]Thomas Studer:
Justification logic enjoys the strong finite model property. CoRR abs/1506.06933 (2015) - 2014
- [j21]Luca Alberucci, Jürg Krähenbühl, Thomas Studer:
Justifying induction on modal μ-formulae. Log. J. IGPL 22(6): 805-817 (2014) - [j20]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Realizing public announcements by justifications. J. Comput. Syst. Sci. 80(6): 1046-1066 (2014) - [j19]Thomas Studer, Johannes Werner:
Censors for Boolean Description Logic. Trans. Data Priv. 7(3): 223-252 (2014) - 2013
- [j18]Thomas Studer:
Decidability for some justification logics with negative introspection. J. Symb. Log. 78(2): 388-402 (2013) - [j17]Thomas Studer:
A Universal Approach to Guarantee Data Privacy. Logica Universalis 7(2): 195-209 (2013) - [c18]Roman Kuznets, Thomas Studer:
Update as Evidence: Belief Expansion. LFCS 2013: 266-279 - 2012
- [j16]Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Log. 163(12): 1838-1853 (2012) - [c17]Roman Kuznets, Thomas Studer:
Justifications, Ontology, and Conservativity. Advances in Modal Logic 2012: 437-458 - [c16]Grigori Mints, Thomas Studer:
Cut-elimination for the mu-calculus with one variable. FICS 2012: 47-54 - 2011
- [j15]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Justifications for common knowledge. J. Appl. Non Class. Logics 21(1): 35-60 (2011) - [j14]Gerhard Jäger, Thomas Studer:
A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis 5(1): 1-19 (2011) - [c15]Thomas Studer:
An Application of Justification Logic to Protocol Verification. CIS 2011: 779-783 - [c14]Thomas Studer:
Justified Terminological Reasoning. Ershov Memorial Conference 2011: 349-361 - [c13]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Decidability for Justification Logics Revisited. TbiLLC 2011: 166-181 - [c12]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Partial Realization in Dynamic Justification Logic. WoLLIC 2011: 35-51 - 2010
- [i1]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Explicit Evidence Systems with Common Knowledge. CoRR abs/1005.0484 (2010)
2000 – 2009
- 2009
- [j13]Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Log. 160(1): 82-95 (2009) - [j12]Thomas Studer:
Common knowledge does not have the Beth property. Inf. Process. Lett. 109(12): 611-614 (2009) - [c11]Thomas Studer:
Privacy Preserving Modules for Ontologies. Ershov Memorial Conference 2009: 380-387 - [c10]Phiniki Stouppa, Thomas Studer:
Data Privacy for Knowledge Bases. LFCS 2009: 409-421 - [c9]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Two Ways to Common Knowledge. M4M 2009: 83-98 - 2008
- [j11]Gerhard Jäger, Mathis Kretz, Thomas Studer:
Canonical completeness of infinitary mu. J. Log. Algebraic Methods Program. 76(2): 270-292 (2008) - [j10]Kai Brünnler, Dieter Probst, Thomas Studer:
On contraction and the modal fragment. Math. Log. Q. 54(4): 345-349 (2008) - [j9]Thomas Studer:
On the Proof Theory of the Modal mu-Calculus. Stud Logica 89(3): 343-363 (2008) - 2007
- [j8]Gerhard Jäger, Mathis Kretz, Thomas Studer:
Cut-free common knowledge. J. Appl. Log. 5(4): 681-689 (2007) - [c8]Norbert Kottmann, Thomas Studer:
Improving Semantic Query Answering. DEXA 2007: 671-679 - [c7]David Steiner, Thomas Studer:
Total Public Announcements. LFCS 2007: 498-511 - [c6]Kai Brünnler, Thomas Studer:
Syntactic Cut-elimination for Common Knowledge. M4M 2007: 227-240 - 2006
- [j7]Mathis Kretz, Thomas Studer:
Deduction chains for common knowledge. J. Appl. Log. 4(3): 331-357 (2006) - [c5]Phiniki Stouppa, Thomas Studer:
A Formal Model of Data Privacy. Ershov Memorial Conference 2006: 400-408 - 2005
- [j6]Thomas Studer:
Explicit mathematics: power types and overloading. Ann. Pure Appl. Log. 134(2-3): 284-302 (2005) - [c4]Kilian Stoffel, Thomas Studer:
Provable Data Privacy. DEXA 2005: 324-332 - [c3]Michael Dürig, Thomas Studer:
Probabilistic ABox Reasoning: Preliminary Results. Description Logics 2005 - 2002
- [j5]Gerhard Jäger, Thomas Studer:
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. Ann. Pure Appl. Log. 114(1-3): 79-101 (2002) - 2001
- [j4]Gerhard Jäger, Reinhard Kahle, Thomas Studer:
Universes in explicit mathematics. Ann. Pure Appl. Log. 109(3): 141-162 (2001) - [j3]Reinhard Kahle, Thomas Studer:
Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. 49(1-2): 1-14 (2001) - [j2]Thomas Studer:
A Semantics for [lambda]: a Calculus with Overloading and Late-binding. J. Log. Comput. 11(4): 527-544 (2001) - [j1]Dieter Probst, Thomas Studer:
How to normalize the Jay. Theor. Comput. Sci. 254(1-2): 677-681 (2001) - [c2]Thomas Studer:
Constructive Foundations for Featherweight Java. Proof Theory in Computer Science 2001: 202-238 - 2000
- [c1]Reinhard Kahle, Thomas Studer:
A Theory of Explicit Mathematics Equivalent to ID1. CSL 2000: 356-370
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-25 23:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
