/** * Adds a set of precomputed triples to the deductions store. These do not, themselves, * fire any rules but provide additional axioms that might enable future rule * firing when real data is added. Used to implement bindSchema processing * in the parent Reasoner. * @return true if the preload was able to load rules as well */ @Override protected boolean preloadDeductions(Graph preloadIn) { Graph d = fdeductions.getGraph(); FBRuleInfGraph preload = (FBRuleInfGraph)preloadIn; // If the rule set is the same we can reuse those as well if (preload.rules == rules) { // Load raw deductions for (Iterator<Triple> i = preload.getDeductionsGraph().find(null, null, null); i.hasNext(); ) { d.add( i.next() ); } // Load backward rules addBRules(preload.getBRules()); // Load forward rules engine.setRuleStore(preload.getForwardRuleStore()); // Add access to raw data return true; } else { return false; } }
/** * Adds a set of precomputed triples to the deductions store. These do not, themselves, * fire any rules but provide additional axioms that might enable future rule * firing when real data is added. Used to implement bindSchema processing * in the parent Reasoner. * @return true if the preload was able to load rules as well */ @Override protected boolean preloadDeductions(Graph preloadIn) { Graph d = fdeductions.getGraph(); FBRuleInfGraph preload = (FBRuleInfGraph)preloadIn; // If the rule set is the same we can reuse those as well if (preload.rules == rules) { // Load raw deductions for (Iterator<Triple> i = preload.getDeductionsGraph().find(null, null, null); i.hasNext(); ) { d.add( i.next() ); } // Load backward rules addBRules(preload.getBRules()); // Load forward rules engine.setRuleStore(preload.getForwardRuleStore()); // Add access to raw data return true; } else { return false; } }