Deprecated.Will be removed in following AlcomoVersions (was used in javasript based manual evaluation).
Computes the set of all conflict sets in the efficient mode. This method will find most
pairs of conflicting correspondences, conflict sets of higher cardinality are not yet
supported.
Returns the merged mapping where confindences have been computed in a way
such that the following holds for two correspondences c1 and c2:
(1) conf(c1) <h; conf(c2) iff less systems found c1 (Vote)
Computes the next index that has to be removed following a greedy strategy that first chooses according to conflicts
in which a correspondence is involved, and next takes uses the confidence value.
Initializes an IOntology by setting up an additional interval tree,
that represents very fast index structures highly beneficial in the
pattern-based reasoning.
22
Greedy method that generates an minimal hitting set over all pattern-based conflicts by
iteratively deleting the correspondence that is involved in the highest number of conflicts.
An PCF exception handles problems related to parameter (P) like imvalid
combinations of parameters, as well as things related to the control flow (CF)
like the invalid order of method calls.