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 FRuleEngineIRule engines implement the internals of forward rule inference graphs and the forward part of hybrid graphs. LPAgendaEntryThe signature of classes that can go on the LPEngines processing agenda. LPInterpreterContextThe context in which an LPInterpreter instance is running. LPInterpreterStateMarker 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. RETENodeInterface for all nodes in the network. RETESinkNodeInterface for all inner nodes in the RETE network. RETESourceNodeInterface for all non-terminal nodes in the network.
Class Summary Class Description BBRuleContextImplementation of RuleContext for use in the backward chaining interpreter. BFRuleContextAn implementation of the generic RuleContext interface used by the basic forward (BF) rule engine. BindingStackProvides a trail of possible variable bindings for a forward rule. BindingVectorAn implementation of a binding environment that maintains a single array of bound values for the variables in a rule. BindingVectorMultiSetA multi set of BindingVector's divided in buckets matching an unique combination of values at given indices managed by RETEQueue ChoicePointFrameRepresents a single frame in the LP interpreter's choice point stack, represents the OR part of the search tree. ConsumerChoicePointFrameFrame in the LPInterpreter's control stack used to represent matching to the results of a tabled predicate. EnvironmentFrameRepresents a single frame in the LP interpreter's environment stack. EnvironmentFrameWithDerivationExtension of the normal AND-stack environment frame to support incremental derivation logging. FrameObjectBase class for stack frame objects. FRuleEngineThe processing engine for forward production rules. FRuleEngine.RuleStoreStructure used to wrap up processed rule indexes. FRuleEngineIFactoryFactory class for creating
GeneratorA generator represents a set of memoized results for a single tabled subgoal. GenericChoiceFrameCore properties of choice frames used use to represent the OR state of the backtracking search. GenericTripleMatchFrameFrame 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. LPBindingEnvironmentImplementation of the binding environment interface for use in LP backward rules. LPBRuleEngineLP version of the core backward chaining engine. LPInterpreterBytecode interpreter engine for the LP version of the backward chaining rule system. LPRuleStoreHolds the set of backward rules used by an LPEngine. LPTopGoalIteratorWraps up the results an LP rule engine instance into a conventional iterator. MutableTriplePatternVariant of the normal TriplePattern object which can be updated in place to avoid store turn over. OWLExptRuleTranslationHookExperimental change to OWL translation hook that doesn't handle translation of restrictions to functors. OWLRuleTranslationHookA rule preprocessor that scans the data looking for intersection definitions and augments the rule base by translations of the intersection statement. RDFSCMPPreprocessHookA rule preprocessor that scans all supplied data looking for instances of container membership properties and adds those to the deductions set. RETEClauseFilterChecks a triple against the grounded matches and intra-triple matches for a single rule clause. RETEConflictSetManages a set of ready-to-fire rules. RETEEngineA RETE version of the forward rule system engine. RETEEngine.RuleStoreStructure used to wrap up processed rule indexes. RETEQueueRepresents one input left of a join node. RETERuleContextAn implementation of the generic RuleContext for use in the RETE implementation. RETETerminalThe final node in a RETE graph. RuleClauseCodeObject used to hold the compiled bytecode stream for a single rule clause. RuleStoreIndexes a collection of rule. SafeGraphA 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. SafeTripleIteratorWrapper around triple searches using in the back chainer to attempt a restart in the case of a failure such as cross-transaction query. StateFlagA set of constants used to record state information in the backchaining rule interpreter. TempNodeCacheIn 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.NodePairInner class used to hold and hash a node pair. TopLevelTripleMatchFrame TripleMatchFrameFrame on the choice point stack used to represent the state of a direct graph triple match. WrappedReasonerFactoryWrappedReasonerFactory - a wrapper round ReasonerFactories that accepts a Resource configuring initial rules, schemas, etc.
Exception Summary Exception Description LPRuleSyntaxExceptionException used to indicate syntactic errors the LP version of the backward chaining rule engine.