private Bool isType(CachedNode pNode, ATermAppl c) { Bool isType = Bool.UNKNOWN; boolean isPrimitive = kb.getTBox().isPrimitive( c ); if( isPrimitive && !pNode.isTop() && !pNode.isBottom() && pNode.isComplete() ) { DependencySet ds = pNode.getDepends().get( c ); if( ds == null ) { return Bool.FALSE; } else if( ds.isIndependent() && pNode.isIndependent() ) { return Bool.TRUE; } } ATermAppl notC = ATermUtils.negate( c ); CachedNode cached = getCached( notC ); if( cached != null && cached.isComplete() ) { isType = cache.isMergable( kb, pNode, cached ).not(); } if( PelletOptions.CHECK_NOMINAL_EDGES && isType.isUnknown() ) { CachedNode cNode = getCached( c ); if( cNode != null ) { isType = cache.checkNominalEdges( kb, pNode, cNode ); } } return isType; }
private Bool isType(CachedNode pNode, ATermAppl c) { Bool isType = Bool.UNKNOWN; boolean isPrimitive = kb.getTBox().isPrimitive( c ); if( isPrimitive && !pNode.isTop() && !pNode.isBottom() && pNode.isComplete() ) { DependencySet ds = pNode.getDepends().get( c ); if( ds == null ) { return Bool.FALSE; } else if( ds.isIndependent() && pNode.isIndependent() ) { return Bool.TRUE; } } ATermAppl notC = ATermUtils.negate( c ); CachedNode cached = getCached( notC ); if( cached != null && cached.isComplete() ) { isType = cache.isMergable( kb, pNode, cached ).not(); } if( PelletOptions.CHECK_NOMINAL_EDGES && isType.isUnknown() ) { CachedNode cNode = getCached( c ); if( cNode != null ) { isType = cache.checkNominalEdges( kb, pNode, cNode ); } } return isType; }
public Bool isMergable(KnowledgeBase kb, CachedNode root1, CachedNode root2) { Bool result = checkTrivialClash( root1, root2 ); if( result != null ) return result.not();
public Bool isMergable(KnowledgeBase kb, CachedNode root1, CachedNode root2) { Bool result = checkTrivialClash( root1, root2 ); if( result != null ) return result.not();