Package com.semedy.reasoner.reasoning.processes
package com.semedy.reasoner.reasoning.processes
-
ClassDescriptionStores intermediate results: results between two rule bodies or results of rule evaluations
For recursive rules or recursion cycles results must be buffered.Represents the result relation of a join operationUsed for caching join operationsThis relations represents a cross product of other base relationsAn empty store, i.E. all incoming tuples are thrown awayTakes a package of input tuples and internalizes terms in it.a cap for a dead end in the data flow graphReceiver wrapper for callbacks for the results of sensor triggered reasoning resultsprovides result info from join operationsDescribes a mapping of reasoning relation arguments map[i] maps argument position i to another oneStores and executes all processes necessary to answer to a query.Represents a process in the operator net.Wrapper around a reasoning symbol table which does not internalize termscontainer which collects reasoning resultsMonitor to collect data about the evaluation to optimize during rule compiling and rule executionStore for a buffered incremental relation.Store for incremental relation.Store for a swappable relation.Stores intermediate results: results between two rule bodies or results of rule evaluations
For recursive rules or recursion cycles results must be buffered.Monitor to collect data about the evaluation to optimize during rule compiling and rule executionThis monitor combines several monitors and calls those monitorspropagates intermediate results top downtriggers bottom-up evaluation of ruleA store with an unbuffered input.