Package | Description |
---|---|
at.jku.risc.stout.hoau.algo |
This package contains the classes of the rule based system
(
AntiUnifySystem )
and its sub-algorighm PermEquivSystem . |
at.jku.risc.stout.hoau.data |
This package contains the classes which are needed to build up the term tree
and the
DataStructureFactory which
instantiates common data structures like List s,
Map s, Set s. |
Modifier and Type | Method and Description |
---|---|
void |
Substitution.composeInRange(Variable fromVar,
TermNode toTerm)
Substitution composition which does not add new variables to the mapping.
|
void |
AntiUnifySystem.compute()
Computes the result silently.
|
void |
AntiUnifySystem.compute(DebugLevel debugLevel,
PrintStream debugOut)
Computes the result and prints progress information to
PrintStream according to DebugLevel.
|
void |
Substitution.put(Variable fromVar,
TermNode toTerm)
Add a new mapping of the form: Variable -> Term
Beta reduction is triggered automatically. |
Constructor and Description |
---|
AntiUnifySystem(EquationSystem<AntiUnifyProblem> problemSet,
Substitution sigma)
Creates and initializes the rule based system.
|
Modifier and Type | Method and Description |
---|---|
<T extends Equation> |
InputParser.parseEquation(Reader in1,
Reader in2,
EquationSystem<T> eqSys,
int maxReduce) |
Hedge |
Hedge.reduce(int count) |
TermNode |
TermNode.reduce(int maxSteps)
Perform beta reduction with the given upper bound for recursion
repetition to avoid endless recursion in untyped calculus.
|
Hedge |
LambdaHedge.reduce(int count) |
void |
Hedge.substitute(Variable from,
TermNode to) |
void |
TermNode.substitute(Variable fromVar,
TermNode toTerm)
Substitutes a variable by a term and returns the result.
|