public String missingDatatypeExplanation() { return "Plain literal " + ATermUtils.toString((ATermAppl) args[0]) + " does not belong to datatype " + args[1] + ". Literal value may be missing the rdf:datatype attribute."; }
@Override public String toString() { return ATermUtils.toString( name ); } }
/** * Return a string representation of the term which might be representing a named * term, literal, variable or a complex concept expression. The URIs used in the * term will be shortened into local names. The concept expressions are printed * in NNF format. * * @param term term whose string representation we are creating * @return string representation of the term */ public static String toString(ATermAppl term) { return toString( term, true , true); }
@Override public String toString() { return ATermUtils.toString( result ); } }
public String missingDatatypeExplanation() { return "Plain literal " + ATermUtils.toString((ATermAppl) args[0]) + " does not belong to datatype " + args[1] + ". Literal value may be missing the rdf:datatype attribute."; }
@Override public String toString() { return ATermUtils.toString(concept); } }
/** * Return a string representation of the term which might be representing a named * term, literal, variable or a complex concept expression. The URIs used in the * term will be shortened into local names. The concept expressions are printed * in NNF format. * * @param term term whose string representation we are creating * @return string representation of the term */ public static String toString(ATermAppl term) { return toString( term, true , true); }
@Override public String toString() { return "Produce[" + ATermUtils.toString(type) + "(" + subject + ")]"; } }
public void print(Appendable out) throws IOException { for( Entry<ATermAppl, Unfolding> e : definitions.entrySet() ) { out.append( ATermUtils.toString( e.getKey() ) ); out.append( " = " ); out.append( e.getValue().toString() ); out.append( "\n" ); } } }
public void print(Appendable out) throws IOException { for( Entry<ATermAppl, List<Unfolding>> e : unfoldings.entrySet() ) { out.append( ATermUtils.toString( e.getKey() ) ); out.append( " < " ); out.append( e.getValue().toString() ); out.append( "\n" ); } } }
@Override public String toString() { return "Produce[" + ATermUtils.toString(role.getName()) + "(" + subject + ", " + object + ")]"; } }
@Override public String toString() { return ATermUtils.toString(ATermUtils.makeTermAppl(name)) + Arrays.toString(args); } }
protected void addDefinition(ATermAppl concept, ATermAppl definition, Set<ATermAppl> explanation) { definition = ATermUtils.normalize( definition ); if( log.isLoggable( Level.FINE ) ) log.fine( "Def: " + ATermUtils.toString( concept ) + " = " + ATermUtils.toString( definition ) ); definitions.put( concept, Unfolding.create( definition, explanation ) ); }
@Override public String toString() { return ATermUtils.toString(node.getName()); } }
public void add(ATermAppl sub, ATermAppl sup, Set<ATermAppl> explanation) { List<Unfolding> list = unfoldings.get( sub ); if( list == null ) { list = CollectionUtils.makeList(); unfoldings.put( sub, list ); } sup = ATermUtils.normalize( sup ); if( log.isLoggable( Level.FINE ) ) log.fine( "Add sub: " + ATermUtils.toString( sub ) + " < " + ATermUtils.toString( sup ) ); list.add( Unfolding.create( sup, explanation ) ); }
public void add(ATermAppl sub, ATermAppl sup, Set<ATermAppl> explanation) { List<Unfolding> list = unfoldings.get( sub ); if( list == null ) { list = CollectionUtils.makeList(); unfoldings.put( sub, list ); } sup = ATermUtils.normalize( sup ); if( log.isLoggable( Level.FINE ) ) log.fine( "Add sub: " + ATermUtils.toString( sub ) + " < " + ATermUtils.toString( sup ) ); list.add( Unfolding.create( sup, explanation ) ); }
protected void applyAllValues( Individual subj, Role pred, Node obj, ATermAppl c, DependencySet ds ) { if( !obj.hasType( c ) ) { if( log.isLoggable( Level.FINE ) ) { log.fine( "ALL : " + subj + " -> " + pred + " -> " + obj + " : " + ATermUtils.toString( c ) + " - " + ds ); } //because we do not maintain the queue it could be the case that this node is pruned, so return if(PelletOptions.USE_COMPLETION_QUEUE && !PelletOptions.MAINTAIN_COMPLETION_QUEUE && obj.isPruned()) return; strategy.addType( obj, c, ds ); } }
private void absorbSubClass(ATermAppl sub, ATermAppl sup, Set<ATermAppl> explanation) { if( log.isLoggable( Level.FINE ) ) log.fine( "Absorb: subClassOf(" + ATermUtils.toString(sub) + ", " + ATermUtils.toString(sup) + ")"); Set<ATermAppl> terms = CollectionUtils.makeSet(); terms.add( nnf( sub ) ); terms.add( nnf( negate( sup ) ) ); absorbAxiom( terms, CollectionUtils.makeSet( explanation ) ); }
protected void applyAllValues( Individual subj, Role pred, Node obj, ATermAppl c, DependencySet ds ) { if( !obj.hasType( c ) ) { if( log.isLoggable( Level.FINE ) ) { log.fine( "ALL : " + subj + " -> " + pred + " -> " + obj + " : " + ATermUtils.toString( c ) + " - " + ds ); } //because we do not maintain the queue it could be the case that this node is pruned, so return if(PelletOptions.USE_COMPLETION_QUEUE && !PelletOptions.MAINTAIN_COMPLETION_QUEUE && obj.isPruned()) return; strategy.addType( obj, c, ds ); } }