> No, it typically doesn't need to execute the link it is doing inference > on, rather it runs inference trees constructed from inference rules that > produces the target, including updating its TV. Whether this is fast or > slow depends on the inference trees, not so much the target.
I'm not sure I understand, don't the inference trees result from the interaction between the target and the rulebase? > > > If you add a type declaration (I believe the python bindings allow > you > > that), it should speed up the reasoning as well. > Most of the atoms I add are ConceptNodes (200-300 at the moment and almost all of them are places), so restricting chaining to those doesn't help me much. In any case I'm already doing that. > > for instance the frog example show an example of variable declaration in > a backward chainer query > > > https://github.com/opencog/ure/tree/master/examples/ure/frog#backward-chainer > > Yes, that's the same kind of variable declaration that I use above. The VariableList from the GetLink I also give to the backward chainer. What happens for different variations of variable declarations provided for the getlink and the backward chainer, I've detailed in the last post. Best, Alex -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/2cf3a540-b069-4bbf-810b-066c2ecd2051%40googlegroups.com.
