org.dllearner.test.junit
Class SimulationTests

java.lang.Object
  org.dllearner.test.junit.SimulationTests

public class SimulationTests
extends Object

We test whether level-restricted, non-reflexive simulations on EL description trees are correctly computed.

Author:

Jens Lehmann

Constructor Summary

SimulationTests()

Method Summary

void	test1() Empty tree - empty simulation.
void	test2() v1:{A1} / \ r1 r2 / \ v2:{} v3:{} v1: - v2: in=inSC1=inSC2=out=outSC1=outSC2={v3} v3: in=inSC1=inSC2=out=outSC1=outSC2={v2}
void	test3() K: r1 \sqsubset r2 v1:{} / | \ r1 r1 r2 / | \ v2:{A1,A2} v3:{A2} v4:{A1} v1: - v2: in=inSC1=inSC2=outSC2={v3,v4} v3: out=outSC1={v2}, inSC2=outSC2={v2,v4} v4: out=outSC1={v2}, inSC2=outSC2={v2,v3}
void	test4() K: r2 \sqsubset r3; A2 \sqsubset A3 v1: {} / \ r1 r1 / \ v2:{A2,A3} v3:{} / | | r1 r2 r3 / | | v4:{A1} v5:{A1,A2} v6:{A3} v1: - v2: in=inSC1=inSC2={v3}, out=outSC1=outSC2={} v3: in=inSC1=inSC2={}, out=outSC1=outSC2={v2} v4: out=outSC1={v5}, outSC2=inSC2={v5,v6}, in=inSC1={} v5: out=outSC1={}, in=inSC1=inSC2=outSC2={v4,v6} v6: out=outSC1={v5}, outSC2=inSC2={v4,v5}, in=inSC1={}
void	test5() v_1 / \ r_2 r_1 / \ v_2 v_3 / | | \ r_1 r_1 r_1 r_2 / | | \ v_4 v_5 v_6 v_7 / | | \ | | r_2 r_1 r_2 r_2 r_1 r_2 / | | | | | v_8 v_9 v_10 v_11 v_12 v_13 A_1 A_2 A_2 A_1 A_2 A_2 Knowledge base: A_1\sqsubseteq A_2 r_1\sqsubseteq r_2 inSC1: (v_8,{v_9,..
void	test6() -------v_22------- / | \ r_1 r_1 r_1 / | \ v_19 v_20 v_21 / \ / \ / \ r_2 r_2 r_2 r_2 r_2 r_2 / | | | | | v_13 v_14 v_15 v_16 v_17 v_18__ / \ /\ /\ / \ / | | \ r_3 r_4 r_3 r_5 r_3 r_5 r_4 r_5 r_4 r_5 r_3 r_4 | | | | | | | | | | | | v_1 v_2 v_3 v_4 v_5 v_6 v_7 v_8 v_9 v_10 v_11 v_12 SC1=inSC1=outSC1={v_1,..
void	test7()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SimulationTests

public SimulationTests()

Method Detail

test1

public void test1()

Empty tree - empty simulation.

test2

public void test2()

v1:{A1} / \ r1 r2 / \ v2:{} v3:{} v1: - v2: in=inSC1=inSC2=out=outSC1=outSC2={v3} v3: in=inSC1=inSC2=out=outSC1=outSC2={v2}

test3

public void test3()

K: r1 \sqsubset r2 v1:{} / | \ r1 r1 r2 / | \ v2:{A1,A2} v3:{A2} v4:{A1} v1: - v2: in=inSC1=inSC2=outSC2={v3,v4} v3: out=outSC1={v2}, inSC2=outSC2={v2,v4} v4: out=outSC1={v2}, inSC2=outSC2={v2,v3}

test4

public void test4()

K: r2 \sqsubset r3; A2 \sqsubset A3 v1: {} / \ r1 r1 / \ v2:{A2,A3} v3:{} / | | r1 r2 r3 / | | v4:{A1} v5:{A1,A2} v6:{A3} v1: - v2: in=inSC1=inSC2={v3}, out=outSC1=outSC2={} v3: in=inSC1=inSC2={}, out=outSC1=outSC2={v2} v4: out=outSC1={v5}, outSC2=inSC2={v5,v6}, in=inSC1={} v5: out=outSC1={}, in=inSC1=inSC2=outSC2={v4,v6} v6: out=outSC1={v5}, outSC2=inSC2={v4,v5}, in=inSC1={}

test5

public void test5()

v_1 / \ r_2 r_1 / \ v_2 v_3 / | | \ r_1 r_1 r_1 r_2 / | | \ v_4 v_5 v_6 v_7 / | | \ | | r_2 r_1 r_2 r_2 r_1 r_2 / | | | | | v_8 v_9 v_10 v_11 v_12 v_13 A_1 A_2 A_2 A_1 A_2 A_2 Knowledge base: A_1\sqsubseteq A_2 r_1\sqsubseteq r_2 inSC1: (v_8,{v_9,..,v_13}), (v_9,{v_10,v_12,v_13}),... (Pattern wiederholt sich dann fuer die A_1 bzw A_2 Blaetter), (v_4,{v_5,v_6,v_7}),... (selbiges hier) (v_2,{v_3}), (v_3,{v_2}) outSC1: (v_8,{v_11}), v_9,{v_8, v_10,...v_13}),... Pattern wiederholt sich fuer restliche Knoten gilt inSC1=outSC1 inSC2: {v_8,...,v_13}2, (v_4,{v_5, v_6, v_7}), (v_5,{v_7}), (v_6,{v_7}) (v_2,{v_3}) outSC2: {v_8,...,v_13}2, (v_5,{v_4}), (v_6,{v_4}), (v_7,{v_5, v_6}), (v_3,{v_2}) Baum ist nicht minimal.

test6

public void test6()

-------v_22------- / | \ r_1 r_1 r_1 / | \ v_19 v_20 v_21 / \ / \ / \ r_2 r_2 r_2 r_2 r_2 r_2 / | | | | | v_13 v_14 v_15 v_16 v_17 v_18__ / \ /\ /\ / \ / | | \ r_3 r_4 r_3 r_5 r_3 r_5 r_4 r_5 r_4 r_5 r_3 r_4 | | | | | | | | | | | | v_1 v_2 v_3 v_4 v_5 v_6 v_7 v_8 v_9 v_10 v_11 v_12 SC1=inSC1=outSC1={v_1,..,v_12}2 U {v_13,..,v_18}2 U {v_19,v_20,v_21}2 SC2={v_1,..,v_12}2 U {(v_13, v_18), (v_14,v_15), (v_16,v_17)} U {(v_18, v_13), (v_15,v_14), (v_17,v_16)} S={v_1,..,v_12}2

test7

public void test7()