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 |
---|---|
static TermGraph |
AntiUnifySystem.G1 |
static TermGraph |
AntiUnifySystem.G2 |
Modifier and Type | Method and Description |
---|---|
TermGraph |
AntiUnifySystem.compute()
Most likely you don't need this method because the algorithm is encapsulated
in the class AntiUnify which is much easier to use.
|
TermGraph |
AntiUnifySystem.getGraph() |
TermGraph |
TermGraphNormalizer.normalize(TermGraph tg)
Normalize all the names of all the variables in the given term graph.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<TermGraph> |
AntiUnify.getNormalizedSet()
The set of all the computed and normalized generalizations.
|
Modifier and Type | Method and Description |
---|---|
void |
AntiUnify.callback(TermGraph generalization)
This callback function will be invoked for every found generalization.
|
TermGraph |
TermGraphNormalizer.normalize(TermGraph tg)
Normalize all the names of all the variables in the given term graph.
|
Constructor and Description |
---|
AntiUnify(RigidityFnc rigidFnc,
RigidityFncSubsequence rigidFncCommutative,
TermGraph g1,
TermGraph g2,
NodeFactory nf)
Attention: Do not run two instances in parallel, since
AntiUnifySystem uses global static arguments!
|
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 |
---|---|
TermGraph |
TermGraph.copy() |
TermGraph |
TermGraph.copyRootAndTrim(TermVar newRoot)
Creates a copy with the specified root and removes all useless (unreachable)
equations
|
TermGraph |
InputParser.parseTermGraph(java.io.Reader in,
boolean enableCommutative)
Parses a system of recursion equations and returns a term graph.
|
Modifier and Type | Method and Description |
---|---|
int |
TermGraph.compareTo(TermGraph o)
Poor performance - do not use if not absolutely necessary.
|