9 citations · 14 across the 3 of their papers we have counts for
6 papers
Priority Promotion with Parysian Flair
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero +2
We develop an algorithm that combines the advantages of priority promotion - one of the leading approaches to solving large parity games in practice - with the quasi-polynomial tim…
Good-for-Game QPTL: An Alternating Hodges Semantics
Dylan Bellier, Massimo Benerecetti, Dario Della Monica +1
An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the fut…
SHACL Satisfiability and Containment (Extended Paper)
Paolo Pareti, George Konstantinidis, Fabio Mogavero +1
The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce pa…
Solving Mean-Payoff Games via Quasi Dominions
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress m…
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its t…
Proceedings 1st International Workshop on Strategic Reasoning
Fabio Mogavero, Aniello Murano, Moshe Y. Vardi
This volume contains the proceedings of the 1st International Workshop on Strategic Reasoning 2013 (SR 2013), held in Rome (Italy), March 1617, 2013. The SR workshop aims to bring…