Skip to content

Documentation for Computed Relationship #33

@cmungall

Description

@cmungall

The TransitivityGraph page mentions this but it isn't defined.

Computed Relationship

A computed relationship (or inferred relationship) is a relationship that is inferred through the application of a set of rules. For example, if P is declared transitive, then given path

x P y P z

There is a computed relationship x P z.

Implementations may differ in how this is performed, but as a general rule the rules should be specified in OWL, and the implementation should be complete w.r.t the EL++ subset of OWL. This allows for property chains, e.g.

Given

  P o Q -> R

And a path

  x P y Q z

Then there is an inferred relationship x R z

Non-reducible paths

If we have a path

x P y Q z

And there are no property chains connecting P and Q, then the path between x and z cannot be reduced any further than a computed relationship

x (P o Q) z

For now we only allow primitive relations between nodes; thus the path between x and z would be discarded. In future we may make this configurable[??]

Base case

There is at least one computed edge for every asserted edge. Thus if the graph contains

x R y

Then it is valid to call 'x R y' a computed edge

Implementations

We currently use the OWLGraphWrapper implementation

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions