Generalized conflict and resolution model with approximation spaces

  • Authors:

  • Sheela Ramanna;James F. Peters;Andrzej Skowron

  • Affiliations:

  • Department of Applied Computer Science, University of Winnipeg, Winnipeg, Manitoba, Canada;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada;Institute of Mathematics, Warsaw University, Warsaw, Poland

  • Venue:
  • RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers the problem of a generalized model for conflict analysis and resolution. Such a model would be helpful in analyzing and resolving conflict in disputes in both government and industry, where disputes and negotiations about various issues are the norm. The issue here is how to model a combination of situations among agents i) where there are disagreements leading to a conflict situation ii) need for an acceptable set of agreements. The solution to this problem stems from pioneering work on this subject by Zdzisław Pawlak, which provides a basis for a generalized model encapsulating a decision system with complex decisions and an approximation space-based conflict resolution using rough coverage. An example of a requirements scope negotiation for an automated lighting system is presented. The contribution of this paper is a rough set based requirements scope determination model using a generalized conflict model with approximation spaces.