Given a rule dependency graph (RDG), a high-level rule dependency graph (HLRDG) is a directed acyclic graph G = (V, E) such that
Given a set of rules R, a rule dependency graph (RDG) is a directed graph G = (V, E) such that
A generator for a high-level rule dependency graph for a given rule dependency graph.
The ForwardRuleReasonerRDFS can be configured to work at three different compliance levels:
An enumeration of reasoning profiles, which are usually different sets of rules with different complexity.
A generator for a so-called dependency graph based on a given set of rules.
The type of entailment of a rule, i.e.
Predefined sets of rules.
A framework for applying batches of minimization rules to dependency graphs, possibly to fixed point.