Closed mehalter closed 4 years ago
Implement RelationalOlog decoration on a cospan of a finite set of objects and implement necessary category theory definitions to solve pushout, dpo, etc.
Show that the instance of the decoration creates a knowledge graph.
These relational ologs should be based on https://arxiv.org/abs/1706.00526.
Implement RelationalOlog decoration on a cospan of a finite set of objects and implement necessary category theory definitions to solve pushout, dpo, etc.
Show that the instance of the decoration creates a knowledge graph.