Supposing I have an ordering relation and some predicates:
- A < B
- A < C
- B < C
The predicate A<C is redundant since it is implied by the other two.
Is there a standard algorithm for reducing all such sets of statements?
↧
Is there a standard algorithm for removing redundant statements of ordering?
↧