Dario Della Monica

Dario Della Monica

Auto-generated profile, based on publicly available information

Dario Della Monica

Università degli Studi di Udine

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 September 2013 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
DBDavide Bresolin
Davide Bresolin
DMDario Della Monica
Dario Della Monica
Valentin GorankoValentin Goranko
Valentin Goranko
Angelo MontanariAngelo Montanari
Angelo Montanari
Guido SciaviccoGuido Sciavicco
Guido Sciavicco

6 September 2017
Verified
Book Chapter
Closed access
PDF file
AFAdrian Francalanza
Adrian Francalanza
LALuca Aceto
Luca Aceto
AAAntonis Achilleos
Antonis Achilleos
DADuncan Paul Attard
Duncan Paul Attard
ICIan Cassar
Ian Cassar
AIAnna Ingólfsdóttir
Anna Ingólfsdóttir

1 January 2008
Verified
Book Chapter
Closed access
PDF file
DBDavide Bresolin
Davide Bresolin
DMDario Della Monica
Dario Della Monica
VGValentin Goranko
Valentin Goranko
AMAngelo Montanari
Angelo Montanari
Guido SciaviccoGuido Sciavicco
Guido Sciavicco

1 November 2011 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
DMDario Della Monica
Dario Della Monica
MNMargherita Napoli
Margherita Napoli
DPDomenico Parente
Domenico Parente
Alternating-time Temporal Logic (ATL) and Coalition Logic (CL) are well-established logical formalisms particularly suitable to model games between dynamic coalitions of agents (like e.g. the system and the environment). Recently, the ATL formalism has been extended in order to take into account boundedness of the resources needed for a task to be performed. The resulting logic, called Resource-Bounded ATL (RB-ATL), has been presented in quite a variety of scenarios. Even if the model checking problem for extensions of ATL dealing with resource bounds is usually undecidable, a model checking procedure for RB-ATL has been proposed. In this paper, we introduce a new formalism, called PRB-ATL, based on a different notion of resource bounds and we show that its model checking problem remains in EXPTIME and has a PSPACE lower bound.Then, we tackle the problem of coalition formation. How and why agents should aggregate is not a new issue and has been deeply investigated, in past and recent years, in various frameworks, as for example in algorithmic game theory, argumentation settings, and logic-based knowledge representation. We face this problem in the setting of priced resource-bounded agents with the goal specified by an ATL formula. In particular we solve the problem of determining the minimal cost coalitions of agents acting in accordance to rules expressed by a priced game arena and satisfying a given formula. We show that such problem is computationally not harder than verifying the satisfaction of the same formula with fixed coalitions

1 December 2014 in Theoretical Computer Science
Verified
Journal Article
Closed access
DBDavide Bresolin
Davide Bresolin
DMDario Della Monica
Dario Della Monica
AMAngelo Montanari
Angelo Montanari
PSPietro Sala
Pietro Sala
Guido SciaviccoGuido Sciavicco
Guido Sciavicco

26 February 2011 in Software and Systems Modeling
Verified
Journal Article
Closed access
PDF file
DBDavide Bresolin
Davide Bresolin
DMDario Della Monica
Dario Della Monica
Valentin GorankoValentin Goranko
Valentin Goranko
Angelo MontanariAngelo Montanari
Angelo Montanari
Guido SciaviccoGuido Sciavicco
Guido Sciavicco