2026-10-10T21:17:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27701 2026-10-10T19:48:19Z ddc:004 open_access

Social Networks Through Time: Completeness of Temporal Network Logic Fernández González, Saúl Pedersen, Mina Young Smets, Sonja temporal logic completeness social network logic hybrid logic logics for multi-agent systems The framework of Temporal Network Logic (TNL) - first introduced in [Pedersen et al., 2021] and further developed in [Pedersen et al., 2023; Mina Young Pedersen, 2024] - was construed to model how a social network of interacting agents changes through time, with a language that could reflect both agents' actions, such as posting information and following each other, as well as temporal operators. This framework allows, among other things, to detect social bots, by modelling given bot behaviours as logical formulas and checking these formulas against a given model. While such applications were the main focus in [Pedersen et al., 2021; Pedersen et al., 2023; Mina Young Pedersen, 2024], the complete axiomatic system of this language has remained an open problem. In this paper, we focus on new logic-technical results and give a complete axiomatisation for TNL as well as a partial completeness result for its hybrid extension. The proofs are nonstandard and mix techniques from temporal and hybrid logics with "orthogonal" models. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Saúl Fernández González and Mina Young Pedersen and Sonja Smets 2026 Is Part Of OASIcs, Volume 146, 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.TIME.2026.5 urn:nbn:de:0030-drops-277017 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.TIME.2026.5 eng https://creativecommons.org/licenses/by/4.0/legalcode