Abstract
In this paper we introduce and study the complexity of model checking alternating-time temporal logic (atp) with imperfect information, using a fine-structured complexity measure. While atp model checking with perfect information is linear in the size of the model when the number of agents is considered fixed, this is no longer true when the number of agents is considered parameters of the problem (fine structure).Combining it with results from our previous papers, we get the surprising result that checking strategic abilities of agents under both perfect and imperfect information belong to the same complexity class: both problems are \(\sum^P_{2}\)-complete.KeywordsComputational complexitymulti-agent systemstemporal logicstrategic abilitygames with incomplete information
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
