Probabilistic Strategy Logic with Degrees of Observability
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913635960356864 |
|---|---|
| author | Mu, Chunyan Motamed, Nima Alechina, Natasha Logan, Brian |
| author_facet | Mu, Chunyan Motamed, Nima Alechina, Natasha Logan, Brian |
| contents | There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information transparency. Information transparency concerns the extent to which agents' actions and behaviours are observable by other agents. Reasoning about information transparency is useful in many domains including security, privacy, and decision-making. In this paper, we present a formal framework for reasoning about information transparency properties in stochastic multi-agent systems. We extend Probabilistic Strategy Logic with new observability operators that capture the degree of observability of temporal properties by agents. We show that the model checking problem for the resulting logic is decidable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_15135 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Probabilistic Strategy Logic with Degrees of Observability Mu, Chunyan Motamed, Nima Alechina, Natasha Logan, Brian Artificial Intelligence Logic in Computer Science There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information transparency. Information transparency concerns the extent to which agents' actions and behaviours are observable by other agents. Reasoning about information transparency is useful in many domains including security, privacy, and decision-making. In this paper, we present a formal framework for reasoning about information transparency properties in stochastic multi-agent systems. We extend Probabilistic Strategy Logic with new observability operators that capture the degree of observability of temporal properties by agents. We show that the model checking problem for the resulting logic is decidable. |
| title | Probabilistic Strategy Logic with Degrees of Observability |
| topic | Artificial Intelligence Logic in Computer Science |
| url | https://arxiv.org/abs/2412.15135 |