Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
On statecharts with overlapping
ACM Transactions on Software Engineering and Methodology (TOSEM)
AgentSpeak(L): BDI agents speak out in a logical computable language
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
Thinking Quickly: Agents for Modeling Air Warfare
AI '98 Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence
A Formal Specification of dMARS
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
The Psi Calculus: An Algebraic Agent Language
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Go!—A Multi-Paradigm Programming Language for Implementing Multi-Threaded Agents
Annals of Mathematics and Artificial Intelligence
Proving BDI Properties of Agent-Oriented Programming Languages
Annals of Mathematics and Artificial Intelligence
Motivation for a new formal framework for agent-oriented software engineering
International Journal of Agent-Oriented Software Engineering
Agents, multi-agent systems and declarative programming: what, when, where, why, who, how?
A 25-year perspective on logic programming
An organisation infrastructure for multi-agent systems based on agent coordination contexts
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
A strength of agent architectures such as PRS and dMARS, which are based on stored plan execution, is that their plan languages offer an easily understood, visual representation of behaviour that permits their underlying architectural complexity to be partially abstracted and effectively exploited. Unlike visual representations of behaviour used in methodologies such as UML for programming in Object Oriented languages such as \textsfJava, plan graphs constitute a direct, executable specification of agent behaviour rather than a model which guides implementation refinement. Previously, such languages have lacked a formal semantic basis. This paper presents key elements of a new visual programming language ViP which has a complete and exact semantics based upon a recently described agent process algebra -- the &PSgr; calculus.