Package org.apache.jena.reasoner.rulesys.impl

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).

  • Class
    Implementation of RuleContext for use in the backward chaining interpreter.
    An implementation of the generic RuleContext interface used by the basic forward (BF) rule engine.
    Provides a trail of possible variable bindings for a forward rule.
    An implementation of a binding environment that maintains a single array of bound values for the variables in a rule.
    A multi set of BindingVector's divided in buckets matching an unique combination of values at given indices managed by RETEQueue
    Represents a single frame in the LP interpreter's choice point stack, represents the OR part of the search tree.
    Frame in the LPInterpreter's control stack used to represent matching to the results of a tabled predicate.
    Represents a single frame in the LP interpreter's environment stack.
    Extension of the normal AND-stack environment frame to support incremental derivation logging.
    Base class for stack frame objects.
    The processing engine for forward production rules.
    Structure used to wrap up processed rule indexes.
    Rule engines implement the internals of forward rule inference graphs and the forward part of hybrid graphs.
    Factory class for creating FRuleEngineI.
    A generator represents a set of memoized results for a single tabled subgoal.
    Core properties of choice frames used use to represent the OR state of the backtracking search.
    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.
    The signature of classes that can go on the LPEngines processing agenda.
    Implementation of the binding environment interface for use in LP backward rules.
    LP version of the core backward chaining engine.
    Bytecode interpreter engine for the LP version of the backward chaining rule system.
    The context in which an LPInterpreter instance is running.
    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.
    Holds the set of backward rules used by an LPEngine.
    Exception used to indicate syntactic errors the LP version of the backward chaining rule engine.
    Wraps up the results an LP rule engine instance into a conventional iterator.
    Variant of the normal TriplePattern object which can be updated in place to avoid store turn over.
    Experimental change to OWL translation hook that doesn't handle translation of restrictions to functors.
    A rule preprocessor that scans the data looking for intersection definitions and augments the rule base by translations of the intersection statement.
    A rule preprocessor that scans all supplied data looking for instances of container membership properties and adds those to the deductions set.
    Checks a triple against the grounded matches and intra-triple matches for a single rule clause.
    Manages a set of ready-to-fire rules.
    A RETE version of the forward rule system engine.
    Structure used to wrap up processed rule indexes.
    Interface for all nodes in the network.
    Represents one input left of a join node.
    An implementation of the generic RuleContext for use in the RETE implementation.
    Interface for all inner nodes in the RETE network.
    Interface for all non-terminal nodes in the network.
    The final node in a RETE graph.
    Object used to hold the compiled bytecode stream for a single rule clause.
    Indexes a collection of rule.
    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.
    Wrapper around triple searches using in the back chainer to attempt a restart in the case of a failure such as cross-transaction query.
    A set of constants used to record state information in the backchaining rule interpreter.
    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.
    Inner class used to hold and hash a node pair.
    Frame on the choice point stack used to represent the state of a direct graph triple match.
    WrappedReasonerFactory - a wrapper round ReasonerFactories that accepts a Resource configuring initial rules, schemas, etc.