Abstract
In this paper, we investigate the computational complexity of the agent verification problem. Informally, this problem can be understood as follows. Given representations of an agent, an environment, and a task we wish the agent to carry out in this environment, can the agent be guaranteed to carry out the task successfully? Following a formal definition of agents, environments, and tasks, we establish two results, which relate the computational complexity of the agent verification problem to the complexity of the task specification (how hard it is to decide whether or not an agent has succeeded). We first show that for tasks with specifications that are in Σ supinu , the corresponding agent verification problem is Π supinu+1 -complete; we then show that for pspace-complete task specifications, the corresponding verification problem is no worse — it is also pspace-complete. Some variations of these problems are investigated. We then use these results to analyse the computational complexity of various common kinds of tasks, including achievement and maintenance tasks, and tasks that are specified as arbitrary Boolean combinations of achievement and maintenance tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Benerecetti, F. Giunchiglia, and L. Serafini. Model checking multi-agent systems. Journal of Logic and Computation, 8(3):401–424, 1998.
R. S. Boyer and J. S. Moore, editors. The Correctness Problem in Computer Science. The Academic Press: London, England, 1981.
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press: Cambridge, MA, 2000.
C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–583, 1969.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag: Berlin, Germany, 1992.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems — Safety. Springer-Verlag: Berlin, Germany, 1995.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.
A. S. Rao and M. P. Georgeff. A model-theoretic approach to the verification of situated reasoning systems. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 318–324, Chambéry, France, 1993.
S. Russell and D. Subramanian. Provably bounded-optimal agents. Journal of AI Research, 2:575–609, 1995.
M. Wooldridge. The computational complexity of agent design problems. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 341–348, Boston, MA, 2000.
M. Wooldridge and P. E. Dunne. Optimistic and disjunctive agent design problems. In Y. Lespérance and C. Castelfranchi, editors, Proceedings of the Seventh International Workshop on Agent Theories, Architectures, and Languages (ATAL-2000), 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wooldridge, M., Dunne, P.E. (2002). The Computational Complexity of Agent Verification. In: Meyer, JJ.C., Tambe, M. (eds) Intelligent Agents VIII. ATAL 2001. Lecture Notes in Computer Science(), vol 2333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45448-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-45448-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43858-8
Online ISBN: 978-3-540-45448-9
eBook Packages: Springer Book Archive