IRRE is an Inductive Reasoning Rule Engine, which performs forward-chaining of entailment rules on top of RDF graphs. Its reasoning strategy is total materialization.

The implementation of IRRE relies on a compile stage, during which the entailment rules are compiled into chunks of Java code that are post-processed automatically and merged together to generate the main entry point for the inferencer.

The reasoning and query evaluation are performed in-memory; the full content of the repository is loaded and maintained in a proprietary representation in the main memory, which allows for efficient retrieval and query answering.

IRRE can be configured with a set of entilment rules, which determine the supported semantic. Each rule has a set of premises, which conjunctively define the body of the rule. The premises are RDF statements, which can contain any number of variables. The head of the rule is one or more consequences, each of which is again an RDF statement. The consequences can contain free variables, i.e. such which are not used in the body of the rule. In such cases, those are bound to a newly created anonymous nodes. The multiple consequences in the head are allowed.

At present IRRE is not provided as a separate component. The OWLIM semantic repository is bundled with a preconfigured version of IRRE, which supports RDF(S) and OWL DLP.