Huang, Xiaowei ORCID: 0000-0001-6267-0366 and Meyden, Ron van der
(2018)
An Epistemic Strategy Logic.
ACM Transactions on Computational Logic, 19 (4).
pp. 1-45.
This is the latest version of this item.
Text
1409.2193.pdf - Author Accepted Manuscript Download (1MB) |
|
Text
a26-huang.pdf - Author Accepted Manuscript Download (774kB) |
Abstract
This article presents an extension of temporal epistemic logic with operators that can express quantification over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode the strategy being used by each of the agents. This provides a natural way to express what agents would know were they to be aware of some of the strategies being used by other agents. A number of examples that rely on the ability to express an agent’s knowledge about the strategies being used by other agents are presented to motivate the framework, including reasoning about game-theoretic equilibria, knowledge-based programs, and information-theoretic computer security policies. Relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic and several of its fragments are also characterized.
Item Type: | Article |
---|---|
Additional Information: | archiveprefix: arXiv timestamp: Wed, 07 Jun 2017 01:00:00 +0200 biburl: http://dblp.org/rec/bib/journals/corr/HuangM14a bibsource: dblp computer science bibliography, http://dblp.org |
Uncontrolled Keywords: | Epistemic logic, strategy logic, computational complexity |
Depositing User: | Symplectic Admin |
Date Deposited: | 13 Oct 2020 09:13 |
Last Modified: | 18 Jan 2023 23:29 |
DOI: | 10.1145/3233769 |
Related URLs: | |
URI: | https://livrepository.liverpool.ac.uk/id/eprint/3103892 |
Available Versions of this Item
-
An Epistemic Strategy Logic. (deposited 30 Jul 2018 09:16)
- An Epistemic Strategy Logic. (deposited 13 Oct 2020 09:13) [Currently Displayed]