Examples with PrologTerm de.prob.prolog.term.PrologTerm used on opensource projects

Example 16 with PrologTerm

use of de.prob.prolog.term.PrologTerm in project probparsers by bendisposto.

the class PrologGeneratorTest method testWeakFair_multiple.

@Test
public void testWeakFair_multiple() throws Exception {
    final PrologTerm transPred1 = new CompoundPrologTerm("bla");
    final PrologTerm wrapped1 = new CompoundPrologTerm("dtrans", transPred1);
    final PrologTerm wf1 = new CompoundPrologTerm("weak_fair", wrapped1);
    final PrologTerm ap1 = new CompoundPrologTerm("ap", wf1);
    final PrologTerm transPred2 = new CompoundPrologTerm("blubb");
    final PrologTerm wrapped2 = new CompoundPrologTerm("dtrans", transPred2);
    final PrologTerm wf2 = new CompoundPrologTerm("weak_fair", wrapped2);
    final PrologTerm ap2 = new CompoundPrologTerm("ap", wf2);
    final PrologTerm orPred = new CompoundPrologTerm("or", ap1, ap2);
    final PrologTerm weak_assumption = new CompoundPrologTerm("weakassumptions", orPred);
    final PrologTerm expected = new CompoundPrologTerm("fairnessimplication", weak_assumption, TERM_TRUE);
    check("wf(bla) or wf(blubb) => true", expected);
}

Example 17 with PrologTerm

use of de.prob.prolog.term.PrologTerm in project probparsers by bendisposto.

the class PrologGeneratorTest method testWeakFair.

@Test
public void testWeakFair() throws Exception {
    final PrologTerm transPred = new CompoundPrologTerm("bla");
    final PrologTerm wrapped = new CompoundPrologTerm("dtrans", transPred);
    final PrologTerm wf = new CompoundPrologTerm("weak_fair", wrapped);
    final PrologTerm ap = new CompoundPrologTerm("ap", wf);
    final PrologTerm weak_assumption = new CompoundPrologTerm("weakassumptions", ap);
    final PrologTerm expected = new CompoundPrologTerm("fairnessimplication", weak_assumption, TERM_TRUE);
    check("wf(bla) => true", expected);
}

Example 18 with PrologTerm

use of de.prob.prolog.term.PrologTerm in project probparsers by bendisposto.

the class PrologGeneratorTest method testTrigger.

@Test
public void testTrigger() throws Exception {
    final PrologTerm expected = new CompoundPrologTerm("trigger", TERM_FALSE, TERM_TRUE);
    check("false T true ", expected);
}

Example 19 with PrologTerm

use of de.prob.prolog.term.PrologTerm in project probparsers by bendisposto.

the class PrologGeneratorTest method testExistsImplicationNested.

@Test
public void testExistsImplicationNested() throws Exception {
    final PrologTerm id_outer = new CompoundPrologTerm("x___1");
    final PrologTerm id_inner = new CompoundPrologTerm("y");
    // ap(dpred(blubb))
    final PrologTerm pred = new CompoundPrologTerm("blubb");
    final PrologTerm dpred = new CompoundPrologTerm("dpred", pred);
    final PrologTerm ap = new CompoundPrologTerm("ap", dpred);
    final PrologTerm transPredx = new CompoundPrologTerm("x");
    final PrologTerm wrappedx = new CompoundPrologTerm("dtrans", transPredx);
    final PrologTerm actionx = new CompoundPrologTerm("action", wrappedx);
    final PrologTerm transPredy = new CompoundPrologTerm("y");
    final PrologTerm wrappedy = new CompoundPrologTerm("dtrans", transPredy);
    final PrologTerm actiony = new CompoundPrologTerm("action", wrappedy);
    final PrologTerm orPred = new CompoundPrologTerm("or", actionx, actiony);
    final PrologTerm glob = new CompoundPrologTerm("globally", orPred);
    final PrologTerm forall = new CompoundPrologTerm("forall", id_inner, ap, glob);
    final PrologTerm expected = new CompoundPrologTerm("exists", id_outer, ap, forall);
    check("# x___1 . ( {blubb} & !y. ({blubb} => G ([x] or [y])))", expected);
}

Example 20 with PrologTerm

use of de.prob.prolog.term.PrologTerm in project probparsers by bendisposto.

the class PrologGeneratorTest method testStrongFair.

@Test
public void testStrongFair() throws Exception {
    final PrologTerm transPred1 = new CompoundPrologTerm("bla");
    final PrologTerm wrapped1 = new CompoundPrologTerm("dtrans", transPred1);
    final PrologTerm sf1 = new CompoundPrologTerm("strong_fair", wrapped1);
    final PrologTerm ap1 = new CompoundPrologTerm("ap", sf1);
    final PrologTerm strong_assumptions = new CompoundPrologTerm("strongassumptions", ap1);
    final PrologTerm transPred2 = new CompoundPrologTerm("blubb");
    final PrologTerm wrapped2 = new CompoundPrologTerm("dtrans", transPred2);
    final PrologTerm sf2 = new CompoundPrologTerm("weak_fair", wrapped2);
    final PrologTerm ap2 = new CompoundPrologTerm("ap", sf2);
    final PrologTerm weak_assumptions = new CompoundPrologTerm("weakassumptions", ap2);
    final PrologTerm andPred = new CompoundPrologTerm("and", strong_assumptions, weak_assumptions);
    final PrologTerm expected = new CompoundPrologTerm("fairnessimplication", andPred, TERM_TRUE);
    check("(sf(bla)) & (wf(blubb)) => true", expected);
}