Deductions
- algorithm has quality existence ⇐ (algorithm has quality class), (class has quality existence), (has quality is a transitive relation)
- algorithm has quality entity ⇐ (algorithm has quality class), (class has quality entity), (has quality is a transitive relation)
- algorithm has quality taxonomic rank ⇐ (algorithm has quality class), (class has quality taxonomic rank), (has quality is a transitive relation)
- algorithm has quality superclass ⇐ (algorithm has quality class), (class has quality superclass), (has quality is a transitive relation)
- algorithm has quality class ⇐ (quality is a class), (algorithm has quality quality)
- algorithm has quality quality ⇐ (computational complexity is subclass of quality), (algorithm has quality computational complexity)
- algorithm has quality measure ⇐ (computational complexity is subclass of measure), (algorithm has quality computational complexity)
- preferred rank has quality algorithm ⇐ (preferred rank is subclass of evaluation), (evaluation has quality algorithm)
- evaluation has quality algorithm ⇐ (evaluation strategy is subclass of algorithm), (evaluation has quality evaluation strategy)
- artist file has quality algorithm ⇐ (evaluation strategy is subclass of algorithm), (artist file has quality evaluation strategy)