Export 74 results:
Filters: Type is Conference Paper  [Clear All Filters]
Frittaion, E., Steila, S., Yokoyama, K.: The Strength of the SCT Criterion. In: Gopal, T.V., Jäger, G., and Steila, S. Theory and Applications of Models of Computation - 14th Annual Conference, {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. pp. 260–273 (2017).
Jäger, G., Marti, M.: A canonical model construction for intuitionistic distributed knowledge. In: Beklemishev, L., Demri, S., and Máté, A. Advances in Modal Logic 2016. College Publications (2016).
Kokkinis, I., Studer, T.: Cyclic Proofs for Linear Temporal Logic. In: Probst, D. and Schuster, P. Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
Kokkinis, I., Ognjanović, Z., Studer, T.: Probabilistic Justification Logic. In: Artemov, S. and Nerode, A. Symposium on Logical Foundations in Computer Science 2016. Springer (2016).
Kokkinis, I.: The Complexity of Non-Iterated Probabilistic Justification Logic. In: Simari, G. and Gyssens, M. Foundations of Information and Knowledge Systems -- FoIKS 2016. Springer (2016).
Marti, M., Metcalfe, G.: A Hennessy-Milner Property for Many-Valued Modal Logics. In: Goré, R., Kooi, B., and Kurucz, A. Advances in Modal Logic. pp. 407-420. College Publications (2014).
Jäger, G., Zumbrunnen, R.: About the Strength of Operational Regularity. In: Berger, U., Diener, H., Schuster, P., and Seisenberger, M. Logic, Construction, Computation. pp. 305-324. Ontos Verlag (2012).
Mints, G., Studer, T.: Cut-elimination for the mu-calculus with one variable. Fixed Points in Computer Science 2012. pp. 47-54. Open Publishing Association (2012).
Kuznets, R., Studer, T.: Justifications, Ontology, and Conservativity. In: Bolander, T., Braüner, T., Ghilardi, S., and Moss, L. Advances in Modal Logic, volume 9. pp. 437-458. College Publications (2012).
Studer, T.: Justified Terminological Reasoning. In: Clarke, E.E., Virbitskaite, I., and Voronkov, A. Proceedings of Perspectives of System Informatics PSI'11. pp. 349-361. Springer (2012).
Eberhard, S., Strahm, T.: Weak theories of truth and explicit mathematics. In: Berger, U., Diener, H., Schuster, P., and Seisenberger, M. Logic, Construction, Computation. pp. 157-184. Ontos Verlag (2012).
Studer, T.: An application of justification logic to protocol verification. Proceedings of Computational Intelligence and Security CIS 2011. pp. 779-783. IEEE (2011).
Bucheli, S., Kuznets, R., Studer, T.: Partial Realization in Dynamic Justification Logic. In: Beklemishev, L. and de Queiroz, R. Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings. pp. 35-51 (2011).
Brünnler, K., Goetschi, R., Kuznets, R.: A Syntactic Realization Theorem for Justification Logics. In: Beklemishev, L., Goranko, V., and Shehtman, V. Advances in Modal Logic, Volume 8. pp. 39-58. College Publications (2010).
McKinley, R.: Expansion nets: Proof nets for for propositional classical logic. In: Fermüller, C. and Voronkov, A. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 17). pp. 535-549. Springer Berlin / Heidelberg (2010).
Bucheli, S., Kuznets, R., Renne, B., Sack, J., Studer, T.: Justified Belief Change. In: Arrazola, X. and Ponte, M.\'ıa Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10). pp. 135-155. University of the Basque Country Press (2010).
Jäger, G.: Modal Fixed Point Logics. In: Esparza, J., Spanfelner, B., and Grumberg, O. Logics and Languages for Reliability and Security. IOS Press (2010).
Studer, T.: Privacy Preserving Modules for Ontologies. In: Pnueli, A., Virbitskaite, I., and Voronkov, A. Proceedings of Perspectives of System Informatics PSI'09. pp. 380-387 (2010).
Bucheli, S., Kuznets, R., Studer, T.: Two Ways to Common Knowledge. In: Bolander, T. and Braüner, T. Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009. pp. 83-98. Elsevier (2010).
Strahm, T.: Weak theories of operations and types. In: Schindler, R. Ways of Proof Theory. pp. 441-468. Ontos Verlag (2010).
Jäger, G., Krähenbühl, J.: $Σ^1_1$ choice in a theory of sets and classes. In: Schindler, R. Ways of Proof Theory. pp. 283-314. Ontos Verlag (2010).
Kuznets, R.: A Note on the Use of Sum in the Logic of Proofs. In: Drossos, C., Peppas, P., and Tsinakis, C. Proceedings of the 7th Panhellenic Logic Symposium. pp. 99-103. Patras University Press, Patras University, Greece (2009).
Stouppa, P., Studer, T.: Data Privacy for ALC Knowledge Bases. In: Artemov, S. and Nerode, A. Proceedings of Logical Foundations of Computer Science LFCS'09. pp. 409-421. Springer (2009).
Artemov, S., Kuznets, R.: Logical Omniscience as a Computational Complexity Problem. In: Heifetz, A. Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009). pp. 14-23. ACM, Stanford University, California (2009).
Brünnler, K., Straßburger, L.: Modular Sequent Systems for Modal Logic. In: Giese, M. and Waaler, A. Tableaux 2009. Springer-Verlag (2009).