Package org.mindswap.pellet

Examples of org.mindswap.pellet.KnowledgeBase

52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
    return options;
  }

  @Override
  public void run() {
    KnowledgeBase kb = getKB();

    startTask( "consistency check" );
    boolean isConsistent = kb.isConsistent();
    finishTask( "consistency check" );

    if( isConsistent )
      output( "Consistent: Yes" );
    else {
      output( "Consistent: No" );
      output( "Reason: " + kb.getExplanation() );
    }
  }
View Full Code Here
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
    // that bug is triggered regardless of the traversal order
    // in getTransitivePropertyValues function. With the bug
    // if we visit b before c we will miss the value e and if we visit c
    // before b we miss the value d.

    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl a = term( "a" );
    ATermAppl b = term( "b" );
    ATermAppl c = term( "c" );
    ATermAppl d = term( "d" );
    ATermAppl e = term( "e" );

    ATermAppl p = term( "p" );
    ATermAppl r = term( "r" );
    ATermAppl s = term( "s" );

    kb.addObjectProperty( p );
    kb.addObjectProperty( r );
    kb.addObjectProperty( s );

    kb.addTransitiveProperty( r );
    kb.addTransitiveProperty( s );

    kb.addSubProperty( r, p );
    kb.addSubProperty( s, p );

    kb.addIndividual( a );
    kb.addIndividual( b );
    kb.addIndividual( c );
    kb.addIndividual( d );
    kb.addIndividual( e );

    kb.addPropertyValue( r, a, b );
    kb.addPropertyValue( r, b, c );
    kb.addPropertyValue( r, b, d );
    kb.addPropertyValue( s, a, c );
    kb.addPropertyValue( s, c, b );
    kb.addPropertyValue( s, c, e );

    assertTrue( kb.hasPropertyValue( a, p, b ) );
    assertTrue( kb.hasPropertyValue( a, p, c ) );
    assertTrue( kb.hasPropertyValue( a, p, d ) );
    assertTrue( kb.hasPropertyValue( a, p, e ) );
    assertIteratorValues( kb.getPropertyValues( p, a ).iterator(), new ATermAppl[] { b, c, d, e } );
  }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
   * Test that an individual added to a complete ABox isn't discarded if
   * backtracking occurs in that ABox
   */
  @Test
  public void backtrackPreservesAssertedIndividuals() {
    KnowledgeBase kb = new KnowledgeBase();

    kb.addIndividual( term( "x" ) );

    kb.addClass( term( "C" ) );
    kb.addClass( term( "D" ) );

    kb.addDatatypeProperty( term( "p" ) );
    kb.addFunctionalProperty( term( "p" ) );

    kb.addSubClass( term( "C" ), ATermUtils.makeSomeValues( term( "p" ), ATermUtils
        .makeValue( ATermUtils.makePlainLiteral( "0" ) ) ) );
    kb.addSubClass( term( "D" ), ATermUtils.makeSomeValues( term( "p" ), ATermUtils
        .makeValue( ATermUtils.makePlainLiteral( "1" ) ) ) );

    kb.addType( term( "x" ), ATermUtils.makeOr( ATermUtils.makeList( new ATerm[] {
        term( "C" ), term( "D" ) } ) ) );

    /*
     * At this point we can get onto one of two branches. In one p(x,"0"),
     * in the other p(x,"1") The branch point is a concept disjunction and
     * we're provoking a datatype clash.
     */
    assertTrue( kb.isConsistent() );

    /*
     * Add the individual to the now completed ABox
     */
    kb.addIndividual( term( "y" ) );

    assertTrue( kb.isConsistent() );
    assertNotNull( kb.getABox().getIndividual( term( "y" ) ) );

    /*
     * This assertion causes a clash regardless of which branch we are on
     */
    kb.addPropertyValue( term( "p" ), term( "x" ), ATermUtils.makePlainLiteral( "2" ) );

    assertFalse( kb.isConsistent() );

    /*
     * In 2.0.0-rc5 (and perhaps earlier, this assertion fails)
     */
    assertNotNull( kb.getABox().getIndividual( term( "y" ) ) );
  }
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
    assertSubClass( kb, and( min( p, 2, c ), min( p, 2, not( c ) ) ), min( p, 4, TOP ) );
  }

  @Test
  public void testQualifiedCardinalityDataProperty() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl c = restrict( Datatypes.INTEGER, minInclusive( literal( 10 ) ) );
    ATermAppl d = restrict( Datatypes.INTEGER, maxInclusive( literal( 20 ) ) );

    ATermAppl p = term( "p" );
    ATermAppl f = term( "f" );
    ATermAppl sub = Datatypes.SHORT;
    ATermAppl sup = Datatypes.INTEGER;

    kb.addDatatype(sub);
    kb.addDatatype(sup);
    kb.addDatatypeProperty( p );
    kb.addDatatypeProperty( f );
    kb.addFunctionalProperty( f );

    assertSatisfiable( kb, and( min( p, 2, and( c, d ) ), max( p, 2, c ), some( p, or( and( c,
        not( d ) ), c ) ) ) );
    assertSubClass( kb, min( p, 4, TOP_LIT ), min( p, 2, TOP_LIT ) );
    assertNotSubClass( kb, min( p, 1, TOP_LIT ), min( p, 2, TOP_LIT ) );
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
    assertSubClass( kb, and( min( p, 2, c ), min( p, 2, not( c ) ) ), min( p, 4, TOP_LIT ) );
  }

  @Test
  public void testQualifiedCardinality3() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl c = term( "z" );
    ATermAppl d = term( "d" );
    ATermAppl e = term( "e" );
    ATermAppl notD = term( "notD" );

    ATermAppl p = term( "p" );

    ATermAppl x = term( "x" );
    ATermAppl y3 = term( "y3" );

    kb.addObjectProperty( p );
    kb.addClass( c );
    kb.addClass( d );
    kb.addClass( e );
    kb.addClass( notD );

    kb.addDisjointClass( d, notD );
    // kb.addSubClass( c, or(e,not(d)) );

    kb.addIndividual( x );
    kb.addIndividual( y3 );

    kb.addType( x, and( min( p, 2, and( d, e ) ), max( p, 2, d ) ) );
    kb.addType( y3, not( e ) );
    kb.addType( y3, some( inv( p ), value( x ) ) );
    kb.addType( y3, or( d, c ) );

    assertTrue( kb.isConsistent() );
  }
View Full Code Here
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
    assertTrue( kb.isConsistent() );
  }

  @Test
  public void testSelfRestrictions() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl c = term( "c" );
    ATermAppl d = term( "d" );

    ATermAppl p = term( "p" );

    kb.addClass( c );
    kb.addClass( d );

    kb.addObjectProperty( p );

    kb.addRange( p, d );

    kb.addSubClass( c, and( self( p ), some( p, TOP ) ) );

    assertTrue( kb.isConsistent() );

    assertTrue( kb.isSatisfiable( c ) );
    assertTrue( kb.isSubClassOf( c, d ) );

  }
View Full Code Here
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
  @Test
  /**
   * Test for the enhancement required in #252
   */
  public void testBooleanDatatypeConstructors() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl nni = Datatypes.NON_NEGATIVE_INTEGER;
    ATermAppl npi = Datatypes.NON_POSITIVE_INTEGER;
    ATermAppl ni = Datatypes.NEGATIVE_INTEGER;
    ATermAppl pi = Datatypes.POSITIVE_INTEGER;
    ATermAppl f = Datatypes.FLOAT;

    ATermAppl s = term( "s" );
    kb.addDatatypeProperty( s );

    assertSatisfiable( kb, some( s, pi ) );
    assertSatisfiable( kb, some( s, not ( pi ) ) );
    assertUnsatisfiable( kb, some( s, and( pi, ni ) ) );
    assertUnsatisfiable( kb, some( s, and( f, or( pi, ni ) ) ) );
View Full Code Here
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
    assertSatisfiable( kb, some( s, and( nni, npi ) ) );
  }

  @Test
  public void testSelfRestrictionRestore() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl C = term( "c" );
    ATermAppl D = term( "d" );

    ATermAppl p = term( "p" );
    ATermAppl q = term( "q" );

    ATermAppl a = term( "a" );

    kb.addClass( C );
    kb.addClass( D );

    kb.addObjectProperty( p );
    kb.addObjectProperty( q );

    kb.addSubClass( C, or( not( self( p ) ), not( self( q ) ) ) );

    kb.addIndividual( a );
    kb.addType( a, C );

    assertTrue( kb.isConsistent() );

    assertFalse( kb.isType( a, not( self( p ) ) ) );
    assertFalse( kb.isType( a, not( self( q ) ) ) );
  }
View Full Code Here
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
    assertFalse( kb.isType( a, not( self( q ) ) ) );
  }

  @Test
  public void testReflexive1() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl c = term( "c" );
    ATermAppl d = term( "d" );
    ATermAppl sub = term( "sub" );
    ATermAppl sup = term( "sup" );

    ATermAppl p = term( "p" );
    ATermAppl r = term( "r" );
    ATermAppl weakR = term( "weakR" );

    ATermAppl x = term( "x" );
    ATermAppl y = term( "y" );

    kb.addClass( c );
    kb.addClass( d );
    kb.addClass( sub );
    kb.addClass( sup );
    kb.addSubClass( sub, sup );
    kb.addSubClass( some( weakR, TOP ), self( weakR ) );

    kb.addObjectProperty( p );
    kb.addObjectProperty( r );
    kb.addObjectProperty( weakR );
    kb.addReflexiveProperty( r );
    kb.addRange( r, d );

    kb.addIndividual( x );
    kb.addType( x, self( p ) );
    kb.addType( x, not( some( weakR, value( x ) ) ) );
    kb.addIndividual( y );
    kb.addPropertyValue( weakR, y, x );

    assertTrue( kb.isConsistent() );

    assertTrue( kb.isSubClassOf( and( c, self( p ) ), some( p, c ) ) );
    assertTrue( kb.isSubClassOf( and( c, min( r, 1, not( c ) ) ), min( r, 2, TOP ) ) );
    assertTrue( kb.isSubClassOf( min( r, 1, c ), d ) );
    assertTrue( kb.hasPropertyValue( x, p, x ) );
    assertTrue( kb.hasPropertyValue( y, weakR, y ) );
    assertTrue( kb.isDifferentFrom( x, y ) );
    assertTrue( kb.isDifferentFrom( y, x ) );
    assertTrue( kb.isType( x, some( r, value( x ) ) ) );
    assertTrue( kb.isSatisfiable( and( self( p ), self( inv( p ) ), max( p, 1, TOP ) ) ) );
  }
View Full Code Here
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
    assertTrue( kb.isSatisfiable( and( self( p ), self( inv( p ) ), max( p, 1, TOP ) ) ) );
  }

  @Test
  public void testReflexive2() {
    KnowledgeBase kb = new KnowledgeBase();

    ATermAppl a = term( "a" );
    ATermAppl c = term( "c" );
    ATermAppl r = term( "r" );

    kb.addIndividual( a );
    kb.addClass( c );
    kb.addSubClass( c, all( r, BOTTOM ) );
    kb.addSubClass( c, oneOf( a ) );

    kb.addObjectProperty( r );
    kb.addReflexiveProperty( r );

    assertSatisfiable( kb, c, false );
  }
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.KnowledgeBase

  • aterm.ATermAppl
  • aterm.ATermList
  • com.clarkparsia.explanation.test.JenaExplanationTest
  • com.clarkparsia.explanation.test.OWLAPIExplanationTest
  • com.clarkparsia.pellet.datatypes.test.DatatypeReasonerTests
  • com.clarkparsia.pellet.el.ReteBasedELClassifier
  • com.clarkparsia.pellet.el.SimplifiedELClassifier
  • com.clarkparsia.pellet.expressivity.Expressivity
  • com.clarkparsia.pellet.expressivity.ExpressivityChecker
  • com.clarkparsia.pellet.owlapiv3.PelletReasoner
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.