Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
ATL + is a variant of alternating-time temporal logic that does not have the expressive power of full ATL * , but still allows for expressing some natural properties of agents. It has been believed that verification with ATL + is Δ P 3-complete for both memoryless agents and players who can memorize the whole history of the game. In this paper, we show that the latter result is not correct. That is, we prove that model checking ATL + for agents that use strategies with memory is in fact PSPACE-complete. On a more optimistic note, we show that fairness constraints can be added to ATL + without further increasing the complexity of model checking, which makes ATL + an attractive alternative to the full language of ATL * .
AI Communications – IOS Press
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.