search

KnowledgeGarden / tiny-tsc

The Scholar's Companion (TSC) rational reconstruction of Eurisko + QP Theory
Apache License 2.0
0 stars 1 forks source link

Pre-compiled Transitive Closure #3

Open KnowledgeGarden opened 2 years ago

KnowledgeGarden commented 2 years ago

In QP inference, we are always asking (isA(A, B)) which means, in theory, a recursive walk up transitive closure on A, looking for B, which means a lot of round trips to the database.

It's possible to just create a slot called, say, transclose or something like that, a set which is created when the object is created by cloning the transitive closure of its parent class - if any.

It's time to add that to this code.

KnowledgeGarden commented 2 years ago

Started TaxonomyManager to manage both transitive closure and UI tree node population; in both cases, there is a lot of database hits going on.