Timed Epistemic Knowledge Bases for Social Networks

Abstract

We present an epistemic logic equipped with time-stamps in the atoms and epistemic operators, which allows to reason not only about information available to the different agents, but also about the moments at which events happen and new knowledge is acquired or deduced. Our logic includes both an epistemic operator and a belief operator, which allows to model the disclosure of information that may not be accurate.Our main motivation is to model rich privacy policies in online social networks. Online Social Networks (OSNs) are increasingly used for social interactions in the modern digital era, which bring new challenges and concerns in terms of privacy. Most social networks today offer very limited mechanisms to express the desires of users in terms of how information that affects their privacy is shared. In particular, most current privacy policy formalisms allow only static policies, which are not rich enough to express timed properties like "my location after work should not be disclosed to my boss". The logic we present in this paper enables to express rich properties and policies in terms of the knowledge available to the different users and the precise time of actions and deductions. Our framework can be instantiated for different OSNs, by specifying the effect of the actions in the evolution of the social network and in the knowledge disclosed to each agent.We present an algorithm for deducing knowledge, which can also be instantiated with different variants of how the epistemic information is preserved through time. Our algorithm allows to model not only social networks with eternal information but also networks with ephemeral disclosures. Policies are modelled as formulae in the logic, which are interpreted over timed traces representing the evolution of the social network. Alice picture 0 (Bob, pub) K 0 Alice B 0 Alice loc 0 (Bob, pub)

A survey of challenges for runtime verification from advanced application domains (beyond software)

“…Formal languages are needed to express such time and event-dependent recurrent policies, and suitable enforcement mechanisms need to be defined. This could be done by defining real-time extensions of epistemic logic, or combining existing static privacy policy languages with automata, as done for instance in [262,263,264].…”

“…Some initial work has been recently done on the specification side with a proof of concept implementation. The work in [263,264] presents an approach based on extending a privacy language with real-time, while [262] proposes a combination of static privacy policy language with automata. However, a general working solution to this challenge is still missing.…”

Toward a generalized notion of discrete time for modeling temporal networks

“…As our approach also makes a (small) step toward the combined study of networks, logic, and temporal logic (see Section 4), the reader may be interested in Seligman et al (2011), Ahuja &Malhi (2016), andPardo et al (2018) all of which discuss possible uses of logic in the study of networks. Furthermore, for a quick introduction into temporal logic, the reader is referred to Venema (2017), Burgess (1979), and Goranko & Galton (2015).…”