Speculative constraint processing for hierarchical agents

  • Authors:
  • Hiroshi Hosobe;Ken Satoh;Jiefei Ma;Alessandra Russo;Krysia Broda

  • Affiliations:
  • (Correspd.) National Institute of Informatics, Tokyo, Japan. E-mails: {hosobe, ksatoh}@nii.ac.jp;National Institute of Informatics, Tokyo, Japan. E-mails: {hosobe, ksatoh}@nii.ac.jp;Imperial College London, London, United Kingdom. E-mails: {jm103, ar3, kb}@doc.ic.ac.uk;Imperial College London, London, United Kingdom. E-mails: {jm103, ar3, kb}@doc.ic.ac.uk;Imperial College London, London, United Kingdom. E-mails: {jm103, ar3, kb}@doc.ic.ac.uk

  • Venue:
  • AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Speculative computation is an effective means for solving problems with incomplete information in multi-agent systems. It allows such a system to compute tentative solutions by using default knowledge about agents even if communications between agents are delayed or fail. Previously we have proposed a logical framework for speculative constraint processing for master-slave multi-agent systems. In this paper, we extend the framework to support more general multi-agent systems that are hierarchically structured. We provide an operational model for the framework and present a prototype implementation of the model.