 | Up a level |
Luo, Jieting; Dastani, Mehdi; Studer, Thomas (2023). Getting Emotional from Emotions: Modeling Affective Reaction in Multi-agent Systems (Submitted). Journal of logic and computation Oxford University Press
Cachin, Christian; Lehnherr, David; Studer, Thomas (October 2023). Synergistic Knowledge. In: Dolev, Shlomi; Schieber, Baruch (eds.) 25th International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Lecture notes in computer science (pp. 552-567). Springer 10.1007/978-3-031-44274-2_41
Luo, Jieting; Dastani, Mehdi; Studer, Thomas; Liao, Beishui (2023). What do you care about: inferring values from emotions. In: Proceedings of the 22st International Conference on Autonomous Agents and Multiagent Systems.
Cachin, Christian; Lehnherr, David; Studer, Thomas (2023). Modal and Justification Logics for Multi-agent Systems (Invited Talk). In: Herzig, Andreas; Luo, Jieting; Pardo, Pere (eds.) International Conference on Logic and Argumentation, 2023. Lecture Notes in Computer Science: Vol. 14156 (pp. 3-8). Cham: Springer Nature Switzerland 10.1007/978-3-031-40875-5_1
Luo, Jieting; Studer, Thomas; Dastani, Mehdi (2023). Providing Personalized Explanations: A Conversational Approach. In: Herzig, Andreas; Luo, Jieting; Pardo, Pere (eds.) International Conference on Logic and Argumentation, 2023. Lecture Notes in Computer Science: Vol. 14156 (pp. 121-137). Cham: Springer Nature Switzerland 10.1007/978-3-031-40875-5_8
Faroldi, Federico L. G.; Rohani, Atefeh; Studer, Thomas (2023). Conditional Obligations in Justification Logic. In: Hansen, Helle Hvid; Scedrov, Andre; de Queiroz, Ruy J.G.B. (eds.) 29th International Workshop on Logic, Language, Information, and Computation, 2023. Lecture Notes in Computer Science: Vol. 13923 (pp. 178-193). Cham: Springer Nature Switzerland 10.1007/978-3-031-39784-4_11
Lehnherr, David; Ognjanović, Zoran; Studer, Thomas (2022). A logic of interactive proofs. Journal of logic and computation, 32(8), pp. 1645-1658. Oxford University Press 10.1093/logcom/exac071
Stähli, Olivier; Ost, Thomas; Studer, Thomas (May 2022). Development of an AI-based bioacoustic wolf monitoring system. In: Bartàk, Roman; Keshtkar, Fazel; Franklin, Michael (eds.) Thirty-Fifth International Florida Artificial Intelligence Research Society Conference. Hutchinson Island, Jensen Beach, Florida, USA. 15-18 May 2022.
Lehnherr, David; Ognjanović, Zoran; Studer, Thomas (2022). A Logic of Interactive Proofs. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science. LFCS 2022. Lecture Notes in Computer Science: Vol. 13137 (pp. 143-155). Springer 10.1007/978-3-030-93100-1_10
Doder, Dragan; Ognjanović, Zoran; Savić, Nenad; Studer, Thomas (2022). Incomplete Information and Justifications. In: Özgün, Aybüke; Zinova, Yulia (eds.) Logic, Language and Computation TbiLLC 2019. Lecture Notes in Computer Science: Vol. 13206 (pp. 258-278). Springer 10.1007/978-3-030-98479-3_13
Faroldi, Federico L G; Ghari, Meghdad; Lehmann, Eveline; Studer, Thomas (2022). Consistency and permission in deontic justification logic. Journal of logic and computation, 34(4), pp. 640-664. Oxford University Press 10.1093/logcom/exac045
Baur, Michael; Studer, Thomas (2021). Semirings of Evidence. Journal of logic and computation, 31(8), pp. 2084-2106. Oxford University Press 10.1093/logcom/exab007
Studer, T. (2021). The impossibility of keeping secrets. Malaysian Journal of Mathematical Sciences, 15, pp. 91-104. UPM
Rohani, Atefeh; Studer, Thomas (5 October 2021). Explicit Non-normal Modal Logic. In: Silva, Alexandra; Wassermann, Renata; de Queiroz, Ruy (eds.) WoLLIC 2021 - 27th Workshop on Logic, Language, Information and Computation. Lecture Notes in Computer Science: Vol. 13038 (pp. 64-81). Springer 10.1007/978-3-030-88853-4_5
Studer, Thomas (2021). A conflict tolerant logic of explicit evidence. Logical investigations, 27(1), pp. 124-144.
Lehmann, Eveline; Studer, Thomas (2021). Exploring Subset Models for Justification Logic. In: Fitting, Melvin (ed.) Selected Topics from Contemporary Logics. London: College Publications
Brünnler, Kai; Flumini, Dandolo; Studer, Thomas (2020). A Logic of Blockchain Updates. Journal of logic and computation, 30(8), pp. 1469-1485. Oxford University Press 10.1093/logcom/exaa045
Baur, Michael; Studer, Thomas (April 2020). Semirings of Evidence. In: Dastani, Mehdi; Dong, Huimin; van der Torre, Leon (eds.) Logic and Argumentation. International Conference, CLAR 2020, Proceedings. Lecture Notes in Computer Science: Vol. 12061 (pp. 42-57). Springer 10.1007/978-3-030-44638-3_3
Lehmann, Eveline; Studer, Thomas (January 2020). Belief Expansion in Subset Models. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science LFCS 2020. Lecture Notes in Computer Science: Vol. 11972 (pp. 85-97). Springer 10.1007/978-3-030-36755-8_6
Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2020). Probabilistic justification logic. Journal of logic and computation, 30(1), pp. 257-280. Oxford University Press 10.1093/logcom/exaa011
Studer, Thomas (2020). No-Go Theorems for Data Privacy. In: Proceedings of the 7th International Cryptology and Information Security Conference. Video Conference. 9th-10th June 2020.
Studer, Thomas; Faroldi, Federico; Ghari, Meghdad; Lehmann, Eveline (2020). Impossible and Conflicting Obligations in Justification Logic (Submitted). In: 15th International Conference on Deontic Logic and Normative Systems (DEON 2020). 30.07.2020 – 02.08.2020 (postponed to 2021).
Kokkinis, Ioannis; Savic, Nenad; Studer, Thomas (2020). Justification Logics with Probability Operators. In: Ognjanović, Zoran (ed.) Probabilistic Extensions of Various Logical Systems (pp. 215-234). Springer 10.1007/978-3-030-52954-3_8
Marinkovic, Bojan; Glavan, Paola; Ognjanovic, Zoran; Studer, Thomas (2019). A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. Journal of logic and computation, 29(5), pp. 803-830. Oxford University Press 10.1093/logcom/exz007
Mohammadi, Hamzeh; Studer, Thomas (September 2019). Bayesian Confirmation and Justifications. Lecture notes in computer science, 11726, pp. 408-418. Springer 10.1007/978-3-030-29765-7_34
Marinkovic, Bojan; Glavan, Paola; Ognjanovic, Zoran; Doder, Dragan; Studer, Thomas (September 2019). Probabilistic Consensus of the Blockchain Protocol. Lecture notes in computer science, 11726, pp. 469-480. Springer 10.1007/978-3-030-29765-7_39
Lehmann, Eveline; Studer, Thomas (July 2019). Subset models for justification logic. Lecture notes in computer science, 11541, pp. 433-449. Springer 10.1007/978-3-662-59533-6_26
Savic, Nenad; Studer, Thomas (2019). Relevant Justification Logic. Journal of applied logics, 6(2), pp. 397-412. College Publications
Studer, Thomas (March 2019). The Logic of Temporal Domination. In: RIVF 2019. Proceedings (pp. 1-4). IEEE 10.1109/RIVF.2019.8713701
Savic, Nenad; Studer, Thomas (5 February 2019). Public Announcements for Epistemic Models and Hypertheories. In: Khan, Md. Aquil; Manuel, Amaldev (eds.) ICLA 2019 - 8th Indian Conference on Logic and its Applications. Lecture Notes in Computer Science: Vol. 11600 (pp. 64-75). Delhi, India: Springer 10.1007/978-3-662-58771-3_7
Xu, Chao; Wang, Yanjing; Studer, Thomas (2019). A logic of knowing why. Synthese, 198(2), pp. 1259-1285. Springer Netherlands 10.1007/s11229-019-02104-0
Marti, Michel; Studer, Thomas (2018). The Proof Theory of Common Knowledge. In: Ditmarsch, Hans van; Sandu, Gabriel (eds.) Jaakko Hintikka on Knowledge and Game-Theoretical Semantics. Outstanding Contributions to Logic: Vol. 12 (pp. 433-455). Cham: Springer International Publishing 10.1007/978-3-319-62864-6_18
Brünnler, Kai; Flumini, Dandolo; Studer, Thomas (2018). A Logic of Blockchain Updates. In: LFCS 2018: Logical Foundations of Computer Science. Lecture Notes in Computer Science: Vol. 10703 (pp. 107-119). Cham: Springer International Publishing 10.1007/978-3-319-72056-2_7
Marti, Michel; Studer, Thomas (2018). The Internalized Disjunction Property for Intuitionistic Justification Logic. In: Bezhanishvili, Guram; D'Agostino, Giovanna; Metcalfe, George; Studer, Thomas (eds.) Advances in Modal Logic 12 (pp. 511-529). College Publications
Bucheli, Samuel; Ghari, Meghdad; Studer, Thomas (2017). Temporal Justification Logic. Electronic proceedings in theoretical computer science, 243, pp. 59-74. NICTA 10.4204/EPTCS.243.5
Ognjanović, Zoran; Savic, Nenad; Studer, Thomas (2017). Justification Logic with Approximate Conditional Probabilities. In: LORI 2017: Logic, Rationality, and Interaction. Lecture Notes in Computer Science: Vol. 10455 (pp. 681-686). Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-662-55665-8_52
Kokkinis, Ioannis; Studer, Thomas (2016). Cyclic Proofs for Linear Temporal Logic. In: Probst, Dieter; Schuster, Peter (eds.) Concepts of Proof in Mathematics, Philosophy, and Computer Science. Ontos Mathematical Logic: Vol. 6 (pp. 171-192). De Gruyter 10.1515/9781501502620-011
Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2016). Probabilistic Justification Logic. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science: Vol. 9537 (pp. 174-186). Cham: Springer 10.1007/978-3-319-27683-0_13
Studer, Thomas (2016). Relationale Datenbanken: von den theoretischen Grundlagen zu Anwendungen mit PostgreSQL [Textbook] . eXamen.press. Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-662-46571-4
Kahle, Reinhard; Strahm, Thomas Adrian; Studer, Thomas (eds.) (2016). Advances in Proof Theory. Progress in Computer Science and Applied Logic: Vol. 28. Cham: Springer International Publishing 10.1007/978-3-319-29198-7
Kuznets, Roman; Studer, Thomas (2016). Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL, 24(3), pp. 424-440. Oxford University Press 10.1093/jigpal/jzw002
Marti, Michel; Studer, Thomas (2016). Intuitionistic modal logic made explicit. The IfCoLog Journal of Logics and their Applications, 3(5), pp. 877-901. College Publications
Kokkinis, Ioannis; Maksimović, Petar; Ognjanović, Zoran; Studer, Thomas (2015). First steps towards probabilistic justification logic. Logic Journal of IGPL, 23(4), pp. 662-687. Oxford University Press 10.1093/jigpal/jzv025
Alberucci, Luca; Krähenbühl, Jürg; Studer, Thomas (2014). Justifying induction on modal μ-formulae. Logic Journal of IGPL, 22(6), pp. 805-817. Oxford University Press 10.1093/jigpal/jzu001
Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2014). Realizing public announcements by justifications. Journal of computer and system sciences, 80(6), pp. 1046-1066. Elsevier 10.1016/j.jcss.2014.04.001
Studer, Thomas; Werner, Johannes Martin (2014). Censors for Boolean Description Logic. Transactions on Data Privacy, 7(3), pp. 223-252.
Studer, Thomas (2013). Decidability for some justification logics with negative introspection. The journal of symbolic logic, 78(2), pp. 388-402. Cambridge University Press 10.2178/jsl.7802030
Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2013). Decidability for Justification Logics Revisited. In: Logic, language, and computation. Lecture Notes in Computer Science: Vol. 7758 (pp. 166-181). Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-642-36976-6_12
Kuznets, Roman; Studer, Thomas (2013). Update as Evidence: Belief Expansion. In: Update as evidence: brief expansion. Lecture Notes in Computer Science: Vol. 7734 (pp. 266-279). Berlin, Heidelberg: Springer 10.1007/978-3-642-35722-0_19
Studer, Thomas (2013). A Universal Approach to Guarantee Data Privacy. Logica universalis, 7(2), pp. 195-209. Birkhäuser 10.1007/s11787-012-0060-y
Brünnler, Kai; Studer, Thomas (2012). Syntactic cut-elimination for a fragment of the modal mu-calculus. Annals of pure and applied logic, 163(12), pp. 1838-1853. Amsterdam: Elsevier 10.1016/j.apal.2012.04.006
Kuznets, Roman; Studer, Thomas (2012). Justifications, Ontology, and Conservativity. In: Bolander, Thmas; Braüner, Torben; Ghilardi, Silvio; Moss, Lawrence (eds.) Advances in Modal Logic, volume 9 (pp. 437-458). College Publications
Studer, Thomas (2012). Justified Terminological Reasoning. In: Clarke, Edmund; Virbitskaite, Irina; Voronkov, Andrei (eds.) Perspectives of Systems Informatics. 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011 7162 (pp. 349-361). Heidelberg: Springer Verlag 10.1007/978-3-642-29709-0_30
Mints, Grigori; Studer, Thomas (2012). Cut-elimination for the mu-calculus with one variable. In: D. Miller, D.; Esik, Z. (eds.) Fixed Points in Computer Science 2012.
Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2011). Justifications for Common Knowledge. Journal of applied non-classical logics, 21(1), pp. 35-60. Paris: Ed. Hermes 10.3166/JANCL.21.35-60
Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2011). Partial Realization in Dynamic Justification Logic. In: Beklemishev, Lev D.; de Queiroz, Ruy (eds.) Logic, Language, Information and Computation, 18th International workshop, WoLLIC 2011, Philadelphia, PA, USA, May, 18-20, Proceedings. Lecture Notes in Computer Science: Vol. 6642 (pp. 35-51). Heidelberg: Springer Verlag 10.1007/978-3-642-20920-8_9
Jäger, Gerhard; Studer, Thomas (2011). A Buchholz rule for modal fixed point logics. Logica universalis, 5(1), pp. 1-19. Basel: Birkhäuser 10.1007/s11787-010-0022-1
Studer, Thomas (2011). Justification Logic, Inference Tracking, and Data Privacy. Logic and logical philosophy, 20(4), pp. 297-306. Toruń (PL): Nicholas Copernicus Univ. Press
Studer, Thomas (2011). An application of justification logic to protocol verification. In: Proceedings of Computational Intelligence and Security CIS 2011.
Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2010). Two ways to common knowledge. In: Bolander, Thomas; Braüner, Torben (eds.) Proceedings of the 6th workshop on Methods for Modalities (M4M-6 2009), Copenhagen, Denmark, 12-14 November 2009. Electronic Notes in Theoretical Computer Science: Vol. 262 (pp. 83-98). Amsterdam: Elsevier 10.1016/j.entcs.2010.04.007
Studer, Thomas (2010). Privacy Preserving Modules for Ontologies. In: Pnueli, A.; Virbitskaite, I.; Voronkov, A. (eds.) Proceedings of Perspectives of System Informatics PSI '09. Lecture Notes in Computer Science: Vol. 5947 (pp. 380-387). Heidelberg: Springer Verlag
Studer, Thomas (2009). Common knowledge does not have the Beth property. Information processing letters, 109(12), 611--614. Amsterdam: Elsevier 10.1016/j.ipl.2009.02.011
Brünnler, Kai; Studer, Thomas (2009). Syntactic cut-elimination for common knowledge. Annals of pure and applied logic, 160(1), pp. 82-95. Amsterdam: Elsevier 10.1016/j.apal.2009.01.014
Stouppa, Phiniki; Studer, Thomas (2009). Data Privacy for ALC Knowledge Bases. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science. International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 409-421). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_28
Brünnler, Kai; Studer, Thomas (2009). Syntactic cut-elimination for common knowledge. In: Areces, C.; Demri, S. (eds.) Proceedings of the 5th Workshop on Methods for Modalities (M4M5 2007). Electronic Notes in Theoretical Computer Science: Vol. 231 (pp. 227-240). Amsterdam: Elsevier 10.1016/j.entcs.2009.02.038
Studer, Thomas (2008). On the proof theory of the modal mu-calculus. Studia logica, 89(3), pp. 343-363. Dordrecht: Springer Netherlands 10.1007/s11225-008-9133-6
Jäger, Gerhard; Kretz, Mathis; Studer, Thomas (2008). Canonical completeness of infinitary mu. Journal of logic and algebraic programming, 76(2), pp. 270-292. New York, N.Y.: North-Holland 10.1016/j.jlap.2008.02.005
Brünnler, Kai; Probst, Dieter; Studer, Thomas (2008). On contraction and the modal fragment. Mathematical logic quarterly, 54(4), pp. 345-349. Weinheim: Wiley-VCH 10.1002/malq.200710043
Jäger, Gerhard; Kretz, Mathis; Studer, Thomas (2007). Cut-free common knowledge. Journal of applied logic, 5(4), pp. 681-689. Amsterdam: Elsevier 10.1016/j.jal.2006.02.003
Kottmann, Norbert; Studer, Thomas (2007). Improving semantic query answering. In: Database and Expert Systems Applications. Proceedings of the18th International Conference, DEXA 2007. Lecture Notes in Computer Science: Vol. 4653 (pp. 671-679). Heidelberg: Springer Verlag 10.1007/978-3-540-74469-6_65
Steiner, David; Studer, Thomas (2007). Total public announcements. In: Logical Foundations of Computer Science. Proceedings of the International Symposium, LFCS 2007. Lecture Notes in Computer Science: Vol. 4514 (pp. 498-511). Heidelberg: Springer Verlag 10.1007/978-3-540-72734-7_35
Stouppa, Phiniki; Studer, Thomas (2007). A formal model of data privacy. In: Virbitskaite, Irina; Voronkov, Andrei (eds.) Perspectives of Systems Informatics. 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia, June 27-30, 2006. Revised Papers. Theoretical Computer Science and General Issues: Vol. 4378 (pp. 400-408). Heidelberg: Springer Verlag 10.1007/978-3-540-70881-0_34
Studer, Thomas (2001). A Semantics for λ: a Calculus with Overloading and Late‐binding. Journal of logic and computation, 11(4), pp. 527-544. Oxford University Press 10.1093/logcom/11.4.527
