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 |
---|---|
TermNode |
AntiUnifyProblem.bindAll(TermNode t)
Binds all the abstracted variables to the given term.
|
TermNode |
AntiUnifyProblem.createHO_Fnc()
X(x,y,...) where X is the generalization variable and x,y,...
|
TermNode |
AntiUnifyProblem.createHO_Fnc(Map<Variable,Variable> pi)
X(x,y,...) where X is the generalization variable and x,y,...
|
TermNode |
AntiUnifyProblem.createLambdaHedge(TermNode lambda)
Creates a lambda hedge which contains the given term node and all the
abstracted bound variables.
|
TermNode |
Substitution.get(Variable var)
|
TermNode |
AntiUnifyProblem.getLeft() |
TermNode |
PermEquivProblem.getLeft() |
TermNode |
AntiUnifyProblem.getRight() |
TermNode |
PermEquivProblem.getRight() |
Modifier and Type | Method and Description |
---|---|
Map<Variable,TermNode> |
Substitution.getMapping() |
Modifier and Type | Method and Description |
---|---|
void |
PermEquivSystem.addEquation(TermNode from,
TermNode to)
Adds a matching problem to the permuting matcher.
|
TermNode |
AntiUnifyProblem.bindAll(TermNode t)
Binds all the abstracted variables to the given term.
|
void |
Substitution.composeInRange(Variable fromVar,
TermNode toTerm)
Substitution composition which does not add new variables to the mapping.
|
TermNode |
AntiUnifyProblem.createLambdaHedge(TermNode lambda)
Creates a lambda hedge which contains the given term node and all the
abstracted bound variables.
|
void |
Substitution.put(Variable fromVar,
TermNode toTerm)
Add a new mapping of the form: Variable -> Term
Beta reduction is triggered automatically. |
void |
AntiUnifyProblem.setLeft(TermNode left) |
void |
PermEquivProblem.setLeft(TermNode node) |
void |
AntiUnifyProblem.setRight(TermNode right) |
void |
PermEquivProblem.setRight(TermNode node) |
Modifier and Type | Method and Description |
---|---|
TermNode |
TermNode.clone() |
TermNode |
NodeFactory.createConstant(String name,
String type) |
TermNode |
NodeFactory.createFunction(String name,
String type,
Hedge hedge) |
TermNode |
NodeFactory.createIndividualVar(String name,
String type) |
TermNode |
NodeFactory.createIndividualVar(String name,
String type,
Hedge hedge) |
TermNode |
Hedge.get(int i) |
TermNode |
Equation.getLeft()
Returns the left hand side of the equation.
|
TermNode |
Equation.getRight()
Returns the right hand side of the equation.
|
static TermNode |
NodeFactory.obtainFreshVarNode(String type) |
TermNode |
InputParser.parseSequence(Reader in)
Parses a sequence of terms out of the given Reader and
returns it.
|
TermNode |
InputParser.parseSequence(String in)
Use InputParser.parseSequence(Reader) if possible! It performs better
and saves space by reading directly from the data stream;)
|
TermNode |
InputParser.parseTerm(Reader in)
Parses a term out of the given Reader and returns it.
|
TermNode |
InputParser.parseTerm(String in)
Use InputParser.parseTerm(Reader) if possible! It performs better and
saves space by reading directly from the data stream;)
|
TermNode |
NodeFactory.popLambda(Hedge hedge) |
TermNode |
TermNode.reduce(int maxSteps)
Perform beta reduction with the given upper bound for recursion
repetition to avoid endless recursion in untyped calculus.
|
TermNode |
TermNode.reduceHedges()
Reduce unnecessary leading hedges.
|
Modifier and Type | Method and Description |
---|---|
void |
Hedge.add(TermNode t) |
void |
NodeFactory.addToHedge(TermNode node) |
T |
EquationSystem.newEquation(TermNode left,
TermNode right)
Instantiates an equation of the specified type and initializes it with
the given TermNodes.
|
void |
Equation.setLeft(TermNode node)
Sets the left hand side of the equation to the given
TermNode.
|
void |
Equation.setRight(TermNode node)
Sets the right hand side of the equation to the given
TermNode.
|
void |
Hedge.substitute(Variable from,
TermNode to) |
void |
TermNode.substitute(Variable fromVar,
TermNode toTerm)
Substitutes a variable by a term and returns the result.
|