try { String in = "f(X,Y) =? f(f(a))"; UnifProblem p = new UnifProblem(); new InputParser(p, new NodeFactory()).parseEqSystem(in, null); new UnifAlgorithm(new UnifSystem(p, new Substitution()), 100) .unify(DebugLevel.PROGRESS, System.out, System.out, true); } catch (Exception e) { e.printStackTrace(); }
Author: | Alexander Baumgartner | |
Project: | SToUT - Symbolic Computation Techniques for Unranked Terms |