Umeå University's logo

umu.sePublications
12345674 of 9
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Formal methods for verification in human-agent interaction
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Responsible Artificial Intelligence; Formal Methods for Trustworthy Hybrid Intelligence)ORCID iD: 0000-0001-9379-4281
2025 (English)Doctoral thesis, monograph (Other academic)Alternative title
Formella metoder för verifiering i interaktioner mellan människor och intelligenta agenter (Swedish)
Abstract [en]

Formal verification is essential for ensuring that systems behave according to their mathematical specifications. However, applying formal verification to human-agent interactions presents unique challenges due to the dynamic nature of human mental states and behaviors. Unlike traditional verification tasks, which focus on ensuring correctness in a well-defined action space, this work addresses reasoning over beliefs, intentions, and emotions that evolve through interaction. Two main contributions are introduced: (1) Belief Graphs for modeling mental state dynamics, and (2) the integration of these with formal dialogue games for verifying strategies and influence. To this end, the developed verification methods are rooted in two main pillars: psychological theories formalized to represent mental state dynamics as logical frameworks, and Non-Monotonic Reasoning (NMR) methods, including techniques such as Formal Argumentation and Answer Set Programming (ASP). By modeling  mental dynamics as states and transitions in a layer atop the action space—referred to as the Belief Graph methodology—we are provided a tool for modeling context and context dynamics that supports counterfactual, forward and backward reasoning about mental states and behaviors. By incorporating Belief Graphs into formal dialogue games we gain mathematical frameworks for analyzing and verifying agent beliefs, intentions and strategies, thereby enabling the verification of human-agent interactions.Whether it concerns potentially harmful human behaviors—such as malicious activities on social media—or intelligent systems that interact with humans, such as chatbots that are increasingly capable of influencing users’ emotions, thoughts, and decisions—there is an urgent need for formal verification methods to ensure safe and reliable human interactions in digital communication.The proposed methods have been evaluated through formal analysis, case studies, and published peer-reviewed research.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2025. , p. 262
Series
Report / UMINF, ISSN 0348-0542
Keywords [en]
formal verification, human-agent interaction, non-monotonic reasoning, theory of mind
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-237425ISBN: 978-91-8070-682-7 (print)ISBN: 978-91-8070-683-4 (electronic)OAI: oai:DiVA.org:umu-237425DiVA, id: diva2:1950795
Public defence
2025-05-05, HUM.D.220, Humanisthuset, Umeå University, Umeå, 13:15 (English)
Opponent
Supervisors
Available from: 2025-04-14 Created: 2025-04-09 Last updated: 2025-04-11Bibliographically approved

Open Access in DiVA

fulltext(4564 kB)207 downloads
File information
File name FULLTEXT01.pdfFile size 4564 kBChecksum SHA-512
39e4f4109b66d0731284ffef4f7bd5ab32d51e5b411826893398341cbd6abe6d741ad8c80e6649773f3c4715821d1522ed8f44c1eb43244436c40ae6652bd5b3
Type fulltextMimetype application/pdf
spikblad(91 kB)17 downloads
File information
File name SPIKBLAD01.pdfFile size 91 kBChecksum SHA-512
0099916b20dfa141139de00812be2a1edf632b59836155477967654f04f68cef3d3b6404d0441cbc192c7364fb4fec401c7ceffed13a8fa9ab6a7d866824b85f
Type spikbladMimetype application/pdf
About the cover image(203 kB)14 downloads
File information
File name FULLTEXT02.pdfFile size 203 kBChecksum SHA-512
945cb120f5043227a3f2bd8674b2b6479e95a5edf36c0e6e70c24ee68bc6245f4c75bf9cd0d6f1f2ff1ae3669ed1ce062ab4e1a1276782a2237630c479a9a287
Type attachmentMimetype application/pdf

Authority records

Brännström, Andreas

Search in DiVA

By author/editor
Brännström, Andreas
By organisation
Department of Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 223 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 418 hits
12345674 of 9
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf