2002
DOI: 10.1007/3-540-45448-9_15
|View full text |Cite
|
Sign up to set email alerts
|

An Abstract Machine for Classes of Communicating Agents Based on Deduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2002
2002
2011
2011

Publication Types

Select...
2
1

Relationship

3
0

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…In contrast, the caught operator was defined using a ask(s,ψ)/tell(r,ϕ) pair involving a simplified ϕ ψθ operation (because the agent's local state cannot be of any use in this case). Somehow, this a posteriori justifies the choice of communication primitives we made in [3]. We are well aware of the formal inconsistencies that arise when trying to model self referential sentences using a single uniform language, as discovered by Montague [13].…”
Section: Discussionmentioning
confidence: 84%
See 2 more Smart Citations
“…In contrast, the caught operator was defined using a ask(s,ψ)/tell(r,ϕ) pair involving a simplified ϕ ψθ operation (because the agent's local state cannot be of any use in this case). Somehow, this a posteriori justifies the choice of communication primitives we made in [3]. We are well aware of the formal inconsistencies that arise when trying to model self referential sentences using a single uniform language, as discovered by Montague [13].…”
Section: Discussionmentioning
confidence: 84%
“…where the acknowledgment flag ack(i,message) is raised in l Class when the message issued by agent i is interpreted using function τ i (for further details, see [3]). Similarly to actions, the synchronizing operations tellAsk and callReturn are interpreted by state transformer functions τ Class that uses l Class as a blackboard.…”
Section: A Virtual Machine For Executing Dialogsmentioning
confidence: 99%
See 1 more Smart Citation
“…At the¯rst level, resulting from the integration of communication into a model of intelligent agents [Bonzon, 2002a], processes are de¯ned in a high level language that provides the necessary tool for the simulation of cognitive functions. At the second level, abstract de¯nitions (including logical expressions representing compiled knowledge) are mapped into a variation of the -calculus [Milner, 1999].…”
Section: Introduction: a Methodological Problemmentioning
confidence: 99%
“…We then integrated within this framework a simplification of the communication model [5]. In the resulting model [1], two agents communicate under the control of nd-plans requiring each a synchronization flag. These plans are directly executable on our abstract machine (in essence, a sequential machine with deductive capabilities).…”
Section: Introductionmentioning
confidence: 99%