Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Verifying agents with memory is harder than it seemed

Verifying agents with memory is harder than it seemed 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 * . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png AI Communications IOS Press

Verifying agents with memory is harder than it seemed

AI Communications , Volume 23 (4) – Jan 1, 2010

Loading next page...
 
/lp/ios-press/verifying-agents-with-memory-is-harder-than-it-seemed-Mcl5jz4NcC

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2010 by IOS Press, Inc
ISSN
0921-7126
eISSN
1875-8452
DOI
10.3233/AIC-2010-0481
Publisher site
See Article on Publisher Site

Abstract

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 * .

Journal

AI CommunicationsIOS Press

Published: Jan 1, 2010

There are no references for this article.