13841385138613871388138913901391139213931394
assertSubClass( kb, A, B ); assertSubClass( kb, B, C ); kb.classify(); } @Test public void testNominalCache() { // this case tests isMergable check and specifically the correctness of
130131132133134135136137138139140
if( !isConsistent ) throw new PelletCmdException( "Ontology is inconsistent, run \"pellet explain\" to get the reason" ); startTask( "classification" ); kb.classify(); finishTask( "classification" ); TaxonomyPrinter<ATermAppl> printer = new ClassTreePrinter(); printer.print( kb.getTaxonomy() ); }
16491650165116521653165416551656165716581659
kb.addEquivalentClass( D, and( some( p, A ), min( p, 1, value(b) ), min( p, 1, value(c) ), max( p, 1, TOP ) ) ); assertTrue( kb.isConsistent() ); kb.classify(); assertTrue( kb.isSubClassOf( D, B ) ); assertTrue( kb.isSubClassOf( D, C ) ); }
18771878187918801881188218831884188518861887
kb.addClass( A ); kb.addObjectProperty( p ); kb.addDisjointClasses( Arrays.asList( A, self(p) ) ); kb.classify(); assertTrue( kb.isSatisfiable( A ) ); } @Test
19481949195019511952195319541955195619571958
// A is not primitive because of the domain axiom kb.addDomain( p, A ); // C should be inferred to be a subclass of A and B kb.addSubClass( C, some(p, TOP_LIT ) ); kb.classify(); assertSubClass( kb, C, A ); assertSubClass( kb, C, B ); }
557558559560561562563564565566567
kb.addType( term( "a" ), term( "C" ) ); kb.addIndividual( term( "b" ) ); kb.addType( term( "b" ), term( "D" ) ); kb.classify(); assertTrue( kb.getDifferents( term( "a" ) ).contains( term( "b" ) ) ); assertTrue( kb.getDifferents( term( "b" ) ).contains( term( "a" ) ) ); }
662663664665666667668669670671672
// EL classifier kb.addSubClass( C, min( p, 2, TOP ) ); assertTrue( kb.isConsistent() ); kb.classify(); assertTrue( kb.isEquivalentClass( A, TOP ) ); assertFalse( kb.isEquivalentClass( B, TOP ) ); }
687688689690691692693694695696697
kb.addEquivalentClass( A, or( B, not( B ) ) ); assertTrue( kb.isConsistent() ); kb.classify(); assertTrue( kb.isEquivalentClass( A, TOP ) ); assertFalse( kb.isEquivalentClass( B, TOP ) ); }
715716717718719720721722723724725
kb.addEquivalentClass( B, or( B, not( B ) ) ); kb.addSubClass( C, A ); assertTrue( kb.isConsistent() ); kb.classify(); assertTrue( kb.isEquivalentClass( A, TOP ) ); assertTrue( kb.isEquivalentClass( B, TOP ) ); assertFalse( kb.isEquivalentClass( C, TOP ) ); }
771772773774775776777778779780781
kb.addClass( D ); kb.addSubClass( C, B ); kb.addSubClass( D, C ); kb.addEquivalentClass( D, B ); kb.classify(); assertTrue( kb.isEquivalentClass( B, C ) ); assertTrue( kb.isEquivalentClass( B, D ) ); assertTrue( kb.isEquivalentClass( D, C ) ); }