org.dllearner.algorithms.qtl.operations.lcs

Class LCS

java.lang.Object

org.dllearner.algorithms.qtl.operations.lcs.LCS

public class LCS
extends Object

Computes the Least Common Subsumer for given rooted RDF graphs.

Author:

Lorenz Buehmann

Constructor Summary

Constructors

Constructor and Description
LCS()

Method Summary

Modifier and Type	Method and Description
org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph	computeLCS(org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph g1, org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph g2)
static boolean	isRDFConnected(org.apache.jena.graph.Node source, org.apache.jena.graph.Node target, Set<org.apache.jena.graph.Triple> triples) Check if there is an RDF-path from source to target.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LCS

public LCS()

Method Detail

computeLCS

public org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph computeLCS(org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph g1,
                                                                                 org.dllearner.algorithms.qtl.operations.lcs.LCS.RootedRDFGraph g2)

isRDFConnected

public static boolean isRDFConnected(org.apache.jena.graph.Node source,
                                     org.apache.jena.graph.Node target,
                                     Set<org.apache.jena.graph.Triple> triples)

Check if there is an RDF-path from source to target.

Parameters:

source - the source node

target - the target node

triples - the set of triples in the graph

Returns:

whether both nodes are RDF-connected by the given set of triples, i.e. if there is an RDF-path from source to target.