A Probabilistic Logic for Resource-Bounded Multi-Agent Systems
Abstract
Resource-bounded alternating-time temporal logic (RB-ATL), an extension of Coalition Logic (CL) and Alternating-time Temporal Logic (ATL), allows reasoning about resource requirements of coalitions in concurrent systems. However, many real-world systems are inherently probabilistic as well as resource-bounded, and there is no straightforward way of reasoning about their unpredictable behaviours. In this paper, we propose a logic for reasoning about coalitional power under resource constraints in the probabilistic setting. We extend RB-ATL with probabilistic reasoning and provide a standard algorithm for the model-checking problem of the resulting logic Probabilistic Resource-Bounded ATL (pRB-ATL).
Cite
Text
Nguyen and Rakib. "A Probabilistic Logic for Resource-Bounded Multi-Agent Systems." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/74Markdown
[Nguyen and Rakib. "A Probabilistic Logic for Resource-Bounded Multi-Agent Systems." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/nguyen2019ijcai-probabilistic/) doi:10.24963/IJCAI.2019/74BibTeX
@inproceedings{nguyen2019ijcai-probabilistic,
title = {{A Probabilistic Logic for Resource-Bounded Multi-Agent Systems}},
author = {Nguyen, Hoang Nga and Rakib, Abdur},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {521-527},
doi = {10.24963/IJCAI.2019/74},
url = {https://mlanthology.org/ijcai/2019/nguyen2019ijcai-probabilistic/}
}