Decomposition of task specification problems

  • Hung Son Nguyen
  • Sinh Hoa Nguyen
  • Andrzej Skowron
Communications 4A Intelligent Information Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1609)


We consider a synthesis of complex objects by multi-agent system based on rough mereological approach. Any agent can produce complex objects from parts obtained from his sub-agents using some composition rules. Agents are equipped with decision tables describing (partial) specifications of their synthesis tasks. We investigate some problems of searching for optimal task specifications for sub-agents having task specification for a super-agent. We propose a decomposition scheme consistent with given composition rules. The computational complexity of decomposition problems is discussed by showing that these problems are equivalent to some well known graph problems. We also propose some heuristics for considered problems. An illustrative example of decomposition and synthesis scheme for object assembling by multi-agent system is included. We show an upper bound of an error rate in synthesis process of our system. A preliminary results related to the presented approach have been reported in [6, 11].


multiagent system decomposition rough mereology 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Amarel, PANEL on AI and Design, in: J. Mylopoulos and R. Reiter, eds., Proceedings Twelfth International Conference on Artificial Intelligence (Sydney, Australia, 1991), pp. 563–565.Google Scholar
  2. 2.
    K. Decker and V. Lesser, Quantitative modelling of complex computational task environments, in: Proceedings AAAI-93 (Washington, DC, 1993), pp. 217–224.Google Scholar
  3. 3.
    E.H. Durfee, Coordination of Distributed Problem Solvers (Kluwer, Boston, 1988).MATHGoogle Scholar
  4. 4.
    Garey M.R., Johnson D.S., Computers and Interactability. A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, New York, 1979).Google Scholar
  5. 5.
    M.N. Huhns, M.P. Singh, L. Gasser (eds.), Readings in agents, (Morgan Kaufmann, San Mateo, 1998).Google Scholar
  6. 6.
    H.S. Nguyen, S.H. Nguyen, The decomposition problem in multi-agent system. Proceedings of the W8 Workshop at ECAI’98 on Synthesis of Intelligent Agents from Experimental Data. Brighton August 24, 1998 (internal report).Google Scholar
  7. 7.
    Z. Pawlak, Rough sets: Theoretical Aspects of Reasoning about Data (Kluwer, Dordrecht, 1991).Google Scholar
  8. 8.
    L. Polkowski, A. Skowron: Rough mereology: A new paradigm for approximate reasoning. International Journal of Approximate Reasoning 15/4 (1996), pp. 333–365.MathSciNetCrossRefGoogle Scholar
  9. 9.
    L. Polkowski and A. Skowron, Rough sets: A perspective, in: L. Polkowski and A. Skowron, eds., Rough Sets in Knowledge Discovery 1: Methodology and Applications (Physica-Verlag, Heidelberg, 1998), pp. 31–56.Google Scholar
  10. 10.
    A. Skowron and L. Polkowski. Rough mereological foundations for design, analysis, synthesis, and control in distributed systems. Information Sciences An International Journal 104(1–2) (1998), pp. 129–156.MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    A. Skowron, H.S. Nguyen. The Task Decomposition Problems in Multi-Agent Systems. In Proc. of CSP98, Humboldt University, Berlin, 1998 (internal report).Google Scholar
  12. 12.
    R.B. Rao and S.C.-Y. Lu, Building models to support synthesis in early stage product design, in: Proceedings of AAAI-93; Eleventh National Conference on Artificial Intelligence (AAAI Press/MIT Press, Menlo Park, 1993), pp. 277–282.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Hung Son Nguyen
    • 1
  • Sinh Hoa Nguyen
    • 1
  • Andrzej Skowron
    • 1
  1. 1.Institute of MathematicsWarsaw UniversityWarsawPoland

Personalised recommendations