All examples By author By category About

nitaku

Knowledge tree DSL

An example of a Domain-Specific Language for the definition of small knowledge graphs, building on the tangled tree language.

Indentation is used to define a hierarchy of nodes (black) and links (red). Links can be inverted by using < or >.

Three types of links have a special meaning: isA is used to define superclass-subclass relationships, instanceOf links an instance to its class, and denotes links a linguistic term to the concept it stands for.

(Needs cleanup: part of the code for the temporal knowledge graph is still included).