All Classes and Interfaces
Class
Description
abstract builtin with first argument is the grouping argument
abstract cache unit
coordinates calls to connectors and performs constraint reasoning for connectors
provides all functionality for handling a symbol table in main memory
testores an ix file out of an iix file
This rewriter eliniates redundant bodies in rules
Interface for aggregations.
Creates one time tick at the given time.
action built-in to write tuples to extensional database
An avl tree
Adds the OO axioms to the idb if needed
backs up an edb
A relation is a set of tuples, i.e. a container for facts.
This rewriter joins comparisons to between comparisons
This example code demonstrates how to perform simple
blinking LED logic of a GPIO pin on the Raspberry Pi
using the Pi4J library.
This example code demonstrates how to perform simple
blinking LED logic of a GPIO pin on the Raspberry Pi
using the Pi4J library.
Manages space in a file.
reorders rules and adorns rules that they are top-down evaluable
Selects rules bottom up.
A blob ist a relation consisting of binary tuples
[id,blob] where id is a unique long and the blob is a byte array
[id,blob] where id is a unique long and the blob is a byte array
Manages file space for data like bplus nodes, indice values, symbols etc.
Represents an internal node within the B+ tree.
Describes an interface to the keys of a bplus node
variable number, variable sized byte arrays as keys of a bplus node
A leaf is the node in a B+ tree containing records.
This type of bplus leaf contains a cache for the index values
A leaf is the node in a B+ tree containing records.
This class represents a node within a B+ tree, stored on disk.
Represents a search result in a bplus tree.
Represents a search result in a bplus tree.
This class implements a B+ Tree on disk.
This file handles the writing of nodes to files and the reading of nodes back.
Stores intermediate results: results between two rule bodies or results of
rule evaluations
For recursive rules or recursion cycles results must be buffered.
For recursive rules or recursion cycles results must be buffered.
Interface for all built-ins Built-ins may be seen as relations which are computed
by an algorithm.
by an algorithm.
Manages the available set of built-ins
receives the results of a built-in
different built-in types
List for bytes based on arrays
A
ByteQueue is a queue of byte values.Resizable-array implementation of the List interface.
Compare byte sequences
Represents the result relation of a join operation
Used for caching join operations
change the data type of one property in a raw file
An implementation of this interface checks whether an error exists.
This class checks whether an error exists.
This class checks whether an error exists.
An implementation of this interface checks whether an error exists.
This class checks whether an error exists.
This class checks whether an error exists.
Collating Aggregating composer builtin.
BuiltinReceiver so send to several receivers at same time
This rewriter deals with size comparisons.
Aggregating composer builtin.
Aggregating composer builtin.
A lock spanning a group of backing locks.
Represents a predicate or a function.
Provides methods for compressing and decompressing byte arrays
Builtin which takes a variable number of strings and concatenates them.
Provides configurations for the reasoning kernel
How are relations stored:
- in main memory only (RAM)
- persistent on disc (PERSISTENT)
- mixed on disc and in main memory (MIXED)
- at a given host
- in main memory only (RAM)
- persistent on disc (PERSISTENT)
- mixed on disc and in main memory (MIXED)
- at a given host
Interface for connector built-in.
action built-in to throw an exception for a constraint violation
Provides producer consumer functionality.
Here we have separate threads for consumers.
Here we have separate threads for consumers.
Checks whether similar words are contained in String
A core stores all relevant data for the inference engine
the extensional database (edb), intensional database (idb),
symbol table, built-ins, rewriters, configuration, transactions,
external datatypes, query materialization, query management
the extensional database (edb), intensional database (idb),
symbol table, built-ins, rewriters, configuration, transactions,
external datatypes, query materialization, query management
count builtin with first argument is the grouping argument
Counts events in time
count builtin with first argument is the grouping argument
Create a new polygon from an existing polygon and an existing point.
Create a new polygon from an existing polygon and an existing point.
Create a new point.
Create a new polygon from an existing polygon and an existing point.
Create a new polygon from an existing polygon and an existing point.
Create a new polygon from an existing polygon and an existing point.
Create a new polygon from three points.
This relations represents a cross product of other base relations
test for cross product relation
retrieve currency information
an element of a data file.
Manages file space for data like indice values, symbols etc.
Eliminates rule bodies which are marked by "/".
High level interface for a whole deductive database.
Default
different log levels and user-defined targets.
ReasoningMonitor implementation which supports different log levels and user-defined targets.
Default
different log levels and user-defined targets.
ReasoningMonitor implementation which supports different log levels and user-defined targets.
exports member|2 und value|3 and imports them again.
Node for dense graphs containing sets of ordinary nodes
arguments are mutually different
interface for a direct filter builtin.
Marker interface for built-ins with dynamic access to services.
This rewriter deletes semi joins in rules
This rewriter substitutes member(_,Class) literals by elementOf literals
This rewriter eliniates redundant bodies in rules
An empty store, i.E. all incoming tuples are thrown away
Takes a package of input tuples and internalizes terms in it.
a cap for a dead end in the data flow graph
enumerate numbers
This rewriter deletes equal predicates in rules
arguments are all equal
This SIPS does not change the sequence of rule bodies.
Receiver wrapper for callbacks for the results of sensor triggered reasoning results
A receiver for results caused by events
translates csv files to raw files header file looks as following <property name>:<range of property>
Ranges can be String,Number,Boolean
If Range is specified as None, the property is skipped
fields which are key fields are marked with a *
Range can be skipped if range is a string
translates csv files to raw files
header file looks as following
<property name>:<range of property>
Ranges can be String,Number,Boolean
If Range is specified as None, the property is skipped
fields which are key fields are marked with a *
Range can be skipped if range is a string
add some facts query for them
An example for a filter builtin "isString"
An example for a functional builtin "increment"
An example for a relational builtin "sqrt1"
An example for an aggregation "mean"
A simple evaluator for logic programs input files and query are command-line arguments
An uri as extended data type
An uri as extended data type
exports specified predicates of edb
exports specified predicates of edb
Extensional database is a container for all facts.
Additional data types may be defined and added.
manages a list of external data types and the sequence they are applied
file merge sort of text lines
file merge sort of binary tuples of text lines
sorts large files of tuples in binary format (arrays of longs )
file merge sort of binary tuples of text lines
is always true
A filename for a relation may look like: <filepath>/<name>_<arity>[(<number>)].suffix
utils for files
This rewriter adds for each value literal in query a set of rules to create null values if there is no value for a property
provides filter for predicates and their properties for exporting and importing OO-logic facts Predicates must be given in the form predicate|arity
Simulates a database table with 1 column.
Simulates a database table with 1 column Filters input out if it is not in table
Interface for filter built-ins.
This rewriter translates rules into rules which apply to sub relations.
flags used for flagging infos in codes
FOIL rule inductions
This rewriter eliniates redundant bodies in rules
Handles file pieces with dynamic length
Handles file pices with fixed length
Manages free slots of file pieces
Manages space in file
folds rules.
object for a functional term
Interface for functional built-ins.
A functional built-in provides one functional result
for every input or checks a functional computation
E.g. plus(1,2,%3FX) returns 3 for X
plus(1,2,5) evaluates to false.
A functional built-in provides one functional result
for every input or checks a functional computation
E.g. plus(1,2,%3FX) returns 3 for X
plus(1,2,5) evaluates to false.
Searches for rule body sequences like p(..,?
This datatype represents a geo point.
Interface for geo datatypes.
Full text index for a symbol table.
Test for the geo index built-ins.
This datatype represents a geo line string.
This datatype represents a geo point.
This datatype represents a geo polygon.
This datatype represents a geo point.
Built-in for accessing a symbol table geo index.
data structure for a graph
This class provides an empty implementation of
GraphQLGrammarListener,
which can be extended to create a listener which only needs to handle a subset
of the available methods.This interface defines a complete listener for a parse tree produced by
GraphQLGrammarParser.Parser for rules.
Hashindex for tuples
A huge memory mapped file larger than Integer.Max
An example for a functional built-in "increment"
An example for a functional built-in "increment"
loads files (facts or rules) into edb and idb
Secondary index for a relation of tuples
creates an index on an argument position of a certain predicate in edb
retrieve stock price given the ISIN from ing api at smarthouse
List for ints based on arrays
List for ints based on arrays
Container for rules.
Marker interface for internal built-ins
Parser for rules.
Parser for rules.
a small command line interpreter loads files during launc.
This flag indicates the reasoner, that the evaluation must be interrupted
Listener for interrupts.
Full text index for edb.
Full text index for edb.
This is a simple builtin that is executed to check if the reasoner is still alive.
Removes isa-literals in a rule if there is an access to at least one unique property
is it a calendar
is it a float
is set equal to another set
is it a double
is it a json id
is it a json top identifier
is it a calendar
Determines whether second argument is NOT functional dependent on first argument.
Determines whether second argument is NOT functional dependent on first argument.
is it a number builtin
is code a reasoning code
is it a double
is it a a string
is set a subset of another set
High level interface for a whole java deductive database.
Abstract class for java objects for the Java API.
Other java objects to be stored in java deductive database
must be extensions of this one.
Other java objects to be stored in java deductive database
must be extensions of this one.
provides result info from join operations
Caching mechanism for querying jsons
compares two jsons
Interface for Json objects.
Translates a json id to a string
Loader for json files
Loader for json files
Loader for json files
Loader for json files
Problem minimizer systematically reduces the set of facts in order to find a minimal
set of facts which still shows the problem
.
set of facts which still shows the problem
.
Represents a result for a retrieval for jsons
Stream based Json loader.
Stream based Json loader.
Creates and replays json log files.
Methods for handling Jsons
factory for creating keys
factory for creating leafs
An algorithm for measuring the difference between two character sequences.
Manages a set of tuple lists.
Loading lists of terms separated by eols in a text file
The predicate it is stored in is given by the file name
The text file must have the extension "txt"
The predicate it is stored in is given by the file name
The text file must have the extension "txt"
object to represent a literal
loads files (facts or rules) into edb and idb
abstract class for loading facts
Handles loading facts from different sources like json, csv, nquads.
Utility methods to group-lock and group-unlock collections of locks, including roll back support to
ensure that either all locks are acquired or no locks are acquired.
Utility methods to group-lock and group-unlock collections of locks, including roll back support to
ensure that either all locks are acquired or no locks are acquired.
List for longs based on arrays
Util class for encoding long strings,
A long string gets an additional prefix
consisting of a hash code
A long string gets an additional prefix
consisting of a hash code
Input stream for LZ4 compression.
Output stream for LZ4 compression
reorders rules and adorns rules that they are top-down evaluable
Test for
MainMemoryRelation and attached index structures.A sub relation of a persistent relation defined by a filter.
Describes a mapping of reasoning relation arguments
map[i] maps argument position i to another one
Stores results during materialization in edb
Single events are buffered until reasoning is finished.
Single events are buffered until reasoning is finished.
Handles the names of materialized queries
max builtin with first argument is the grouping argument
mean builtin with first argument is the grouping argument
An example for a built-in (aggregation) which computes the mean value out of the input values
Monitors the memory consumption during reasoning.
count builtin with first argument is the grouping argument
Represents a mixed relation, i.e. tuples are stored persistent and in main memory.
Test for
MainMemoryRelation and attached index structures.This rewriter adds a module to the rules
retrieve information from another reasoner
a small command line interpreter loads files during launch.
Replacement for Spring MultiValueMap
Creates n grams out of a piece of text
first argument equals to none of the other arguments
transforming nquads (RDF) to raw file
first argument equals to one of the other arguments
This class provides an empty implementation of
OOLogicGrammarListener, which can be extended to create a listener which only needs to handle a subset
of the available methods.This class provides an empty implementation of
OOLogicGrammarListener,
which can be extended to create a listener which only needs to handle a subset
of the available methods.This interface defines a complete listener for a parse tree produced by
OOLogicGrammarParser.Utilities for OO logic syntax and printing
creates an index on an argument position of a certain predicate in edb
options for reasoning
handles a page table for blus files
Parses a new point (WKT syntax).
Utility methods for parsing facts, rules, queries
Utility methods with parser.
partitioning of relations
Generator generates relations parts permutations for parallel reasoning
represents a path in OO-logic
This rewriter adds path rules for path expressions
Pattern for GraphQL outputs
Permutes objects
Test for
MainMemoryRelation and attached index structures.Container for a persistent sorted index
load consumer for adding tuples iterative to an index
PlainLiteral external datatype.
PlainLiteral external datatype.
Retrieves the x coordinate of a point.
Retrieves the y coordinate of a point.
lock for read and write lock for core.
a read lock for edb for locking single predicates
a write lock for the core for locking single predicates, the idb and the
symbol table
lock for read and write lock for edb.
a read lock for edb for locking single predicates
a write lock for the core for locking single predicates, the idb and the
symbol table
Hashindex for tuples
Hashindex for tuples
prints the value
action built-in to write a message to the console
action built-in to write a message to a file
Problem minimizer systematically reduces the set of facts in order to find a minimal
set of facts which still shows the problem
.
set of facts which still shows the problem
.
Stores and executes all processes necessary to answer to a query.
Represents a process in the operator net.
Provides producer functionality
Provides producer consumer functionality
A progress bar
This rewriter propagates constants top-down in the rules and
then removes rules which cannot contribute to the answer or instantiates variables with constants in rules
then removes rules which cannot contribute to the answer or instantiates variables with constants in rules
This rewriter propagates constraints like less,greater top-down in the rules.
describes a property of a graph ql output pattern
retrieve information from another reasoner
Query handler manages queries.
registers a query for cep for ide
This rewriter creates a rule and a simplified query out of a complex query.
runner for dsl ide for a query
A ramdom acess file paged.
A ramdom acess file paged.
random access file abstraction
creates an integer number randomly
creates a period randomly
creates an integer number randomly
creates an integer number randomly
Simple builtin to switch a gpio pin on raspberry pi briefly on
Simple builtin to switch a gpio pin on raspberry pi briefly on
Loader for RDF supporting different formats
Extends the JDK
ReadWriteLock, providing an update lock in addition to the read lock and the write
lock.Extends the JDK
ReadWriteLock, providing an update lock in addition to the read lock and the write
lock.a reasoner performs the reasoning process
Reasoner.
retrieve information from another reasoner
Threaded reasoner.
Threaded reasoner
Performs parallel reasoning
Performs parallel reasoning
Monitoring the reasoning process for reasoning actions and memory consumptions
Performs parallel reasoning
As an extension of the symbol table it provides methods for matching and substituting terms
Wrapper around a reasoning symbol table which does not internalize terms
Provides all functionality for handling a symbol table in main memory for reasoning.
Performs parallel reasoning
A receiver collects tuples ad intermediate results during reasoning.
Test for re-creating the text index on startup.
Test for re-creating the text index on startup.
An implementation of
ReadWriteUpdateLock, extending the functionality of the JDK
ReentrantReadWriteLock with an update lock in addition to the read and write lock, supporting upgrade
from read-only operation to writing status, and downgrade again.An implementation of
ReadWriteUpdateLock, extending the functionality of the JDK
ReentrantReadWriteLock with an update lock in addition to the read and write lock, supporting upgrade
from read-only operation to writing status, and downgrade again.Built-in for regular expressions defined in java.util.regex.Pattern
Built-in for regular expressions defined in java.util.regex.Pattern
A relation is a container for a set of tuples with same arity.
Tuples are tuples of longs, which are links into the symbol table.
Tuples are tuples of longs, which are links into the symbol table.
Adapter to
BaseRelation.Interface for relational built-ins.
A relational built-in gets one input tuple
and may produce one or more output tuples.
A relational built-in gets one input tuple
and may produce one or more output tuples.
Controls the creation of relations of tuples inside the extensional database
listens for changes in a relation
a rewriter which removes double literals in rule bodies
repairs an extensional database by
1. deleting corrupt indices
2. restoring damaged predicates from a backup and
3. replaying log files into symbol table and into predicate files.
1. deleting corrupt indices
2. restoring damaged predicates from a backup and
3. replaying log files into symbol table and into predicate files.
exports specified predicates of edb
restores a backup
testores an ix file out of an iix file
Buffer for results of queries.
Buffer for results of queries.
enumerator for reasoning results
enumerator for reasoning results
container which collects reasoning results
action built-in to remove tuples from extensional database
interface for a rewriter for rules.
A rewriter changes the set of rules for e.g. optimization
A rewriter changes the set of rules for e.g. optimization
manages a list of rule rewriters and the sequence they are applied to the intensional database
This rewriter ....
object to represent a rule.
Creates and handles rule body permutations
Rule induction for OO-Logic
Parser for rules.
exports specified predicates of edb
Schema and hiearchy information
selects a set of input values
Enumerator which allows to select matching tuples for the current element.
select one elements of the input
Base class for all Semreasoner-related exceptions.
Action built-in to send a mail
Action built-in to send a mail
A sensor builtin feeds events asynchroniously into the reasoner.
A sensor builtin feeds events asynchroniously into the reasoner.
print out a relation
Adapts similarity built-ins to cover max positives and min negatives
Read lock for core
Write lock for core
Simple data file for symbol table
Sideways information passing strategy.
This rewriter changes rules and queries such that facts which should be deleted are excluded from reasoning
E.g. given the rule p(?
E.g. given the rule p(?
methods for a secondary sorted index for tuples
additional methods for sorted indices
Splits a rule into two rules if the same join sequence occurs two times.
first argument starts with one of the other arguments
Monitor to collect data about the evaluation to optimize during rule compiling and rule execution
The Class StockPriceBuiltin implements the FunctionalBuiltin interface.
Stores results during materialization in edb
Single events are buffered until reasoning is finished.
Single events are buffered until reasoning is finished.
This extension of the deductive database enables
stream reasoning.
stream reasoning.
stress test: 2 threads adding data, 2 threads deleting data, 4 threads querying
You can play a bit with partitioning
You can play a bit with partitioning
Resizable-array implementation of the List interface.
Translates a json id to a string
sum builtin with first argument is the grouping argument
Aggregating sum() builtin.
Aggregating sum() builtin.
Store for a buffered incremental relation.
Store for incremental relation.
Store for a swappable relation.
A cache for symbols
It consists of n units which may be released by cache manager.
It consists of n units which may be released by cache manager.
hash index assigning codes to strings
Provides basic functionality for handling symbols, i.e. constants and functions.
Implements a persistent symbol table based on b+ trees
iterator for symbol tables.
Iterator for symbol tables.
provides all functionality for handling a symbol table in main memory
Stores intermediate results: results between two rule bodies or results of
rule evaluations
For recursive rules or recursion cycles results must be buffered.
For recursive rules or recursion cycles results must be buffered.
separate syntax checker for facts and rules
separate syntax checker for facts and rules
This class provides some constants important for system configuration.
Monitor to collect data about the evaluation to optimize during rule compiling and rule execution
This monitor combines several monitors and calls those monitors
a separate parser for terms only
Utils used to produce the correct expected time string.
Full text index for a symbol table.
Built-in for accessing a symbol table text index.
Built-in for accessing a symbol table text index.
Test for the text search built-in.
Creates ticks in time
Used for stream-based reasoning to trigger an event.
Used for stream-based reasoning to trigger an event.
action built-in to write a csv file
action built-in to write a json file with flat jsons
A token, generated by Tokenizer
a stream based tokenizer for the sem.reasoner syntax
the different types
propagates intermediate results top down
reorders rules and adorns rules that they are top-down evaluable
Arranges the sequence of the rule bodies in that way that the reasoning has
best performance Is fully based on statistics, i.e. selectivity, weights.
triggers bottom-up evaluation of rule
Represents a transaction
Handles all for transaction logs
Managing transactions
A caching mechanism for querying triples
Represents a result for a query to deductive database
is always true
used to compare tuples
a buffer for tuples
a comparator for tuple buffers
A cache for objects
It consists of n units which may be released by cache manager.
It consists of n units which may be released by cache manager.
iterator for tuples
a tuple file is a flat binary file containing all tuples in a sequence.
A store with an unbuffered input.
Unfolder unfolds rules into other rules.
An uri as extended data type
represents a variable.
Marker interface for built-ins with variable arguments
variance builtin with first argument is the grouping argument
retrieve weather information
retrieve weather information
A
Literal with a weight.creates all possible windows out of text
Assigns the simple data types to their object data types
Loader for xml files