@Test public void testAll() { final StringWriter s = new StringWriter(); final ATermRenderer r = new ATermManchesterSyntaxRenderer(); r.setWriter(new PrintWriter(s)); final ATermAppl C = term("C"); final ATermAppl p = term("p"); r.visit(all(p, C)); final String expected = "(p only C)"; final String actual = s.toString(); assertEquals(expected, actual); }
@Test public void bottomObjectInverseManual() { final KnowledgeBaseImpl kb = new KnowledgeBaseImpl(); final ATermAppl c = term("_C_"); final ATermAppl notC = not(c); final ATermAppl r = BOTTOM_OBJECT_PROPERTY; final ATermAppl test = and(c, or(some(r, all(r, notC)), some(r, all(r, notC)))); assertFalse(kb.isSatisfiable(test)); }
@Test public void testDisjunction() { classes(_A, _B); objectProperties(_p); individuals(_a, _b); _kb.addType(_a, _A); _kb.addPropertyValue(_p, _a, _b); _kb.addType(_a, or(not(_A), all(_p, _B))); explainEntailment(_kb.isType(_b, _B), ATermUtils.makeTypeAtom(_a, _A), ATermUtils.makePropAtom(_p, _a, _b), ATermUtils.makeTypeAtom(_a, or(not(_A), all(_p, _B)))); }
@Test public void test518() { // tests if the interaction between some values restriction and inverses ends up creating a cycle in the // completion graph classes(_A, _B, _C); objectProperties(_p, _q); _kb.addInverseFunctionalProperty(_p); _kb.addSubProperty(_q, inv(_p)); assertFalse(_kb.isSatisfiable(some(_p, some(_q, all(_p, BOTTOM))))); }
@Test public void somePQallAnonInvR1() { classes(_C); objectProperties(_p, _q, _r); _kb.addSubProperty(list(_p, _q), _r); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertTrue(_kb.isSatisfiable(all(inv(_r), not(_C)))); assertFalse(_kb.isSatisfiable(and(_C, some(_p, some(_q, all(inv(_r), not(_C))))))); }
@Test public void somePQallAnonInvR2() { classes(_C); objectProperties(_p, _q, _r); _kb.addSubProperty(list(_p, _q), _r); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertTrue(_kb.isSatisfiable(some(_q, all(inv(_r), not(_C))))); assertFalse(_kb.isSatisfiable(and(_C, some(_p, some(_q, all(inv(_r), not(_C))))))); }
@Test public void nestedPropertyChains() { classes(_C); objectProperties(_p, _q, _r, _f); _kb.addSubProperty(list(_p, _q), _r); _kb.addSubProperty(list(_r, _q), _f); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertTrue(_kb.isSatisfiable(all(inv(_f), not(_C)))); assertFalse(_kb.isSatisfiable(and(_C, some(_p, some(_q, some(_q, all(inv(_f), not(_C)))))))); }
@Test public void cdClassificationWithInverses() { classes(_C, _D, _E); objectProperties(_p); _kb.addSubClass(_C, some(_p, _D)); _kb.addSubClass(_D, all(inv(_p), _E)); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSubClassOf(_C, _E)); _kb.classify(); assertTrue(_kb.isSubClassOf(_C, _E)); }
@Test public void somePallInvP() { classes(_C, _D); objectProperties(_p); _kb.addSubClass(_D, some(_p, _C)); _kb.addSubClass(_C, all(inv(_p), not(_D))); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertFalse(_kb.isSatisfiable(_D)); }
@Test public void somePallInvPwithReflexivity() { classes(_C, _D); objectProperties(_p, _r); _kb.addReflexiveProperty(_r); _kb.addSubClass(_D, some(_p, _C)); _kb.addSubClass(_C, all(inv(_p), not(_D))); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertFalse(_kb.isSatisfiable(_D)); }
@Test public void somePallInvPSubClass() { classes(_B, _C, _D, _E); objectProperties(_p); _kb.addSubClass(_D, _E); _kb.addEquivalentClass(_E, some(_p, _C)); _kb.addSubClass(_C, _B); _kb.addSubClass(_B, all(inv(_p), not(_D))); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertFalse(_kb.isSatisfiable(_D)); }
@Ignore("See ticket #294") @Test public void testTransitivePropertyChain() { classes(_C, _D); objectProperties(_p, _q, _r); _kb.addSubProperty(list(_p, _q), _r); _kb.addTransitiveProperty(_p); _kb.addSubClass(_C, some(_p, some(_q, some(_p, some(_q, _D))))); _kb.addSubClass(_C, all(_r, not(_D))); assertFalse(_kb.isSatisfiable(_C)); }
@Test public void testFindPrimitives() { testFindPrimitives(some(_p, not(_c)), new ATermAppl[] { _c }); testFindPrimitives(and(_c, _b, all(_p, _a)), new ATermAppl[] { _a, _b, _c }); testFindPrimitives(max(_p, 1, not(some(_p, or(_a, _b)))), new ATermAppl[] { _a, _b }); testFindPrimitives(min(_p, 2, or(_a, and(_b, not(_c)))), new ATermAppl[] { _a, _b, _c }); testFindPrimitives(and(some(_p, ATermUtils.TOP), all(_p, _a), and(some(_p, value(_r)), or(self(_p), max(_p, 1, _b)))), new ATermAppl[] { ATermUtils.TOP, _a, _b }); testFindPrimitives(and(_d1, _d2, _d3), new ATermAppl[] { _d3 }); testFindPrimitives(not(and(not(_d1), _d2, _d3)), new ATermAppl[] { _d3 }); testFindPrimitives(some(_p, and(_d1, _d3)), new ATermAppl[] { _d3 }); }
@Test public void testFindPrimitives() { testFindPrimitives(some(_p, not(_c)), new ATermAppl[] { _c }); testFindPrimitives(and(_c, _b, all(_p, _a)), new ATermAppl[] { _a, _b, _c }); testFindPrimitives(max(_p, 1, not(some(_p, or(_a, _b)))), new ATermAppl[] { _a, _b }); testFindPrimitives(min(_p, 2, or(_a, and(_b, not(_c)))), new ATermAppl[] { _a, _b, _c }); testFindPrimitives(and(some(_p, ATermUtils.TOP), all(_p, _a), and(some(_p, value(_r)), or(self(_p), max(_p, 1, _b)))), new ATermAppl[] { ATermUtils.TOP, _a, _b }); testFindPrimitives(and(_d1, _d2, _d3), new ATermAppl[] { _d3 }); testFindPrimitives(not(and(not(_d1), _d2, _d3)), new ATermAppl[] { _d3 }); testFindPrimitives(some(_p, and(_d1, _d3)), new ATermAppl[] { _d3 }); }
@Test public void somePQallInvR() { classes(_C, _D); objectProperties(_p, _q, _r); _kb.addSubProperty(list(_p, _q), _r); _kb.addSubClass(_D, some(_p, some(_q, _C))); _kb.addSubClass(_C, all(inv(_r), not(_D))); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(_C)); assertFalse(_kb.isSatisfiable(_D)); }
@Test public void propertyChainInverse() { classes(_C, _D); objectProperties(_p, _q, _r); _kb.addSubProperty(list(_r, _p), _q); _kb.addSubClass(_D, all(_q, _C)); assertTrue(_kb.isConsistent()); assertFalse(_kb.isSatisfiable(some(_p, and(_D, some(_p, and(some(inv(_r), _D), some(_p, not(_C)))))))); }
@Test public void transitivityInverse() { classes(_C, _D); objectProperties(_p, _q, _r); _kb.addTransitiveProperty(_r); _kb.addSubProperty(_r, _q); _kb.addSubClass(_D, all(_q, _C)); assertTrue(_kb.isConsistent()); assertFalse(_kb.isSatisfiable(some(_p, and(_D, some(_p, and(some(inv(_r), _D), some(_r, not(_C)))))))); }
@Test public void propertyChain() { classes(_C, _D); objectProperties(_p, _q, _r, _s); _kb.addDisjointClass(_C, _D); _kb.addSubProperty(list(_p, inv(_q), _r, _s), _s); _kb.addSubClass(_D, all(_s, _C)); _kb.addSubClass(_D, some(_p, some(inv(_q), some(_r, some(_s, _D))))); assertTrue(_kb.isConsistent()); assertFalse(_kb.isSatisfiable(_D)); }
@Test public void functionalSubTrans() { classes(_A); objectProperties(_r, _f); _kb.addFunctionalProperty(_f); _kb.addTransitiveProperty(_r); _kb.addSubProperty(_f, _r); _kb.addEquivalentClass(_D, and(_C, some(_f, not(_C)))); assertTrue(_kb.isConsistent()); assertTrue(_kb.isSatisfiable(and(not(_A), some(inv(_f), _A), all(inv(_r), some(inv(_f), _A))))); }
@Test public void doubleBlockingExample() { classes(_C, _D); objectProperties(_f, _r); _kb.addTransitiveProperty(_r); _kb.addSubProperty(_f, _r); _kb.addEquivalentClass(_D, and(_C, some(_f, not(_C)))); _kb.addSubClass(TOP, max(_f, 1, TOP)); assertTrue(_kb.isConsistent()); assertFalse(_kb.isSatisfiable(and(not(_C), some(inv(_f), _D), all(inv(_r), some(inv(_f), _D))))); }