Publications

Export 64 results:
Sort by: Author Title Type [ Year  (Desc)]
Filters: Type is Conference Paper  [Clear All Filters]
2012
Mints, G, Studer T.  2012.  Cut-elimination for the mu-calculus with one variable. Fixed Points in Computer Science 2012. 77:47{–}54.
2011
Studer, T.  2011.  An application of justification logic to protocol verification. Proceedings of Computational Intelligence and Security CIS 2011. :779{–}783.
Bucheli, S, Kuznets R, Studer T.  2011.  Partial Realization in Dynamic Justification Logic. Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings. 6642:35-51.
2010
McKinley, R.  2010.  Expansion nets: Proof nets for for propositional classical logic. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 17). 6397:535-549.
Jäger, G.  2010.  Modal Fixed Point Logics. Logics and {L}anguages for {R}eliability and {S}ecurity. 25
Studer, T.  2010.  Privacy Preserving Modules for Ontologies. Proceedings of {P}erspectives of {S}ystem {I}nformatics {PSI}'09. 5947:380{–}387.
Bucheli, S, Kuznets R, Studer T.  2010.  Two Ways to Common Knowledge. Proceedings of the 6th Workshop on {M}ethods for {Modalities} ({M4M–6 2009}), {C}openhagen, {D}enmark, 12–14 {N}ovember 2009. :83–98. Abstract
Strahm, T.  2010.  Weak theories of operations and types. Ways of {P}roof {T}heory. :441–468.
Bucheli, S, Kuznets R, Renne B, Sack J, Studer T.  2010.  Justified Belief Change. Proceedings of the {S}econd {ILCLI} {I}nternational {W}orkshop on {L}ogic and {P}hilosphy of {K}nowledge, {C}ommunication and {A}ction ({L}og{KCA}-10). :135–155. Abstract
2009
Artemov, S, Kuznets R.  2009.  Logical Omniscience as a Computational Complexity Problem. Theoretical {A}spects of {R}ationality and {K}nowledge, Proceedings of the Twelfth Conference ({TARK 2009}). :14–23. Abstract
Brünnler, K, Studer T.  2009.  Syntactic cut-elimination for common knowledge. Proceedings of {M}ethods for {M}odalities {M}4{M}5. 231:227–240.
Buss, SR, Kuznets R.  2009.  The NP-completeness of reflected fragments of justification logics. Proceedings of {S}ymposium on {L}ogical {F}oundations of {C}omputer {S}cience ({LFCS}'09). 5407:122-136. Abstract
Stouppa, P, Studer T.  2009.  Data Privacy for ALC Knowledge Bases. Proceedings of {L}ogical {F}oundations of {C}omputer {S}cience {LFCS}'09. 5407:409–421.
Kuznets, R.  2009.  A Note on the Use of Sum in the Logic of Proofs. Proceedings of the 7th {P}anhellenic {L}ogic {S}ymposium. :99–103.
Jäger, G.  2009.  Operations, sets and classes. Logic, {M}ethodology and {P}hilosophy of {S}cience - {P}roceedings of the {T}hirteenth {I}nternational {C}ongress.
2008
2007
Steiner, D, Studer T.  2007.  Total public announcements. Proceedings of Logical Foundations of Computer Science. 4514:498{–}511.
Wehbe, R.  2007.  Computing with common knowledge. Proceedings of Artificial Intelligence and Soft Computing. :45{–}50.
Stouppa, P, Studer T.  2007.  A formal model of data privacy. Proceedings of Perspectives of System Informatics. 4378:401{–}411.
Kottmann, N, Studer T.  2007.  Improving semantic query answering. Proceedings of Database and Expert Systems Applications. 4653:671{–}679.
Wehbe, R.  2007.  Merging rule-based belief databases. Proceedings of Artificial Intelligence and Applications. :585{–}589.
2006
Brünnler, K.  2006.  Deep inference and its normal form of derivations. Proceedings of Computability in Europe. 3988:65{–}74.