Hypertext users often suffer from the “lost in hyperspace ” problem: disorientation from too many Jumps while traversing a complex network. One solution to this problem is Improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis. In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The fu-st part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext The second part helps authors by Identifying properties of the hypertext document Multiple metrics are developed including compactness and stratum. Compactness indicates the mtrinslc connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others. Several exmting hypertext are used to illustrate the benefits of each techmque. The collection of techmques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easdy,

this paper. This is so, as finding the maximally consistent subset of the defaults requires testing propositional satisfiability, which is known to be an intractable problem. This is a serious problem, as our intention is to use the logic in a mediating system, where the system must decide in some reasonable period of time whether or not some move is permissable. We have some ideas about how to solve this problem, by using discourse norms to distribute the burden of proof among the participants, rather than requiring the mediating system to solve such problems. This approach was also used in the Pleadings Game. 3. In this abstract we concentrated on the basic logical level of our intended system. The final paper will contain more information about the other two layers of the Zeno system. In particular, we intend use the logical formalism presented here not only for representing knowledge of the domain of discourse, but also to reason about permissions and obligations in the discourse game, that is at the third level. Acknowledgements

2 Literature review.....................................................................................................8

Abstract: Win-Win is one of the most common models which help systems stakeholders resolve conflicts during system Requirements Negotiation (RN). Solving conflicts, however, is barely dependent on visualizing the negotiation itself. The Zest algorithm was invented to visualize a standard e-mail discussion and demonstrate a concise overview of the discussion to facilitate a more productive one. This research sought to use this algorithm in visualizing the RN process in groupware. We have formulated a conceptual diagram on which to base the design and development process of the groupware for implementing the Zest algorithm. Our implementation of the algorithm has later been enhanced to produce more types of visualizations in relation to RN. Keywords: Win-Win model, Requirements negotiation, visualization, Zest algorithm, and groupware