On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The Computational Complexity of Agent Design Problems
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Provably bounded-optimal agents
Journal of Artificial Intelligence Research
On cooperation in a multi-entity model
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Planning and acting in partially observable stochastic domains
Artificial Intelligence
Updating Mental States from Communication
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
Architectures and Idioms: Making Progress in Agent Design
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
The Computational Complexity of Agent Verification
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Negotiation in electronic commerce: a study in the Latin-American market
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
On the formulation of competitive negotiations in Web applications: The Latin-American market case
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The agent design problem is as follows:Given an environment, together with a specification of a task, is it possible to construct an agent that can be guaranteed to successfully accomplish the task in the environment? In previous research, it was shown that for two important classes of tasks (where an agent was required to either achieve some state of affairs or maintain some state of affairs), the agent design problem was PSPACE-complete. In this paper, we consider several important generalisations of such tasks. In an optimistic agent design problem, we simply ask whether an agent has at least some chance of bringing about a goal state. In a combined design problem, an agent is required to achieve some state of affairs while ensuring that some invariant condition is maintained. Finally, in a disjunctive design problem, we are presented with a number of goals and corresponding invariants--the aim is to design an agent that on any given run, will achieve one of the goals while maintaining the corresponding invariant. We prove that while the optimistic achievement and maintenance design problems are np-complete, the pspace-completeness results obtained for achievement and maintenance tasks generalise to combined and disjunctive agent design.