Hello all, I have an understanding problem for general rule reasoner in Jena. First, I see that Jena rule language looks like first-order logic, where I can "imagine" triple predicate when dealing with RDF triples.
Let's consider forward chaining engine. Rules there are of the form A /\ B -> C. This looks like definite clause, if there is no negation. If I have a rule A /\ B -> C /\ D, this one can actually be decomposed for definite clauses : A /\ B -> C and A /\ B -> D. It is known that forward inference procedure for first-order logic definite clause knowledge bases is sound and complete. Can I assume if my forward Jena rules do not have negations, then the Jena forward reasoning in my application is sound and complete? I have a similar question about backward chaining inference in Jena. As rules are like datalog, which inferences are sound and complete. Please correct me if I'm wrong. I would appreciate any references to clarify the case, Thank you, Dew
