Package | Description |
---|---|
at.jku.risc.stout.urau.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
(RigidityFncSubsequence,
RigidityFncSubstring ).
|
Modifier and Type | Class and Description |
---|---|
class |
RigidityFncSubsequence
Implementation for rigidity function with subsequence matching.
Let m be the number of left term atoms and n be the number of right term atoms. Time complexity = Exponential worst case (back tracking) but should be OK in average case Space complexity = O(m * n) This implementation reuses all the allocated objects for performance reasons. |
class |
RigidityFncSubstring
Implementation for rigidity function with substring matching.
Let m be the number of left term atoms and n be the number of right term atoms. Time complexity = O(m * n) Space complexity = O(max(m, n)) This implementation reuses all the allocated objects for performance reasons. |
Modifier and Type | Method and Description |
---|---|
RigidityFnc |
AntiUnifySystem.getRFnc() |
RigidityFnc |
RigidityFncSubsequence.setMinLen(int minLen) |
RigidityFnc |
RigidityFncSubstring.setMinLen(int minLen) |
abstract RigidityFnc |
RigidityFnc.setMinLen(int minLen) |
Constructor and Description |
---|
AntiUnify(RigidityFnc rigidFnc,
EquationSystem<AntiUnifyProblem> eq,
DebugLevel debugLevel) |
AntiUnifySystem(Queue<AntiUnifySystem> eqBranch,
RigidityFnc rFnc,
EquationSystem<AntiUnifyProblem> problemSet,
boolean setUID)
Most likely you don't need this constructor because the algorithm is
encapsulated in the class AntiUnify which is much easier to
use.
|