Skip to main content
Log in

Conflict resolution in multi-agent systems with typed relations for ontology population

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The paper presents a conflict resolution algorithm for multi-agent systems with agents connected by relations of different types and worth. The result of conflict resolution is a conflict-free set of agents. We apply this algorithm for the ambiguity resolution problem in ontology population based on multiagent natural language text analysis.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Garanina, N., Sidorova, E., and Bodin, E., Multiagent text analysis based on ontology of subject domain, Lect. Notes Comput. Sci., 2015, vol. 8974, pp. 102–110.

    Article  MATH  Google Scholar 

  2. Alfawareh, H.M. and Jusoh, S., Resolving ambiguous entity through context knowledge and fuzzy approach, Int. J. Comput. Sci. Eng. (IJCSE), 2011, vol. 3, no. 1, pp. 410–422.

    Google Scholar 

  3. Navigli, R., Word sense disambiguation: A survey, ACM Computing Surv., 2009, vol. 41, no. 2, pp. 1–69.

    Article  Google Scholar 

  4. Kim, D.S., Barker, K., and Porter, B.W., Improving the quality of text understanding by delaying ambiguity resolution, Proc. of the 23rd Int. Conf. on Computational Linguistics (Coling 2010), Beijing, 2010, pp. 581–589.

    Google Scholar 

  5. Fagin, R., Halpern, J.Y., Moses, Y., and Vardi, M.Y., Reasoning about Knowledge, Cambridge, Mass.: The MIT Press, 1995.

    MATH  Google Scholar 

  6. Wooldridge, M., An Introduction to Multiagent Systems, Willey, 2002.

    Google Scholar 

  7. Huhns, M.N. and Stephens, L.M., Multiagent systems and societies of agent, in Multiagent Systems, The MIT Press, 1999, pp. 79–120.

    Google Scholar 

  8. De Gennaro, M.C. and Jadbabaie, A., Decentralized control of connectivity for multi-agent systems, Proc. of the 45th IEEE Conf. on Decision and Control, pp. 3628–3633.

  9. Bergenti, F., Franchi, E., and Poggi, A., Selected models for agent-based simulation of social networks, Proc. of the 3rd Symp. on Social Networks and Multiagent Systems (SNAMAS 2011), 2011, pp. 27–32.

    Google Scholar 

  10. Garanina, N.O. and Bodin, E.V., Distributed termination detection by counting agent, Proc. of the 23rd Int. Workshop on Concurrency, Specification and Programming (CS&P 2014), Chemnitz, Germany, 2014, pp. 69–79.

    Google Scholar 

  11. Tel, G., Introduction to Distributed Algorithms, Cambridge Univ. Press, 2000.

    Book  MATH  Google Scholar 

  12. Garanina, N.O. and Sidorova, E.A., Ontology population as algebraic information system processing based on multi-agent natural language text analysis algorithms, Program. Comput. Software, 2015, vol. 41, no. 3, pp. 140–148.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. O. Garanina.

Additional information

Original Russian Text © N.O. Garanina, E.A. Sidorova, I.S. Anureev, 2016, published in Programmirovanie, 2016, Vol. 42, No. 4.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Garanina, N.O., Sidorova, E.A. & Anureev, I.S. Conflict resolution in multi-agent systems with typed relations for ontology population. Program Comput Soft 42, 206–215 (2016). https://doi.org/10.1134/S0361768816040034

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768816040034

Navigation