A logic-based calculus of events
New Generation Computing
Nonmonotonic logic and temporal projection
Artificial Intelligence
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Maintaining a topological order under edge insertions
Information Processing Letters
Theory for coordinating concurrent hierarchical planning agents using summary information
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Machine Dreams: Economics Becomes a Cyborg Science
Machine Dreams: Economics Becomes a Cyborg Science
Games That Agents Play: A Formal Framework for Dialogues between Autonomous Agents
Journal of Logic, Language and Information
A Social Semantics for Agent Communication Languages
Issues in Agent Communication
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Annals of Mathematics and Artificial Intelligence
Temporal linear logic as a basis for flexible agent interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Implementing commitment-based interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On illegal composition of first-class agent interaction protocols
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Annotation and matching of first-class agent interaction protocols
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Re-use of interaction protocols for agent-based control applications
AOSE'02 Proceedings of the 3rd international conference on Agent-oriented software engineering III
Using constraints and process algebra for specification of first-class agent interaction protocols
ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
Modeling agents' choices in temporal linear logic
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
What the 2007 TAC Market Design Game tells us about effective auction mechanisms
Autonomous Agents and Multi-Agent Systems
Evolutionary mechanism design: a review
Autonomous Agents and Multi-Agent Systems
Reasoning about agents and protocols via goals and commitments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Characterising and matching iterative and recursive agent interaction protocols
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Reactive reasoning and planning
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Parallel TBox Classification in Description Logics --First Experimental Results
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hi-index | 0.00 |
To be truly adaptive in dynamic environments, agents must be able to interact in ways that were not conceived at design time. One way to achieve this is to use executable protocol specifications, in which participants can share a protocol specification at runtime, and interact using the specified rules. In such a model, it is necessary that an agent can quickly and correctly locate a protocol that achieves its goals. Building on previous work, we present a method for characterising, storing, structuring, and searching protocol libraries. Libraries are represented using subsumption hierarchies, in which the vertices represent characterisations of protocols, and edges record a relation between two characterisations if one characterisation subsumes the other. This structure can be used to prevent searching of irrelevant parts of the library. An experimental analysis demonstrates that searching the library has an average-case time complexity of On, which is the same as a standard linear search, however, the measured time is significantly lower. Despite this, the cost of structuring the library has an average-case time complexity On^2, so the ratio of searches to insertions must be high to gain a benefit.