public Set<Node> getMerged() { if ( merged == null ) return SetUtils.emptySet(); return merged; }
public Set<Node> getMerged() { if ( merged == null ) return SetUtils.emptySet(); return merged; }
public Bool isKnownType(ATermAppl x, ATermAppl c) { return isKnownType( x, c, SetUtils.<ATermAppl>emptySet() ); }
public Bool isKnownType(ATermAppl x, ATermAppl c) { return isKnownType( x, c, SetUtils.<ATermAppl>emptySet() ); }
/** * Create an empty set */ private DependencySet() { depends = IntSetFactory.create(); setExplain( SetUtils.<ATermAppl>emptySet() ); }
/** * Create an empty set */ private DependencySet() { depends = IntSetFactory.create(); setExplain( SetUtils.<ATermAppl>emptySet() ); }
/** * Create a dependency set that depends on a single branch * * @param branch * Branch number */ public DependencySet(int branch) { this.depends = IntSetFactory.create(); depends.add( branch ); setExplain( SetUtils.<ATermAppl>emptySet() ); }
/** * Create a dependency set that depends on a single branch * * @param branch * Branch number */ public DependencySet(int branch) { this.depends = IntSetFactory.create(); depends.add( branch ); setExplain( SetUtils.<ATermAppl>emptySet() ); }
/** * Create a new DependencySet and all the elements of <code>this</code> * and <code>ds</code>. * * @param ds * @param doExplanation * @return */ public DependencySet union(DependencySet ds, boolean doExplanation) { IntSet newDepends = depends.union( ds.depends ); Set<ATermAppl> newExplain; if( doExplanation ) { newExplain = SetUtils.union( explain, ds.explain ); } else { newExplain = SetUtils.emptySet(); } return new DependencySet( branch, newDepends, newExplain ); }
/** * Create a new DependencySet and all the elements of <code>this</code> * and <code>ds</code>. * * @param ds * @param doExplanation * @return */ public DependencySet union(DependencySet ds, boolean doExplanation) { IntSet newDepends = depends.union( ds.depends ); Set<ATermAppl> newExplain; if( doExplanation ) { newExplain = SetUtils.union( explain, ds.explain ); } else { newExplain = SetUtils.emptySet(); } return new DependencySet( branch, newDepends, newExplain ); }
private Set<ATermAppl> realizeByConcept( ATermAppl c, Collection<ATermAppl> individuals, OWLDataFactory factory, Set<OWLClass> visitedClasses ) { if( c.equals( ATermUtils.BOTTOM ) ) { return SetUtils.emptySet();
/** * Return true if this ABox is consistent. Consistent ABox means after * applying all the tableau completion rules at least one branch with no * clashes was found * * @return */ public boolean isConsistent() { boolean isConsistent = false; checkAssertedClashes(); isConsistent = isConsistent( SetUtils.<ATermAppl>emptySet(), null, false ); if( isConsistent ) { // put the BOTTOM concept into the cache which will // also put TOP in there cache.putSat( ATermUtils.BOTTOM, false ); assert isComplete() : "ABox not marked complete!"; } return isConsistent; }
/** * Return true if this ABox is consistent. Consistent ABox means after * applying all the tableau completion rules at least one branch with no * clashes was found * * @return */ public boolean isConsistent() { boolean isConsistent = false; checkAssertedClashes(); isConsistent = isConsistent( SetUtils.<ATermAppl>emptySet(), null, false ); if( isConsistent ) { // put the BOTTOM concept into the cache which will // also put TOP in there cache.putSat( ATermUtils.BOTTOM, false ); assert isComplete() : "ABox not marked complete!"; } return isConsistent; }
private Set<ATermAppl> realizeByConcept(ATermAppl c, Collection<ATermAppl> individuals) { if( c.equals( ATermUtils.BOTTOM ) ) { return SetUtils.emptySet();
private Set<ATermAppl> realizeByConcept(ATermAppl c, Collection<ATermAppl> individuals) { if( c.equals( ATermUtils.BOTTOM ) ) { return SetUtils.emptySet();
boolean isSat = isConsistent( SetUtils.<ATermAppl>emptySet(), c, cacheModel ); t.stop();
boolean isSat = isConsistent( SetUtils.<ATermAppl>emptySet(), c, cacheModel ); t.stop();
subs = SetUtils.emptySet();
subs = SetUtils.emptySet();
while( i.hasNext() && knownType.isTrue() ) { term = i.next(); knownType = isKnownType( pNode, term, SetUtils.<ATermAppl>emptySet() );