The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Reasoning about knowledge
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Heterogeneous Agent Systems
A Roadmap of Agent Research and Development
Autonomous Agents and Multi-Agent Systems
Specifying and Verifying Distributed Intelligence Systems
EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Reasoning about Evolving Nonmonotonic Knowledge Bases
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Homeostatic Behavior of Dynamic Deductive Data Bases
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
ECAI '96 Proceedings of the Workshop on Intelligent Agents III, 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)
Architectures and applications of intelligent agents: A survey
The Knowledge Engineering Review
Towards effective algorithms for intelligent defense systems
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
| Hi-index | 0.00 |
The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using first order temporal logic languages and are checked relative to the state transition diagram induced by the multi-agent system. Various tight complexity bounds of the behavior properties are established under natural structural and semantic restrictions on agent programs and actions. There are some interesting cases, where the check problem is decidable in deterministic or nondeterministic polynomial time.