rdf - Need an algorithm to compute all possible inferences

Question

I am making a static RDFS-Plus inference engine.

I have written a function that will make the appropriate inferences for all of the constructs included. For example if this function is passed the triple C1 rdf:subClassOf C2, then for all X's in triples of the form X rdf:type C1, a new triple of the form X rdf:type C2 will be produced.

Where I am struggling is in figuring out how to make all possible inferences. The struggle comes from the fact that I must make inferences based off inferences.

Here is where I am at in my program:

1. Parse a `.ttl` file and assert all the triples into a data store.
2. Separate out the triples that represent RDFS-Plus constructs into a list.
3. ??? (make all possible inferences somehow)

The only idea that I am sure would work is to generate all the permutations of the RDFS-Plus list (giving a list of lists), and then for each inner list map my infer function. This is a useless solution though as it is so inefficient.

Is my infer function enough to be able to produce all possible inferences or did I go down a barren path? Do I have enough in place to make a rule dependency graph? I do not know how to calculate if a modelling construct may depend on another construct. For example could owl:FunctionalProperty depend on rdfs:subClassOf or is this just gibberish?

I would really appreciate some insight.

Answer 1

等待大神答复