BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/157
DTSTAMP:20230914T125912Z
SUMMARY:Formal Definitions and Complexity Results for Trust Relations and T
 rust Domains
DESCRIPTION:Speaker: Simon Kramer\nUniversity of Luxembourg\nInterdisciplin
 ary Centre for Security and Trust\nCampus Kirchberg\, F103\n\nAbstract: \n
 We propose computational\, declarative definitions of the concepts of weak
  and strong trust relations between interacting agents\, and trust domains
  of trust-related agents in distributed systems. Our definitions yield com
 putational complexity results for deciding potential and actual trust rela
 tionships and membership in trust domains\, as well as a positive (negativ
 e) compositionality result for strong (weak) trust domains. Our defining p
 rinciple for weak and strong trust is (common) belief in and knowledge of 
 agent correctness\, respectively.\n\nKEYWORDS: \n\ncomputability\, composi
 tionality\, and scalability of trust and trustworthiness  computer-aided d
 ecision making (CADM)  dependable distributed or multi-agent systems  moda
 l logics of belief and knowledge.\n
URL:https://www.tcs.tifr.res.in/web/events/157
DTSTART;VALUE=DATE:20110201
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR