Package | Description |
---|---|
at.jku.risc.stout.tgau.algo |
This package contains the entry point for the anti-unification algorithm
AntiUnify, the rule based system
AntiUnifySystem, the corresponding
problem definitions TermAUP and
HedgeAUP, and some standard
implementations of a rigidity function
(RigidityFncSubsequence,
RigidityFncSubstring ).
|
at.jku.risc.stout.tgau.data |
This package contains the classes which are needed to build up the term
graphs and alignments.
|
Modifier and Type | Field and Description |
---|---|
TermVar |
TermAUP.generalizationVar |
TermVar |
TermAUP.left |
TermVar |
TermAUP.right |
Modifier and Type | Method and Description |
---|---|
java.util.Map<TermAUP,TermVar> |
AntiUnifySystem.getTrail() |
Constructor and Description |
---|
TermAUP(TermVar generalizationVar,
TermVar left,
TermVar right)
Create an AUP with the given generalization variable and hedges.
|
Constructor and Description |
---|
AntiUnifySystem(java.util.Deque<PrintableX> problemSet,
java.util.List<HedgeAUP> storeH,
java.util.List<HedgeAUP> storeC,
java.util.List<TermAUP> storeT,
java.util.Map<TermAUP,TermVar> trail,
TermGraph g)
Most likely you don't need this constructor because the algorithm is
encapsulated in the class AntiUnify which is much easier to use.
|
Modifier and Type | Method and Description |
---|---|
TermVar |
TermGraph.getRoot() |
TermVar |
NodeFactory.obtainFreshTermVar()
Fresh variables are not cached.
|
Modifier and Type | Method and Description |
---|---|
TermGraph |
TermGraph.copyRootAndTrim(TermVar newRoot)
Creates a copy with the specified root and removes all useless (unreachable)
equations
|
void |
TermGraph.setRoot(TermVar root)
Just sets the root without removing any equations.
|
Constructor and Description |
---|
TermGraph(TermVar root) |
TermGraph(TermVar root,
java.util.Map<Variable,Term> recursionEquations) |