It
is similar for the semantic information processing in e-business.
Figure 13. Algorithm to resolve conflicts
Given ontologies with hierarchies
FOR each conflict situation in the hierarchy DO
Let the conflict situation be ontologies A, B1, ??¦, Bn (n > 1) where B1, ??¦, Bn are
the nearest ancestor ontologies of A that specify a property p.
/* Note that a ancestor ontology of some Bi may itself specify a property p. */
/* Check the semantics of p in B1, ??¦, Bn */
IF semantics of p is the same in B1, ??¦, Bn THEN
IF intersection of B1, ??¦, Bn is empty THEN
***Design error, since ontology A (which is the intersection of B1, ??¦, Bn) is empty
ELSE
******/* same semantics (Factoring) */
IF there exists a more general ontology K which is UNION of B1, ??¦, Bn THEN
Factor p to ontology K
ELSE
Resolve the conflict by either:
(a) creating a general ontology K that is the UNION of B1, ??¦, Bn and
factoring p to K.
OR
(b) Explicitly choosing one parent ontology to inherit the property.
ENDIF
ENDIF
ELSE
/* different semantics */
Let G1, G2, ??¦, Gm be sets of mutually exclusive ontologies from B1, ??¦, Bn such
that ontologies in a group share the same semantics for p.
Pages:
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486