As of this post, there are only links to the next chapter at the top of the page. I'm not there when I want to go to the next chapter, because I've scrolled all the way to the bottom. Links at the bottom would make it easier to continue reading.

In general we need to:

• update missing link destinations using full module path
• update ambiguous link destination using full module path
• there are many cases of missing documentation in internal modules because the documentation is available in a higher level module which is exposed. In such cases we can write "See 'xyz'" in the docs. This is also useful for the new readers if they are w

The AtomTable uses a mutex to guard access to the TypeIndex. This mutex could be mostly avoided by using a concurrent hash map. The one described here: https://preshing.com/20160201/new-concurrent-hash-maps-for-cpp/ seems like a good choice. implementing this requires

• Copying the concurrent hash map source to cog-utils
• Modifying TypeIndex to use it.
• Removing the mutex lock in `AtomT

I am using Souffle and I wonder if it supports "importing" one .dl file inside another one so I can share code between different ".dl" files?

I've read the help message on "-L" and "-I", but they seem not related to the problem I had.

Thanks in advance!

The B-Prolog 8.1 native random number generator returns random integers, both positive and negative, with no documentation on their range. Given that B-Prolog also claims that its implementation of integer arithmetic is unbound, we cannot use its native random number generator as basis to generate random numbers in a given interval.

consider the use-case:

t(Urn,L) :- f(Urn, "urn:rdfs:label", L), L = "Lomonosov Russia".

predicate f bind second variable to "urn:refs:label" but variable name unknown. The parser builds

#{t => [[urn,l],
   #{'@' => f,
     '_' => [urn,<<"urn:rdfs:label">>,l],
     l => <<"Lomonosov Russia">>}]}

The native query builder shall be aware of [urn,<<"urn:rdfs:label">>,l] mappin

Join this game, fork and submit your solution (PR) which can beat my tank.
The winner can leave your Github avatar and Github id in this repo.

You can get start and play with the demo.