Sonja Smets
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sonja Smets has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Alexandru Baltag
ILLC, University of Amsterdam
9 shared publications - Alexandru Baltag
Institute for Logic, Language and Computation University of Amsterdam A
4 shared publications - Fernando Raymundo Velázquez-Quesada
Department of Information Science and Media Studies, University of Bergen, Bergen, Norway
3 shared publications - Aybüke Özgün
University of Amsterdam
2 shared publications - Marija Slavkovik
University of Bergen
2 shared publications - Nina Gierasimczuk
Technical University of Denmark
2 shared publications
Latest Publications
- Open Access
- 15 December 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (6) , 136
Comparing Knowledge: An Analysis of the Relative Epistemic Powers of Groups
We use a novel type of epistemic logic, employing comparative knowledge assertions, to analyze the relative epistemic powers of individuals or groups of agents. Such comparative assertions can express that a group has the potential to (collectively) know everything that another group can know. Moreover, we look at comparisons involving various types of knowledge (fully introspective, positively introspective, etc.), satisfying the corresponding modal-epistemic conditions (e.g., , , ). For each epistemic attitude, we are particularly interested in what agents or groups can know about their own epistemic position relative to that of others.- 15 December 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (6) , 136
Open AccessComparing Knowledge: An Analysis of the Relative Epistemic Powers of Groups
We use a novel type of epistemic logic, employing comparative knowledge assertions, to analyze the relative epistemic powers of individuals or groups of agents. Such comparative assertions can express that a group has the potential to (collectively) know everything that another group can know. Moreover, we look at comparisons involving various types of knowledge (fully introspective, positively introspective, etc.), satisfying the corresponding modal-epistemic conditions (e.g., , , ). For each epistemic attitude, we are particularly interested in what agents or groups can know about their own epistemic position relative to that of others. - Open Access
Comparing Knowledge: An Analysis of the Relative Epistemic Powers of Groups
We use a novel type of epistemic logic, employing comparative knowledge assertions, to analyze the relative epistemic powers of individuals or groups of agents. Such comparative assertions can express that a group has the potential to (collectively) know everything that another group can know. Moreover, we look at comparisons involving various types of knowledge (fully introspective, positively introspective, etc.), satisfying the corresponding modal-epistemic conditions (e.g., $S5$, $S4$, $KT$). For each epistemic attitude, we are particularly interested in what agents or groups can know about their own epistemic position relative to that of others.Open AccessComparing Knowledge: An Analysis of the Relative Epistemic Powers of Groups
We use a novel type of epistemic logic, employing comparative knowledge assertions, to analyze the relative epistemic powers of individuals or groups of agents. Such comparative assertions can express that a group has the potential to (collectively) know everything that another group can know. Moreover, we look at comparisons involving various types of knowledge (fully introspective, positively introspective, etc.), satisfying the corresponding modal-epistemic conditions (e.g., $S5$, $S4$, $KT$). For each epistemic attitude, we are particularly interested in what agents or groups can know about their own epistemic position relative to that of others. - Open Access
- 27 November 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 437, 140-159
Group Knowledge of Hypothetical Values
- 27 November 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 437, 140-159
Open AccessGroup Knowledge of Hypothetical Values
- 3 October 2025
- Published by Springer Nature
- p. 110-123
Evidence Diffusion in Social Networks: a Topological Perspective
- 3 October 2025
- Published by Springer Nature
- p. 110-123
Evidence Diffusion in Social Networks: a Topological Perspective
- 3 October 2025
- Published by Springer Nature
- p. 34-50
How to Avoid Unexpected Exams
- Open Access
- 23 April 2024
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 63 (4) , 1-27
Logic Meets Wigner’s Friend (and their Friends)
We take a fresh look at Wigner’s Friend thought-experiment and some of its more recent variants and extensions, such as the Frauchiger-Renner (FR) Paradox. We discuss various solutions proposed in the literature, focusing on a few questions: What is the correct epistemic interpretation of the multiplicity of state assignments in these scenarios? Under which conditions can one include classical observers into the quantum state descriptions, in a way that is still compatible with traditional Quantum Mechanics? Under which conditions can one system be admitted as an additional ‘observer’ from the perspective of another background observer? When can the standard axioms of multi-agent Epistemic Logic (that allow “knowledge transfer” between agents) be applied to quantum-physical observers? In the last part of the paper, we propose a new answer to these questions, sketch a particular formal implementation of this answer, and apply it to obtain a principled solution to Wigner Friend-type paradoxes.
- 23 April 2024
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 63 (4) , 1-27
Open AccessLogic Meets Wigner’s Friend (and their Friends)
We take a fresh look at Wigner’s Friend thought-experiment and some of its more recent variants and extensions, such as the Frauchiger-Renner (FR) Paradox. We discuss various solutions proposed in the literature, focusing on a few questions: What is the correct epistemic interpretation of the multiplicity of state assignments in these scenarios? Under which conditions can one include classical observers into the quantum state descriptions, in a way that is still compatible with traditional Quantum Mechanics? Under which conditions can one system be admitted as an additional ‘observer’ from the perspective of another background observer? When can the standard axioms of multi-agent Epistemic Logic (that allow “knowledge transfer” between agents) be applied to quantum-physical observers? In the last part of the paper, we propose a new answer to these questions, sketch a particular formal implementation of this answer, and apply it to obtain a principled solution to Wigner Friend-type paradoxes.
- Open Access
Logic meets Wigner's Friend (and their Friends)
We take a fresh look at Wigner's Friend thought-experiment and some of its more recent variants and extensions, such as the Frauchiger-Renner (FR) Paradox. We discuss various solutions proposed in the literature, focusing on a few questions: What is the correct epistemic interpretation of the multiplicity of state assignments in these scenarios? Under which conditions can one include classical observers into the quantum state descriptions, in a way that is still compatible with traditional Quantum Mechanics? Under which conditions can one system be admitted as an additional 'observer' from the perspective of another background observer? When can the standard axioms of multi-agent Epistemic Logic (that allow "knowledge transfer" between agents) be applied to quantum-physical observers? In the last part of the paper, we propose a new answer to these questions, sketch a particular formal implementation of this answer, and apply it to obtain a principled solution to Wigner Friend-type paradoxes.
Open AccessLogic meets Wigner's Friend (and their Friends)
We take a fresh look at Wigner's Friend thought-experiment and some of its more recent variants and extensions, such as the Frauchiger-Renner (FR) Paradox. We discuss various solutions proposed in the literature, focusing on a few questions: What is the correct epistemic interpretation of the multiplicity of state assignments in these scenarios? Under which conditions can one include classical observers into the quantum state descriptions, in a way that is still compatible with traditional Quantum Mechanics? Under which conditions can one system be admitted as an additional 'observer' from the perspective of another background observer? When can the standard axioms of multi-agent Epistemic Logic (that allow "knowledge transfer" between agents) be applied to quantum-physical observers? In the last part of the paper, we propose a new answer to these questions, sketch a particular formal implementation of this answer, and apply it to obtain a principled solution to Wigner Friend-type paradoxes.
- Open Access
- 28 August 2023
- Published by Springer Nature in Synthese
- Vol. 202 (3) , 1-39
Detecting bots with temporal logic
Social bots are computer programs that act like human users on social media platforms. Social bot detection is a rapidly growing field dominated by machine learning approaches. In this paper, we propose a complementary method to machine learning by exploring bot detection as a model checking problem. We introduce Temporal Network Logic (TNL) which we use to specify social networks where agents can post and follow each other. Using this logic, we formalize different types of social bot behavior with formulas that are satisfied in a model of a network with bots. We also consider an extension of the logic where we explore the expressive power of including elements from hybrid logic in our framework. We give model checking algorithms for TNL and its hybrid extension, and show that the complexity of the former is in p and the latter in pspace .
- 28 August 2023
- Published by Springer Nature in Synthese
- Vol. 202 (3) , 1-39
Open AccessDetecting bots with temporal logic
Social bots are computer programs that act like human users on social media platforms. Social bot detection is a rapidly growing field dominated by machine learning approaches. In this paper, we propose a complementary method to machine learning by exploring bot detection as a model checking problem. We introduce Temporal Network Logic (TNL) which we use to specify social networks where agents can post and follow each other. Using this logic, we formalize different types of social bot behavior with formulas that are satisfied in a model of a network with bots. We also consider an extension of the logic where we explore the expressive power of including elements from hybrid logic in our framework. We give model checking algorithms for TNL and its hybrid extension, and show that the complexity of the former is in p and the latter in pspace .
- 4 August 2022
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (6) , 1015-1016
Netreason: reasoning about social networks
The spread and exchange of information among people has been formally studied in the social sciences since the 1950s. The ways in which we do communicate has changed multiple times since. In particular, since the digitalization of communication methods, the speed of information exchange, the connectivity among people and with artificial agents, the reachability of information contents have all changed. Moreover, we now have an almost permanent record of what knowledge has been communicated, when, by whom. This novel status of information exchange has rapidly become a new field of studies on its own. The understanding of networked communication has thus become ubiquitous in multi-agent systems in AI, in epistemic-social logics and of course in social network analysis. Works that address this challenge are also split across these fields. This special issue is devoted to the theme of the ECAI workshop ‘Netreason: Reasoning About Social Networks’ (organized online on September...
- 4 August 2022
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 32 (6) , 1015-1016
Netreason: reasoning about social networks
The spread and exchange of information among people has been formally studied in the social sciences since the 1950s. The ways in which we do communicate has changed multiple times since. In particular, since the digitalization of communication methods, the speed of information exchange, the connectivity among people and with artificial agents, the reachability of information contents have all changed. Moreover, we now have an almost permanent record of what knowledge has been communicated, when, by whom. This novel status of information exchange has rapidly become a new field of studies on its own. The understanding of networked communication has thus become ubiquitous in multi-agent systems in AI, in epistemic-social logics and of course in social network analysis. Works that address this challenge are also split across these fields. This special issue is devoted to the theme of the ECAI workshop ‘Netreason: Reasoning About Social Networks’ (organized online on September...
- Open Access
- 28 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4458
Reasoning about Quantum Information: An Overview of Quantum Dynamic Logic
This paper provides an overview of quantum dynamic logics, showing how they have been designed and illustrating how these logics can be applied to verify the correctness of quantum protocols. Similar to the advantages of using dynamic logics to reason about the flow of classical information, the quantum analogues of these logics are tailored to the task of reasoning about the flow of quantum information. We present our logical systems in a modular way, starting with the qualitative logic of quantum measurements and unitary evolutions in single quantum systems, which can already express non-classical effects, e.g., the state-changing interference induced by quantum tests, their non-commutativity, etc. We then move on to logics for compound quantum systems that can capture the non-local features of quantum information: separability, entanglement, correlated measurements, Bell states, etc. We then briefly summarize the logic of quantum probabilities and sketch some applications to quantum protocols.
- 28 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4458
Open AccessReasoning about Quantum Information: An Overview of Quantum Dynamic Logic
This paper provides an overview of quantum dynamic logics, showing how they have been designed and illustrating how these logics can be applied to verify the correctness of quantum protocols. Similar to the advantages of using dynamic logics to reason about the flow of classical information, the quantum analogues of these logics are tailored to the task of reasoning about the flow of quantum information. We present our logical systems in a modular way, starting with the qualitative logic of quantum measurements and unitary evolutions in single quantum systems, which can already express non-classical effects, e.g., the state-changing interference induced by quantum tests, their non-commutativity, etc. We then move on to logics for compound quantum systems that can capture the non-local features of quantum information: separability, entanglement, correlated measurements, Bell states, etc. We then briefly summarize the logic of quantum probabilities and sketch some applications to quantum protocols.