Hi Niranjan,
Sorry no.
You might want to take a look at prolog/xsb based engines like flora-2.
I don't know what they support in the way of derivation tracing but at
least with a full prolog engine you could have a wrapper that induces a
fail to retry the goals.
Dave
On 12/08/13 20:23, Niranjan Balasubramanian wrote:
Dave
Thanks.
Yes, getting at *all* possible derivations is bound to be problematic. How
about finding K traces through the derivation graph? Is there any way to force
the backward-chaining procedure to run until the answer is found K times (via
different paths) or until the search space is exhausted?
~ Niranjan.
On Aug 12, 2013, at 11:01 AM, Dave Reynolds wrote:
On 12/08/13 17:47, Niranjan Balasubramanian wrote:
Hello all,
I am a new user. I need to generate all possible derivations for a statement
inferred via backward chaining. Based on what I understand from the
documentation and a small test case I wrote, it appears that Jena outputs only
one derivation (and possibly stops inference as soon as the target statement is
inferred). Is this true?
Correct. Once Jena has an answer to the query it stops. It will record the
derivation trace for that answer but will not check alternative derivations.
[After all there can be a *very* large number of possible traces through the
derivation graph.]
Are there other toolkits that support multiple derivations?
Don't know.
Dave
