Package  Description 

org.apache.jena.graph.compose 
This package defines simple composite graphs  union, intersection,
difference, and updatetracking.

org.apache.jena.graph.impl 
This package provides basic implementations of Graph interfaces
such as EventManager and Capabilities.

org.apache.jena.mem 
Various memorybased implementations of interfaces,
specifically GraphMem for memorybased Graphs.

org.apache.jena.reasoner 
The Jena2 reasoner subsystem is designed to allow a range of inference
engines to be plugged into Jena.

org.apache.jena.reasoner.rulesys 
Provides a selection of simple rule engines for Jena inference models.

org.apache.jena.reasoner.transitiveReasoner 
This package contains a reasoner which supports transitivereflexive closure
of subPropertyOf and subClassOf relations.

Modifier and Type  Class and Description 

class 
CompositionBase
Base class for graphs that are composed of multiple subgraphs.

class 
Delta
Graph operation for wrapping a base graph and leaving it unchanged while
recording all the attempted updates for later access.

class 
Difference
Class representing the dynamic set difference L  R of two graphs.

class 
DisjointUnion
DisjointUnion  a version of Union that assumes the graphs are disjoint, and
hence that
find need not do duplicateremoval. 
class 
Dyadic
Base class for the twooperand composition operations; has two graphs L and R

class 
Intersection
The dynamic intersection of two graphs L and R.

class 
MultiUnion
A graph implementation that presents the union of zero or more subgraphs,
one of which is distinguished as the updateable graph.

class 
Polyadic
A base class for composition graphs that are composed from zero or more
subgraphs (thus providing a basis for polyadic composition operators).

class 
Union
A class representing the dynamic union of two graphs.

Modifier and Type  Class and Description 

class 
CollectionGraph
A simple graph implementation that wraps a collection of triples.

Modifier and Type  Class and Description 

class 
GraphMem 
class 
GraphMemBase
GraphMemBase  a common base class for GraphMem and SmallGraphMem.

Modifier and Type  Class and Description 

class 
BaseInfGraph
A base level implementation of the InfGraph interface.

Modifier and Type  Class and Description 

class 
BasicForwardRuleInfGraph
An inference graph interface that runs a set of forward chaining
rules to conclusion on each added triple and stores the entire
result set.

class 
FBRuleInfGraph
An inference graph that uses a mixture of forward and backward
chaining rules.

class 
LPBackwardRuleInfGraph
Inference graph for accessing the LP version of the backward chaining
rule engine.

class 
RDFSRuleInfGraph
Customization of the generic rule inference graph for RDFS inference.

class 
RETERuleInfGraph
RETE implementation of the forward rule infernce graph.

Modifier and Type  Class and Description 

class 
TransitiveInfGraph
Implementation of InfGraph used by the TransitiveReasoner.

Licenced under the Apache License, Version 2.0