Authors:
Dario Della Monica
and
Giacomo Lenzi
Affiliation:
University of Salerno, Italy
Keyword(s):
μ-calculus, Multi-agent systems, Coalition logics, Bounded resources, Model checking.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Cooperation and Coordination
;
Distributed and Mobile Software Systems
;
Economic Agent Models
;
Enterprise Information Systems
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Software Engineering
;
Symbolic Systems
Abstract:
Much attention has been devoted in artificial intelligence to the verification of multi-agent systems and different
logical formalisms have been proposed, such as Alternating-time Temporal Logic (ATL), Alternating
μ-calculus (AMC), and Coalition Logic (CL). Recently, logics able to express bounds on resources have been
introduced, such as RB-ATL and PRB-ATL, both of them based on ATL. The main contribution of this paper
is the introduction and the study of a new formalism for dealing with bounded resources, based on μ-calculus.
Such a formalism, called Priced Resource-Bounded Alternating μ-calculus (PRB-AMC), is an extension of
both PRB-ATL and AMC. In analogy with PRB-ATL, we introduce a price for each resource. By considering
that the resources have each a price (which may vary during the game) and that agents can buy them only if
they have enough money, several real world scenarios can be adequately described. First, we show that the
model checking problem for PRB-AMC is in EXPTIM
E and has a PSPACE lower bound. Then, we solve the
problem of determining the minimal cost coalition of agents. Finally, we show that the satisfiability problem
of PRB-AMC is undecidable, when the game is played on arenas with only one state.
(More)