Skip to main content

Logic Tuple Spaces for the Coordination of Heterogenous Agents

  • Chapter
Frontiers of Combining Systems

Part of the book series: Applied Logic Series ((APLS,volume 3))

Abstract

This work presents ACLT, a coordination model aimed to combine and coordinate heterogeneous agents by means of a communication abstraction inspired to the Linda model, but rooted in a logic framework. The twofold interpretation of a logic tuple space both as a message and as a knowledge repository naturally induces a categorization of agents as logic and non-logic. While non-logic agents adopt the basic Linda kernel, logic agents exploit the full power of the ACLT model, which supports deduction and reasoning over the content of the tuple space. By providing a conceptual framework where logic inference and temporal tuple space evolution coexist, ACLT provides a suitable environment to build heterogeneous multi-agent systems, where hybrid agent architectures can be designed, integrating reasoning capabilities together with reactive behaviours.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • J.-P. Banâtre and D. le Métayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15(l):55–77, November 1990.

    Article  MATH  MathSciNet  Google Scholar 

  • L. Borrman and M. Herdieckerhoff. Linda integriert in Modula-2 - ein Sprachkonzept für portable parallele Software. In Proceedings 10 GI/ITG-Fachtagung Architektur und Betrieb von Rechensystemen, Paderborn, March 1988.

    Google Scholar 

  • K.A. Bowen and R.A. Kowalski. Amalgamating Language and Metalanguage in Logic Programming, pages 153–172. Academic Press, 1982. Clark, Tarnlund (eds.).

    Google Scholar 

  • A. Brogi and P. Ciancarini. The concurrent language, Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1), January 1991.

    Google Scholar 

  • P. Ciancarini. Coordinating rule-ba-sed software processes with ESP. Technical Report UBLCS-93–8, Laboratory of Computer Science, University of Bologna, April 1993.

    Google Scholar 

  • P. Ciancarini. Distributed programming with logic tuple spaces. New Generation Computing, 12, 1994.

    Google Scholar 

  • R. Englemore and T. Morgan, editors. Blackboard Systems. Addison-Wesley, Reading, Mass., 1988.

    Google Scholar 

  • D. Gelernter. Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1), January 1985.

    Google Scholar 

  • D. Gelernter. Multiple tuple spaces in Linda. In Proceedings of PARLE, volume 365 of LNCS, 1989.

    Google Scholar 

  • D.Gelernter and N. Carriero. Coordination languages and their significance. Communications of the ACM, 35(2):97–107, February 1992.

    Article  Google Scholar 

  • D.M. Lyons and A.J. Hendriks. Planning for reactive robot behavior. In Proc. of the IEEE Int. Conf. on Robotics and Automation, Nice, France, May 1992.

    Google Scholar 

  • A. Omicini, E. Denti, and A. Natali. Agent coordination and control through logic theories. In Topics in Artificial Intelligence - 4th Congress of the Italian Association for Artificial Intelligence, AI*I A ’95, volume 992 of LNAI, pages 439–450, Firenze, Italy, October 11–13 1995. Springer-Verlag.

    Google Scholar 

  • A. Porto and V. Vasconcelos. Truth and action osmosis (the Tao computation model). http://theory.doc.ic.ac.uk/theory/COORDINATION, January 17 1995.

    Google Scholar 

  • R. Reiter. Non-monotonic reasoning. Ann. Rev. Computer Science, 2:147–186, 1987.

    Article  MathSciNet  Google Scholar 

  • Scientific Computing Associates, Inc., New Haven, CT, USA. C-Linda Reference Manual, 1990.

    Google Scholar 

  • Swedish Institute of Computer Science, Kista, Sweden. SICStus Prolog User’s Manual, 1994

    Google Scholar 

  • F. Zanichelli, S. Caselli, A. Natali, and A. Omicini. A multi-agent framework and programming environment for autonomous robotics. In Proceedings of the International Conference on Robotics and Automation (ICRA’94), pages 3501–3506, S. Diego, CA, USA, May 1994

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Denti, E., Natali, A., Omicini, A., Venuti, M. (1996). Logic Tuple Spaces for the Coordination of Heterogenous Agents. In: Baader, F., Schulz, K.U. (eds) Frontiers of Combining Systems. Applied Logic Series, vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0349-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0349-4_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6643-3

  • Online ISBN: 978-94-009-0349-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics