Hello Dave,
thnaks for the quick reply. I'm aware of the different RDFS entailment
implementations, but I was more wondering how to check the entailment
between 2 graphs. My question was probably not specific enough, so
consider for instance 2 JENA models
Model m1
Model m2
What would be the way to go to check if for instance m1 is RDFS entailed
by m2? I know I can create an InfModel by assigning a reasoner, but I'm
more looking for something like
m1.isEntailedBy(m2):boolean
or
m2.entails(m1):boolean
Sorry if my first question wasn't clear enough.
Kind regards,
Lorenz
On 24/03/15 08:00, Lorenz Bühmann wrote:
Hello,
I'm using latest Apache JENA 2.13.0 and I'm wondering if it contains
algorithms for RDFS or even pD* entailment of graphs (aka. models)? I
couldn't find anything in the documentation
(https://jena.apache.org/documentation/inference/), that's why I'm
asking before I start to implement it by myself.
As it says in that documentation there is the RDFS rule reasoner which
implements different subsets of the RDFS entailment rules but, as it
says there, even the FULL mode omits the bNode datatype entailments.
If you need absolute and guaranteed completeness then indeed building
your own would be the way to go.
Dave
--
Lorenz Bühmann
AKSW group, University of Leipzig
Group: http://aksw.org - semantic web research center
