I am a Dings_Predicate, that defines the Negation-Relation between two Dings_Predicates.
I define, that a Dings_Predicate Q is the Logical-Negation of a Dings_Predicate P.
This enables Deterministic Conflict-Detection in the Graph.
[<Predicate_P>](<Dings_Number>) <a href="300043053.html">Negates</a> [<Predicate_Q>](<Dings_Number>)If:
P Negates QA P B existsthen a Triple A Q B is Forbidden.
And vice versa.
If an Operation would create such a Forbidden-Pair, the Operation must be blocked.
Negates is intended to be symmetric:
P Negates Q, then also
Q Negates P.