Abdur Rakib

TIST Journal 2025 Journal Article

Predicting Next Useful Location with Context-Awareness: The State-of-the-Art

• Alireza Nezhadettehad
• Arkady Zaslavsky
• Abdur Rakib
• Siraj Ahmed Shaikh
• Seng W. Loke
• Guang-Li Huang
• Alireza Hassani

Predicting the future location of mobile objects reinforces location-aware services with proactive intelligence and helps businesses and decision-makers with better planning and near real-time scheduling in different applications such as traffic congestion control, location-aware advertisements and monitoring public health and well-being. Recent developments in smartphone and location sensors technology and the prevalence of using location-based social networks alongside the improvements in AI and machine learning techniques provide an excellent opportunity to exploit massive amounts of historical and real-time contextual information to recognise mobility patterns and achieve more accurate and intelligent predictions. This unique survey provides a comprehensive overview of the next useful location prediction problem with context-awareness and the related studies. First, we explain the concepts of context and context-awareness and define the next location prediction problem. Then we analyse more than 30 studies in this field concerning the prediction method, the challenges addressed, the datasets and metrics used for training and evaluating the model and the types of context incorporated. Finally, we discuss the advantages and disadvantages of different approaches, focusing on the usefulness of the predicted location and identifying the open challenges and future work on this subject.

IJCAI Conference 2019 Conference Paper

A Probabilistic Logic for Resource-Bounded Multi-Agent Systems

• Hoang Nga Nguyen
• Abdur Rakib

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

AAMAS Conference 2019 Conference Paper

Probabilistic Resource-bounded Alternating-time Temporal Logic

• Hoang Nga Nguyen
• Abdur Rakib

This paper extends resource-bounded ATL with probabilistic reasoning and provides the syntax and semantics of the resulting logic, probabilistic resource-bounded ATL.

AAMAS Conference 2010 Conference Paper

Resource-bounded alternating-time temporal logic

• Natasha Alechina
• Brian Logan
• Hoang Nga Nguyen
• Abdur Rakib

Many problems in AI and multi-agent systems research are mostnaturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by theavailability of resources, and there is no straightforward way ofreasoning about resource requirements in logics such as CoalitionLogic (CL) and Alternating-time Temporal Logic (ATL). In thispaper, we propose a logic for reasoning about coalitional abilityunder resource constraints. We extend ATL with costs of actionsand hence of strategies. We give a complete and sound axiomatisation of the resulting logic Resource-Bounded ATL (RB-ATL) andan efficient model-checking algorithm for it.

IJCAI Conference 2009 Conference Paper

• Natasha Alechina
• Brian Logan
• Nguyen Hoang Nga
• Abdur Rakib

Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However there is no natural way of expressing resource requirements in these logics. This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and sound axiomatisation of RBCL.

LORI Conference 2009 Conference Paper

Expressing Properties of Coalitional Ability under Resource Bounds

• Natasha Alechina
• Brian Logan 0001
• Nguyen Hoang Nga
• Abdur Rakib

Abstract We introduce Coalition Logic for Resource Games (CLRG) which extends Coalition Logic by allowing explicit reasoning about resource endowments of coalitions of agents and resource bounds on strategies. We show how to express interesting properties of coalitional ability under resource bounds in this logic, including properties of Coalitional Resource Games introduced by Wooldridge and Dunne in [1]. We also give an efficient model-checking algorithm for CLRG which makes it possible to verify the properties automatically.

AAMAS Conference 2008 Conference Paper

Verifying time, memory and communication bounds in systems of reasoning agents

• Natasha Alechina
• Brian Logan
• Hoang Nga Nguyen
• Abdur Rakib

We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its available computational resources or bandwidth to the problem. We present a novel temporal epistemic logic, BMCL, which allows us to describe a set of reasoning agents with bounds on time, memory and the number of messages they can exchange. The bounds on memory and communication are expressed as axioms in the logic. As an example, we show how to axiomatize a system of agents which reason using resolution and prove that the resulting logic is sound and complete. We then show how to encode a simple system of reasoning agents specified in BMCL in the description language of a model checker, and verify that the agents can achieve a goal only if they are prepared to commit certain time, memory and communication resources.