Package org.apache.jena.reasoner.rulesys.impl
Internal implementation objects used by the rule system interpreters and compilers. Note that the class in here are not intended for general use. In particular, they are primarily stucts rather than correctly encasulated objects (i.e. they access each other's fields directly in some cases, instead of indirectly through accessor methods).
-
Interface Summary Interface Description FRuleEngineI Rule engines implement the internals of forward rule inference graphs and the forward part of hybrid graphs.LPAgendaEntry The signature of classes that can go on the LPEngines processing agenda.LPInterpreterContext The context in which an LPInterpreter instance is running.LPInterpreterState Marker interface for classes than can be used to initialize the state of an LP interpreter - either an initial context (which in turn is either a top level iterator or an generator being run for the first time), or a previous saved context (i.e.RETENode Interface for all nodes in the network.RETESinkNode Interface for all inner nodes in the RETE network.RETESourceNode Interface for all non-terminal nodes in the network. -
Class Summary Class Description BBRuleContext Implementation of RuleContext for use in the backward chaining interpreter.BFRuleContext An implementation of the generic RuleContext interface used by the basic forward (BF) rule engine.BindingStack Provides a trail of possible variable bindings for a forward rule.BindingVector An implementation of a binding environment that maintains a single array of bound values for the variables in a rule.BindingVectorMultiSet A multi set of BindingVector's divided in buckets matching an unique combination of values at given indices managed by RETEQueueChoicePointFrame Represents a single frame in the LP interpreter's choice point stack, represents the OR part of the search tree.ConsumerChoicePointFrame Frame in the LPInterpreter's control stack used to represent matching to the results of a tabled predicate.EnvironmentFrame Represents a single frame in the LP interpreter's environment stack.EnvironmentFrameWithDerivation Extension of the normal AND-stack environment frame to support incremental derivation logging.FrameObject Base class for stack frame objects.FRuleEngine The processing engine for forward production rules.FRuleEngine.RuleStore Structure used to wrap up processed rule indexes.FRuleEngineIFactory Factory class for creatingFRuleEngineI
.Generator A generator represents a set of memoized results for a single tabled subgoal.GenericChoiceFrame Core properties of choice frames used use to represent the OR state of the backtracking search.GenericTripleMatchFrame Frame on the choice point stack used to represent the state of some form of triple match - this is either a direct graph query or a query to a cached set of results.LPBindingEnvironment Implementation of the binding environment interface for use in LP backward rules.LPBRuleEngine LP version of the core backward chaining engine.LPInterpreter Bytecode interpreter engine for the LP version of the backward chaining rule system.LPRuleStore Holds the set of backward rules used by an LPEngine.LPTopGoalIterator Wraps up the results an LP rule engine instance into a conventional iterator.MutableTriplePattern Variant of the normal TriplePattern object which can be updated in place to avoid store turn over.OWLExptRuleTranslationHook Experimental change to OWL translation hook that doesn't handle translation of restrictions to functors.OWLRuleTranslationHook A rule preprocessor that scans the data looking for intersection definitions and augments the rule base by translations of the intersection statement.RDFSCMPPreprocessHook A rule preprocessor that scans all supplied data looking for instances of container membership properties and adds those to the deductions set.RETEClauseFilter Checks a triple against the grounded matches and intra-triple matches for a single rule clause.RETEConflictSet Manages a set of ready-to-fire rules.RETEEngine A RETE version of the forward rule system engine.RETEEngine.RuleStore Structure used to wrap up processed rule indexes.RETEQueue Represents one input left of a join node.RETERuleContext An implementation of the generic RuleContext for use in the RETE implementation.RETETerminal The final node in a RETE graph.RuleClauseCode Object used to hold the compiled bytecode stream for a single rule clause.RuleStore Indexes a collection of rule.SafeGraph A SafeGraph wraps a graph which might contain generalized RDF triples and hides them from API queries so that consumers of it are safe (but can use getRawGraph() to get back the unsafe graph.SafeTripleIterator Wrapper around triple searches using in the back chainer to attempt a restart in the case of a failure such as cross-transaction query.StateFlag A set of constants used to record state information in the backchaining rule interpreter.TempNodeCache In some rules we need to be able to create temporary property values which are inferred from ontology constraints but not present in the ground data.TempNodeCache.NodePair Inner class used to hold and hash a node pair.TopLevelTripleMatchFrame TripleMatchFrame Frame on the choice point stack used to represent the state of a direct graph triple match.WrappedReasonerFactory WrappedReasonerFactory - a wrapper round ReasonerFactories that accepts a Resource configuring initial rules, schemas, etc. -
Exception Summary Exception Description LPRuleSyntaxException Exception used to indicate syntactic errors the LP version of the backward chaining rule engine.