Inspiration

When I learn things it helps to create mental associations with other things. But sometimes I wonder if I'm missing something that would make stuff easier to remember.

What it does

Act takes in a markdown file, and will parse it for statements with formats specified in a json file. It will then make a knowledge graph of these statements, and then uses a Subgraph Isomorphism based algorithm to solve the graph, and file possible associations you might have missed.

How we built it

I used d-lang to write this so I could learn a new language while working on my project.

Challenges we ran into

Subgraph isomorphism is a NP-Complete problem, so this solution depends on the users inferencing rules being extremely simple.

Accomplishments that we're proud of

I am glad I was able to get this project working in the time I did, especially since the primary solver algorithm is so specific I couldn't find a paper to help with the implementation.

Built With

  • d
  • d-lang
  • dub
Share this project:

Updates