The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
An axiomatic basis for computer programming
Communications of the ACM
The Correctness Problem in Computer Science
The Correctness Problem in Computer Science
Optimistic and Disjunctive Agent Design Problems
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
The Computational Complexity of Agent Design Problems
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Provably bounded-optimal agents
Journal of Artificial Intelligence Research
A model-theoretic approach to the verification of situated reasoning systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The complexity of achievement and maintenance problems in agent-based systems
Artificial Intelligence
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
| Hi-index | 0.00 |
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 驴up, the corresponding agent verification problem is 驴u+1p-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.