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...
| Published in: | Synthese Vol. 202; no. 3; pp. 1 - 40 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Published: |
Springer Nature
Sep2023
|
| Online Access: | View this record in EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=170801087&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 170801087 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: Sep2023 vid: 202 iid: 3 pid: 237 pub: Springer Nature artinfo: ui: 170801087 10.1007/s11229-023-04264-6 ppf: 1 ppct: 39 formats: fmt: @attributes: type: P size: 626KB tig: atl: Detecting bots with temporal logic. aug: au: Pedersen, Mina Young Slavkovik, Marija Smets, Sonja affil: Department of Information Science and Media Studies, University of Bergen, 5007, Bergen, Norway ILLC, University of Amsterdam, 1098 XG, Amsterdam, The Netherlands sug: keyword: Bot detection Hybrid logic Model checking Social bots Social network logic Temporal logic ab: 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. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2023. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2023 holdings: @attributes: islocal: N |
|---|