Modifier and Type | Interface and Description |
---|---|
interface |
QueryRewriter |
interface |
QueryRewriterWithCompilation |
Modifier and Type | Interface and Description |
---|---|
interface |
InMemoryKnowledgeBase |
interface |
RulesCompilation |
Modifier and Type | Interface and Description |
---|---|
interface |
Chase
This interface represents a chase (forward chaining) algorithm seen as an
iterative process.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractChase<T1 extends Rule,T2 extends AtomSet> |
class |
AbstractDirectChase<T1 extends Rule,T2 extends AtomSet> |
Modifier and Type | Interface and Description |
---|---|
interface |
ExistentialHomomorphism<T1,T2 extends AtomSet> |
interface |
ExistentialHomomorphismPattern<T1,T2> |
interface |
ExistentialHomomorphismWithCompilation<T1,T2 extends AtomSet> |
interface |
Homomorphism<T1,T2 extends AtomSet> |
interface |
HomomorphismPattern<T1,T2 extends AtomSet> |
interface |
HomomorphismWithCompilation<T1,T2 extends AtomSet> |
interface |
UCQHomomorphism<A extends AtomSet> |
interface |
UCQHomomorphismWithCompilation<A extends AtomSet> |
Modifier and Type | Interface and Description |
---|---|
interface |
KnowledgeBase
A knowledge base is composed of facts, existential rules, negative
constraints and queries.
|
Modifier and Type | Interface and Description |
---|---|
interface |
RewritingOperator |
Modifier and Type | Class and Description |
---|---|
class |
AbstractRewritingOperator |
class |
AggregAllRulesOperator
Rewriting operator ARAM
rewriting engine that rewrite query using
aggregation all rule of most general single piece-unifiers, selecting
unifiers during the aggregation and using a marking system to avoid
redundant rewritings
|
class |
AggregSingleRuleOperator
Rewriting operator SRA
Query rewriting engine that rewrite query using
aggregation by rule of most general single piece-unifiers
|
class |
BasicAggregAllRulesOperator
Rewriting operator ARA
rewriting engine that rewrite query using
aggregation all rule of most general single piece-unifiers
|
class |
PureRewriter |
Modifier and Type | Class and Description |
---|---|
class |
AbstractRulesCompilation |
class |
HierarchicalCompilation |
class |
IDCompilation |
class |
NoCompilation |
Modifier and Type | Class and Description |
---|---|
class |
BasicChase<T extends AtomSet>
This chase (forward-chaining) algorithm iterates over all rules at each step.
|
class |
BreadthFirstChase
This chase (forward-chaining) algorithm iterates over all rules at each step.
|
class |
ChaseWithGRD<T extends AtomSet>
This chase (forward-chaining) algorithm use GRD to define the Rules that will
be triggered in the next step.
|
class |
ChaseWithGRDAndUnfiers<T extends AtomSet> |
class |
SccChase<T extends AtomSet>
This Chase apply rules following the layers of the Strongly Connected
Components Graph (SCCG) of the Graph Of Rule Dependencies (GRD).
|
Modifier and Type | Class and Description |
---|---|
class |
RestrictedChaseHaltingCondition
This HaltingCondition will produce new data according to a rule, a
substitution s and specified data if s cannot be extended to a homomorphism
from B ∪ H to F where B is the rule body, H the rule HEAD and F the data.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractHomomorphism<T1,T2 extends AtomSet> |
class |
AbstractHomomorphismWithCompilation<T1,T2 extends AtomSet> |
class |
AtomicQueryHomomorphism
An homomorphism for Atomic query without multiple occurences of a variables.
|
class |
AtomicQueryHomomorphismWithNegatedParts
An homomorphism for Atomic query without constant or multiple occurences of a variables.
|
class |
BacktrackHomomorphism
This Backtrack is inspired by the Baget Jean-François Thesis (Chapter 5)
see also "Backtracking Through Biconnected Components of a Constraint Graph"
(Jean-François Baget, Yannic S.
|
class |
BacktrackHomomorphismPattern |
class |
BacktrackHomomorphismWithNegatedParts
This Backtrack is inspired by the Baget Jean-François Thesis (Chapter 5)
see also "Backtracking Through Biconnected Components of a Constraint Graph"
(Jean-François Baget, Yannic S.
|
class |
DefaultUCQHomomorphism |
class |
DefaultUCQHomomorphismWithCompilation |
class |
FullyInstantiatedQueryHomomorphism |
class |
PureHomomorphism
A simple implementation of an algorithm to find if there exist an
homomorphism between two facts Backtrack algorithm that look for an
association of atoms that correspond to a substitution of terms efficient for
simple facts of small size
|
class |
RecursiveBacktrackHomomorphism
Deprecated.
|
class |
SmartHomomorphism |
Modifier and Type | Interface and Description |
---|---|
interface |
BackJumping
The BackJumping interface provides to allow jump over some variables when a
backtrack is performed.
|
Modifier and Type | Class and Description |
---|---|
class |
GraphBaseBackJumping
The GraphBaseBackJumping allows jump (in case of failure) to the last
neighbor node from the query graph (in the search order of the variable)
Reference: Dechter, R. |
class |
NoBackJumping |
Modifier and Type | Interface and Description |
---|---|
interface |
Bootstrapper
Bootstrapper is used to select a set of terms over which the backtrack homomorphism algorithm will iterate for a specific
variable when the set of candidates for this variable is not already restricted by forward checking.
|
Modifier and Type | Class and Description |
---|---|
class |
AllDomainBootstrapper
This implementation uses all domain (all terms from data) to bootstrap.
|
class |
DefaultBootstrapper
This implementation uses an randomly selected atom containing the variable v to
restrict the set of candidates.
|
class |
StarBootstrapper
This implementation uses the star query around the variable v to restrict the set of candidates.
|
class |
StatBootstrapper
This implementation uses the atom containing v with the smallest probability of being true to
restrict the set of candidates.
|
Modifier and Type | Interface and Description |
---|---|
interface |
ForwardChecking
The ForwardChecking interface provides a way to restrict the domain of some
next variables based of the affectation of the current one.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractNFC |
class |
NFC0
NFC0 is a ForwardChecking implementation for HyperGraph with delayed local
propagation.
|
class |
NFC2
NFC2 is a ForwardChecking implementation for HyperGraph with immediate local
propagation in one step.
|
class |
NFC2WithLimit
NFC2 is a ForwardChecking implementation for HyperGraph with immediate local
propagation in one step.
|
class |
NoForwardChecking |
class |
SimpleFC
SimpleFC is a simple ForwardChecking implementation for HyperGraph with
immediate local checking in one step.
|
Modifier and Type | Interface and Description |
---|---|
interface |
PatternScheduler |
interface |
Scheduler
The Scheduler interface provides a way to manage the backtracking order.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultScheduler
Compute an order over variables from h.
|
class |
FixedOrderScheduler |
Modifier and Type | Class and Description |
---|---|
class |
HomomorphismIteratorChecker |
Modifier and Type | Class and Description |
---|---|
class |
DefaultKnowledgeBase |
Modifier and Type | Class and Description |
---|---|
class |
SqlHomomorphism |
class |
SqlUCQHomomorphism
SQL homomorphism for Union Conjunctive Queries
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractProfilable |
Copyright © 2014–2018 GraphIK (INRIA - LIRMM). All rights reserved.