Publications

Export 9 results:
Filters: Author is S. Artemov  [Clear All Filters]
2009
P. Stouppa and T. Studer, Data Privacy for ALC Knowledge Bases, in Proceedings of {L}ogical {F}oundations of {C}omputer {S}cience {LFCS}'09, 2009, vol. 5407, pp. 409–421.
S. Artemov and R. Kuznets, Logical Omniscience as a Computational Complexity Problem, in Theoretical {A}spects of {R}ationality and {K}nowledge, Proceedings of the Twelfth Conference ({TARK 2009}), Stanford University, California, 2009, pp. 14–23.
S. R. Buss and R. Kuznets, The NP-completeness of reflected fragments of justification logics, in Proceedings of {S}ymposium on {L}ogical {F}oundations of {C}omputer {S}cience ({LFCS}'09), 2009, vol. 5407, pp. 122-136.
2007
D. Steiner and T. Studer, Total public announcements, in Proceedings of Logical Foundations of Computer Science, 2007, vol. 4514, p. 498{–}511.
2006
D. Steiner, A system for consistency preserving belief change, in Proceedings of Rationality and Knowledge, 2006, p. 133{–}144.
1993
S. Artemov and T. Strassen, The Basic Logic of Proofs, in {C}omputer {S}cience {L}ogic, 6th Workshop, {CSL}'92, {S}an {M}iniato, {I}taly, {S}eptember 28–{O}ctober 2, 1992, Selected Papers, 1993, vol. 702, pp. 14–28.
S. Artemov and T. Strassen, Functionality in the Basic Logic of Proofs. Institut für Informatik und angewandte Mathematik, 1993.
S. Artemov and T. Strassen, The Logic of the {Gödel Proof Predicate, in Computational Logic and Proof Theory, Third {K}urt {Gödel {C}olloquium, {KGC}'93, {B}rno, {C}zech {R}epublic, {A}ugust 24–27, 1993, Proceedings, 1993, vol. 713, pp. 71–82.
1992
S. Artemov and T. Strassen, The Basic Logic of Proofs. Institut für Informatik und angewandte Mathematik, 1992.