Recently, I submitted the first big paper on our #Python 
based approach for #FormalKnowledgeRepresentation.
If accepted, it will be #OpenAccess
The preprint is OA anyway:
https://www.preprints.org/manuscript/202401.0060/v1
The approach allows to model the content of mathematical theorems (such as Pythagoras) as nodes and edges in a #knowledgegraph
This is done via *qualifiers* – a concept borrowed from #Wikidata
![Screenshot of a page of the manuscript.
In the main part it shows a depiction of the (automatically) constructed knowledge graph. With ≈850 nodes and
≈8000 edges.
The caption reads:
Visualization of the whole knowledge graph. While it is impossible to extract meaningful details from this picture it illustrates the high degree of interconnection. Edges of type R3["is subclass of"] are blue, R4["is instance of"] are orange and all other edges types are colored black.](https://f2.tchncs.de/media_attachments/files/111/726/187/941/906/511/original/7cddf6b0d84eb6bb.png "Screenshot of a page of the manuscript.
In the main part it shows a depiction of the (automatically) constructed knowledge graph. With ≈850 nodes and
≈8000 edges.
The caption reads:
Visualization of the whole knowledge graph. While it is impossible to extract meaningful details from this picture it illustrates the high degree of interconnection. Edges of type R3[\"is subclass of\"] are blue, R4[\"is instance of\"] are orange and all other edges types are colored black.")