We need take into account the influence of the introduction of the operator 'Locking'.
* Locking is kind of constraint enforced upon a set of basic assertions, just as those coordinated assertions. Thus, we should pay attention to every place where the discussion of coordinated assertions happens, and we could add the description of 'Locking' nearby.
**************************************************************************************
Q&A
1. How to get the trust value of each assertion?
1) Randomly generation;
2) User assignment;
3) Interactive evaluation based on the procedure in our paper.
4) ...
2. How to visualize the trust values in the assertion graph?
1) The simplest way is to put the trust value (such as tv1, tv2, tv3 and tv4 etc.) as the part of the edge label. Since the trust value is for the whole assertion, we won't distinguish the conflicts introduced by the assertion itself. That's, all edges corresponding with one assertion have same trust values.
2)
1. Assign trust values to each assertions;
The trust value of each assertion could be defined directly by the user, or obtained from the interactively evaluating procedure presented in our paper.
In the assertion graph, we transfer the assertion into some vertices and edges. We also label each edge with the corresponding assertion id. We could assign the trust value to each edges of the very assertion as well, as long as some rules are followed in the assignment.
Some questions are required considering beforehand.
(1) Trust value gives a measurement of the assertion, but nothing about the conflicts introduced by the assertion itself. For example, .... So the question is how to distribute the trust values to its components, such as vertices, edges etc.
(2) Compared with the basic assertion, the coordinated choice assertion is more complicated. How to decide their trust values?
2. Determine the weight for each edge in the assertion graph; thus the heuristic algorithm could be employed when the path query is evaluated.
Therefore, the assertion graph is a directed edge-weighed graph.
First, let's take a look at the simplest case to assign weights of edges in the graph. Below we use an example to illustrate the scheme.
