Multi-threaded Communicating Agents in Qu-Prolog

Clark, Keith L., Robinson, Peter J. and Amboldi, Silvana Zappacosta (2006). Multi-threaded Communicating Agents in Qu-Prolog. In: F. Toni and P. Torroni, Lecture Notes in Computer Science: Computational Logic in Multi-Agent Systems. 6th International Workshop on Computational Logic in Mult-Agent Systems (CLIMA VI), London, UK, (186-205). 27-29 June, 2005. doi:10.1007/11750734_11


Author Clark, Keith L.
Robinson, Peter J.
Amboldi, Silvana Zappacosta
Title of paper Multi-threaded Communicating Agents in Qu-Prolog
Conference name 6th International Workshop on Computational Logic in Mult-Agent Systems (CLIMA VI)
Conference location London, UK
Conference dates 27-29 June, 2005
Proceedings title Lecture Notes in Computer Science: Computational Logic in Multi-Agent Systems   Check publisher's open access policy
Journal name Computational Logic in Multi-Agent Systems   Check publisher's open access policy
Place of Publication Berlin
Publisher Springer-Verlag
Publication Year 2006
Sub-type Fully published paper
DOI 10.1007/11750734_11
ISBN 3540339965
9783540339960
ISSN 0302-9743
1611-3349
Editor F. Toni
P. Torroni
Volume 3900
Start page 186
End page 205
Total pages 20
Language eng
Abstract/Summary In this tutorial paper we summarise the key features of the multi-threaded Qu-Prolog language for implementing multi-threaded communicating agent applications. Internal threads of an agent communicate using the shared dynamic database used as a generalisation of Linda tuple store. Threads in different agents, perhaps on different hosts, communicate using either a thread-to-thread store and forward communication system, or by a publish and subscribe mechanism in which messages are routed to their destinations based on content test subscriptions. We illustrate the features using an auction house application. This is fully distributed with multiple auctioneers and bidders which participate in simultaneous auctions. The application makes essential use of the three forms of inter-thread communication of Qu-Prolog. The agent bidding behaviour is specified graphically as a finite state automaton and its implementation is essentially the execution of its state transition function. The paper assumes familiarity with Prolog and the basic concepts of multi-agent systems.
Subjects E1
280301 Programming Techniques
700199 Computer software and services not elsewhere classified
Keyword Computer Science, Theory & Methods
Q-Index Code E1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Fri, 24 Aug 2007, 07:45:46 EST