A probabilistic logic for resource-bounded multi-agent systems

Hoang Nga Nguyen, Abdur Rakib

Research output: Contribution to conferencePaper

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).
Original languageEnglish
Pages(In-press)
Publication statusAccepted/In press - 30 May 2019
Event28th International Joint Conference on Artificial Intelligence - Macao, China
Duration: 10 Aug 201916 Aug 2019
Conference number: 28th
https://ijcai19.org/

Conference

Conference28th International Joint Conference on Artificial Intelligence
Abbreviated titleIJCAI-19
CountryChina
CityMacao
Period10/08/1916/08/19
Internet address

Fingerprint

Probabilistic logics
Temporal logic
Multi agent systems
Model checking

Cite this

Nguyen, H. N., & Rakib, A. (Accepted/In press). A probabilistic logic for resource-bounded multi-agent systems. (In-press). Paper presented at 28th International Joint Conference on Artificial Intelligence, Macao, China.

A probabilistic logic for resource-bounded multi-agent systems. / Nguyen, Hoang Nga; Rakib, Abdur.

2019. (In-press) Paper presented at 28th International Joint Conference on Artificial Intelligence, Macao, China.

Research output: Contribution to conferencePaper

Nguyen, HN & Rakib, A 2019, 'A probabilistic logic for resource-bounded multi-agent systems' Paper presented at 28th International Joint Conference on Artificial Intelligence, Macao, China, 10/08/19 - 16/08/19, pp. (In-press).
Nguyen HN, Rakib A. A probabilistic logic for resource-bounded multi-agent systems. 2019. Paper presented at 28th International Joint Conference on Artificial Intelligence, Macao, China.
Nguyen, Hoang Nga ; Rakib, Abdur. / A probabilistic logic for resource-bounded multi-agent systems. Paper presented at 28th International Joint Conference on Artificial Intelligence, Macao, China.
@conference{e5a710e53a0b4c719d8d34ebb976d5a3,
title = "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).",
author = "Nguyen, {Hoang Nga} and Abdur Rakib",
year = "2019",
month = "5",
day = "30",
language = "English",
pages = "(In--press)",
note = "28th International Joint Conference on Artificial Intelligence, IJCAI-19 ; Conference date: 10-08-2019 Through 16-08-2019",
url = "https://ijcai19.org/",

}

TY - CONF

T1 - A probabilistic logic for resource-bounded multi-agent systems

AU - Nguyen, Hoang Nga

AU - Rakib, Abdur

PY - 2019/5/30

Y1 - 2019/5/30

N2 - 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).

AB - 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).

M3 - Paper

SP - (In-press)

ER -