↑ 13 References
I have a rough proposal for how to do this in a way that is similar to Joel Chan’s Discourse Graph here: Building a knowledge graph in Logseq
For one, a non-restrictive grammar allows users to not have to create prefix links in the front of every linked note like in Discourse Graph. This will be beneficial for use cases that want to connect a large volume of notes in their knowledge graph but don’t want to be restricted to a specific note naming system.
Users may prefer to use semantic complements like in
Discourse Graph (supports
and supported by
)
This could be just like Discourse Graph’s default ontology (types: questions, claims, evidence, etc. relationships: supports, opposes, informs, etc)
for example, a general ontology may be like Joel Chan’s Discourse Graph (types: question, claim, evidence, etc.. relationships: supports, opposes, informs, etc)
This is a generalized knowledge graph proposal based off of the work on Discourse Graph by Joel Chan and David Vargas, so thank you to them. Other inspiration is listed in: # Resources