| M. d'Inverno and M. Luck. Engineering agentspeak(l): A formal computational model. Logic and Computation, 8(3):233--260, 1998. |
....defined in an inline procedure CheckMail in a header file. This can be altered by the user to change or extend the semantics of communication acts, if necessary. Note that checking for messages is not explicitly mentioned in the original definitions of the abstract interpreter for AgentSpeak(L) [13, 5]. We here have separate stages in the interpretation cycle for considering inter agent communication and perception of the environment, then belief revision takes care of both sources of information (in the figure, perception of the environment is implicit within belief revision) The trust ....
....believes alliance(ag3,ag2) hence no further event is generated by belief revision) Once this modification is made, the formul above can be verified. 6. RELATED WORK Since Rao s original proposal [13] a number of authors have investigated a range of different aspects of AgentSpeak(L) In [5], a complete abstract interpreter for AgentSpeak(L) was formally specified using the Z specification language. Some extensions to AgentSpeak(L) were proposed in [2] and an interpreter for the extended language was introduced. The extensions aim at providing a more practical programming language; ....
M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A formal computational model. J. Logic and Computation, 8(3):1--27, 1998.
....we decided to base our new system on an existing solid framework for describing BDI agents. We found Rao s work on AgentSpeak(L) particularly useful [ Rao, 1996 ] because it demonstrates a successful reverse engineering approach of an implemented MAS that is now given a formal speci cation [ d Inverno and Luck, 1998 ] By extending Rao s speci cation with our new features for complex plans (e.g. di erent types of plans, parallel plans and plan elements, speculative computations) and re ning the abstract interpreter it was possible for us to directly derive an ecient implementation that supports these new ....
M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A Formal Computational Model. In: Journal of Logic and Computation, 8(3), p.233-260, 1998.
....consider only the users who have a space containing resources they need. It will be interesting to think about those who have no resource and build a model of their behaviour to see what would happen in this case. This could be studied using multi agent systems and work has been done in this area [14, 6], in which there is an interesting study about cooperation between autonomous agents and engagement of non autonomous agents. This can help us to give the semantics of the behaviour of users and resources in the usage of natural resources. ffl The problem of spatio temporal modeling of natural ....
M. d'Inverno and M. Luck. Engineering agentspeak(l): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
....elsewhere, but instead to show how it may be applied to different systems, and how they may be accommodated within a single overarching framework. Similarly, we are not concerned in this paper with the detailed specification of agent behaviour, though we have addressed this previously in [16, 18], nor with reasoning about agent behaviour, though again related work has addressed this, for example in the context of Agentis [15, 56] 1.2 Overview In this paper, we review and build on previous work that has developed a formal agent framework and extend it to construct several agent models. ....
M. d'Inverno and M. Luck. Engineering agentspeak(l): A formal computational model. Logic and Computation, 8(3):233--260, 1998.
....g = 0g Front Contexts An important type of context, known as a front context, is used to illustrate significant properties of 3APL. Front contexts are contexts with precisely one Note that our use of the term context is distinct from the notion of a context in such systems as AgentSpeak(L) [13, 3], which is defined as the pre condition of a plan. 1:choice (seqcomp ( bac ins agenda(meeting; Time; Dur; People; Loc) 2:seqcomp (seqcomp (query pos free(Time; Length) goalvar X) 3:goalvar X 4:seqcomp ( bac ins(agenda(meeting; Time; Dur; People; Loc) 5:choice (seqcomp ( bac ....
.... squarecount fc = 1 A goal may contain both goal variables as well as first order variables. We therefore define three functions that return the set of all variables, goal variables and first order variables, respectively, of a goal. A definition of optional and related elements can be found in [3]. goalvars : optional [Goal ] P Var) goalgvars : optional [Goal ] P GVar) goalfovars : optional [Goal ] P FOVar) 8 g : optional [Goal ] a : Action; b : Belief at : Atom; g 1 ; g 2 : Goal ; gv : GVar goalvars = goalvarsfbac ag = actionvars a goalvarsfquery bg = beliefvars ....
[Article contains additional citation context not shown here]
M. d'Inverno and M. Luck. Engineering agentspeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
.... different agents [14] which has been used as a basis for investigating aspects of the relationships between agents [16] providing an operational account of their invocation and destruction [6] and analysing their complexity [8] as well as for reformulating existing systems and theories [3,4,7]. In all this, however, one aspect has either been omitted or only briefly alluded to, namely a detailed account of the generation of goals from motivations, and goal adoption between agents. This paper addresses that omission, by showing how the formal framework may be used to provide a detailed ....
M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
....(e.g. 2, 13] all have rather different specific architectural bases. As a means of building up a general model of power and norms, we start by offering an abstract BDI architecture, which does not fit with any specific model, but is inspired by previous work on dMARS [10] and AgentSpeak(L) [11]. It includes the salient features, but omits irrelevant details. The model itself follows this previous work and consequently we do not provide an extensive description. In what follows, we use the Z specification language to construct a formal model of the BDI agents and of inter agent ....
M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
....g ##g Front Contexts An important type of context, known as a front context, is used to illustrate significant properties of 3APL. Front contexts are contexts with precisely one 1 Note that our use of the term context is distinct from the notion of a context in such systems as AgentSpeak(L) [13, 3], which is defined as the pre condition of a plan. ######## ######## ### ### ### ############### ##### #### ####### ####### ## ######### ######## ###### ### ########## ######## ### ####### ## ######### # ######### ### ### ################### ##### #### ####### ##### ######## ######## ### ### ....
.... squarecount fc ## A goal may contain both goal variables as well as first order variables. We therefore define three functions that return the set of all variables, goal variables and first order variables, respectively, of a goal. A definition of optional and related elements can be found in [3]. goalvars # optional #Goal # ## Var# goalgvars # optional #Goal # ## GVar# goalfovars # optional #Goal # ## FOVar# 8 g # optional #Goal ## a # Action# b # Belief at # Atom# g # # g # # Goal # gv # GVar goalvars# # # goalvarsfbac ag # actionvars a goalvarsfquery bg # beliefvars ....
[Article contains additional citation context not shown here]
M. d'Inverno and M. Luck. Engineering agentspeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
.... different agents [14] which has been used as a basis for investigating aspects of the relationships between agents [16] providing an operational account of their invocation and destruction [6] and analysing their complexity [8] as well as for reformulating existing systems and theories [3,4,7]. In all this, however, one aspect has either been omitted or only briefly alluded to, namely a detailed account of the generation of goals from motivations, and goal adoption between agents. This paper addresses that omission, by showing how the formal framework may be used to provide a detailed ....
M. d'Inverno and M. Luck. Engineering AgentSpeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
....languages and architectures with inadequate justification and relation to the broader field, we have been working on a more uniform perspective to enable a stronger inter relation and comparison of different systems and approaches. For example, work on specifying dMARS [1] and AgentSpeak (L) [2] in a consistent fashion, and on comparing 3APL, AgentSpeak(L) and AGENT 0 [6, 7] has attempted to address these concerns and, in so doing, helps to clarify the agent oriented approach and more general properties of agents. Our concern is with the notion of intelligent agents both in their ....
.... a formal Z specification of the agent programming language 3APL [5] pronounced triple a p l ) and its architecture [6] Z is a well known and commonly used formal specification language [11] that has also been used to specify several other agent properties, languages and architectures (e.g. [4, 1, 2]) As a consequence, our use of Z allows us to develop a formal description of 3APL that can more easily be related to, and compared with, these other systems. Equally, Z enables a uniform presentation of both the 3APL language and its architecture in a clear and concise way. We are not familiar ....
[Article contains additional citation context not shown here]
M. d'Inverno and M. Luck. Engineering agentspeak(L): A formal computational model. Journal of Logic and Computation, 8(3):233--260, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC