Package | Description |
---|---|
at.jku.risc.stout.urauc.algo |
This package contains the classes of the rule based system
AntiUnifySystem, the corresponding
problem definition AntiUnifyProblem
and some standard implementations of a rigidity function
(AlignFncLAA,
AlignFncInput ).
|
at.jku.risc.stout.urauc.data |
This package contains the classes which are needed to build up the term tree.
|
Modifier and Type | Method and Description |
---|---|
Hedge |
AntiUnifyProblem.createMostGeneral() |
Hedge |
Substitution.get(Variable var)
|
Hedge |
AntiUnifyProblem.getLeft()
Returns the left hedge of this AUP.
|
Hedge |
AntiUnifyProblem.VariableWithHedges.getLeft() |
Hedge |
AntiUnifyProblem.getRight()
Returns the right hedge of this AUP.
|
Hedge |
AntiUnifyProblem.VariableWithHedges.getRight() |
Hedge |
AntiUnifyProblem.newHedge(TermNode... nodes)
Creates a new hedge which is commutative iff
AntiUnifyProblem.getHorizontalPartX().checkCommutative() is true.
|
Modifier and Type | Method and Description |
---|---|
void |
Substitution.composeInRange(Variable fromVar,
Hedge toHedge)
Substitution composition which does not add new variables to the mapping.
|
void |
Substitution.put(Variable fromVar,
Hedge toHedge)
Add a new mapping of the form: Variable -> Hedge
|
void |
AntiUnifyProblem.setLeft(Hedge hedge)
Set the left hedge of this AUP.
|
void |
AntiUnifyProblem.VariableWithHedges.setLeft(Hedge left) |
void |
AntiUnifyProblem.setRight(Hedge hedge)
Set the left hedge of this AUP.
|
void |
AntiUnifyProblem.VariableWithHedges.setRight(Hedge right) |
Constructor and Description |
---|
AntiUnifyProblem.VariableWithHedges(Variable var,
Hedge left,
Hedge right) |
AntiUnifyProblem(Hedge left,
Hedge right,
Alignment alignment)
Create an AUP with fresh generalization variables and the given hedges.
|
Modifier and Type | Field and Description |
---|---|
static Hedge |
Hedge.nullHedge |
Modifier and Type | Method and Description |
---|---|
Hedge |
Hedge.apply(Map<Variable,TermNode> sigma) |
Hedge |
Hedge.clone() |
Hedge |
NodeFactory.createHedge(TermNode... nodes) |
Hedge |
TermNode.getHedge() |
Hedge |
Hedge.getHoleHedge() |
Hedge |
Equation.getLeft()
The left hedge of the equation.
|
Hedge |
Equation.getRight()
The right hedge of the equation.
|
Hedge |
NodeFactory.popHedge() |
Hedge |
Hedge.subHedge(int fromIndex)
Returns a view of the tail of this hedge starting at the specified
fromIndex, inclusive.
|
Hedge |
Hedge.subHedge(int fromIndex,
int toIndex)
Returns a view of the portion of this hedge between the specified
fromIndex, inclusive, and toIndex, exclusive.
|
Hedge |
Hedge.substitute(Variable x,
Hedge h) |
Hedge |
Hedge.substitute(Variable x,
TermNode t) |
Modifier and Type | Method and Description |
---|---|
void |
Hedge.addAll(Hedge other) |
int |
Hedge.compareTo(Hedge other) |
TermNode |
NodeFactory.createContextVar(String name,
Hedge hedge) |
TermNode |
NodeFactory.createFunction(String name,
Hedge hedge) |
TermNode |
NodeFactory.createFunctionVar(String name,
Hedge hedge) |
abstract boolean |
TermNode.TraverseCallBack.exec(TermAtom atom,
Hedge hedge)
Propagation will stop as soon as this method returns true.
|
static TermNode |
NodeFactory.newNode(TermAtom atom,
Hedge hedge) |
int |
Hedge.replace(int idx,
Hedge toHedge)
Attention: Breaks the position indexes!
Replaces the TermNode at the given position by the given sequence. |
boolean |
Hedge.replaceHole(Hedge plugIn)
Replaces the hole in this hedge with the given other hedge.Returns true
if a hole has been found.
|
void |
TermNode.setHedge(Hedge hedge)
Null values are transformed to unique objects which represent the null
value.
|
Hedge |
Hedge.substitute(Variable x,
Hedge h) |
Constructor and Description |
---|
TermNode(TermAtom atom,
Hedge hedge)
Instantiates a new term node.
|