Adaptive Agents and Multi-Agents Systems · 2017 · 14 citations · 19 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationApproximation AlgorithmsDeductive VerificationModel CheckingPredicate LogicVerificationFixed-point ComputationFixed-point LogicFixed-point Theorems In ComputabilityFixpoint ComputationImperfect Information GamesLearning With Imperfect InformationNonstandard ModelsUpper Bounds
Model checking of strategic ability under imperfect information is known to be hard. In this paper, we propose translations of ATLir formulae that provide lower and upper bounds for their truth values, and are cheaper to verify than the original specifications. Most interestingly, the lower approximation is provided by a fixpoint expression that uses a nonstandard variant of the next-step ability operator. We show the correctness of the translations, establish their computational complexity, and validate the approach by experiments with a scalable scenario of Bridge play.
19
Alternating-time temporal logic
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman · Journal of the ACM · 2002 · 1.4K citations
Wojciech Jamroga, Wiebe van der Hoek · University of Twente Research Information · 2004 · 233 citations
Tractable multiagent planning for epistemic goals
Wiebe van der Hoek, Michael Wooldridge · 2002 · 199 citations