The synthesis of digital machines with provable epistemic properties
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Intention is choice with commitment
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Agent-oriented software engineering: the state of the art
First international workshop, AOSE 2000 on Agent-oriented software engineering
Intelligent Agents: The Key Concepts
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
On Augmenting Reactivity with Deliberation in a Controlled Manner
Balancing Reactivity and Social Deliberation in Multi-Agent Systems, From RoboCup to Real-World Applications (selected papers from the ECAI 2000 Workshop and additional contributions)
CardS4: Modal Theorem Proving on Java Smartcards
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
CardKt: Automated Multi-modal Deduction on Java Cards for Multi-application Security
JavaCard '00 Revised Papers from the First International Workshop on Java on Smart Cards: Programming and Security
On the Relationship Between BDI Logics and Standard Logics of Concurrency
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
A Model Checking Algorithm for Multiagent Systems
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
The Computational Complexity of Agent Verification
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Analysis and Verification of Multi-Agent Interaction Protocols
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Validation of multiagent systems by symbolic model checking
AOSE'02 Proceedings of the 3rd international conference on Agent-oriented software engineering III
Hybrid architecture based on support vector machines
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Discovering Semantic Web services using SPARQL and intelligent agents
Web Semantics: Science, Services and Agents on the World Wide Web
Annals of Mathematics and Artificial Intelligence
A tableau method for verifying dialogue game protocols for agent communication
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Model checking for PRS-like agents
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
Observation-Based logic of knowledge, belief, desire and intention
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Formalising Abilities and Opportunities of Agents
Fundamenta Informaticae
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
The study of situated systems that are capable of reactive and goal-directed behaviour has received increased attention in recent years. One approach to the design of such systems is based upon agent-oriented architectures. This approach has led to the development of expressive, but computationally intractable, logics for describing or specifying the behaviours of agent-oriented systems. In this paper, we present three propositional variants of such logics, with different expressive power, and analyze the computational complexity of verifying if a given property is satisfied by a given abstract agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the practical use of such logics for verifying agent-oriented systems.