Package org.mindswap.pellet

Examples of org.mindswap.pellet.Role

208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
  private Set<ATermAppl> getRNeighbors(CachedNode node, Role role) {
    Set<ATermAppl> neighbors = new HashSet<ATermAppl>();

    for( Edge edge : node.getOutEdges() ) {
      Role r = edge.getRole();
      if( r.isSubRoleOf( role ) ) {
        neighbors.add( edge.getToName() );
      }
    }

    if( role.isObjectRole() ) {
      role = role.getInverse();
      for( Edge edge : node.getInEdges() ) {
        Role r = edge.getRole();
        if( r.isSubRoleOf( role ) ) {
          neighbors.add( edge.getFromName() );
        }
      }
    }
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
257
    return false;
  }

  protected boolean interactsWithInversesComplex(KnowledgeBase kb, Role role) {
    for( ATermAppl p : expressivity.getAnonInverses() ) {
      Role anonRole = kb.getRole( p );
      if( anonRole.hasComplexSubRole() && anonRole.getFSM().getAlpahabet().contains( role ) )
        return true;

    }

    return false;
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
    return true;
  }
 
  protected boolean block4(BlockingContext cxt, ATermAppl term) {
    Role t = cxt.blocked.getABox().getRole( term.getArgument( 0 ) );
    int m = 1;
    ATermAppl c;
   
    if( ATermUtils.isMin( term ) ) {
      c = (ATermAppl) term.getArgument( 2 );
      m = ((ATermInt) term.getArgument( 1 )).getInt();
    }
    else {
      c = ATermUtils.negate( (ATermAppl) term.getArgument( 1 ) );
    }

    if( t.isDatatypeRole() )
      return true;

    Role invT = t.getInverse();        
   
    if( cxt.isRSuccessor( invT )
      && cxt.blocked.getParent().hasType( c ) )
      return true;
   
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
public class Block2 implements BlockingCondition {
  public boolean isBlocked(BlockingContext cxt) {
    for (ATermAppl av : cxt.blocker.getTypes(Node.ALL)) {
      ATerm p = av.getArgument(0);
      ATermAppl c = (ATermAppl) av.getArgument(1);
      Role s = cxt.blocked.getABox().getRole(p);

      if (p instanceof ATermList) {
        ATermList chain = (ATermList) p;

        if (!isBlockedByChain(cxt, chain, c))
          return false;
      }
      else if (s.isDatatypeRole()) {
        continue;
      }
      else {
        Role invS = s.getInverse();

        if (cxt.isRSuccessor(invS) && !cxt.blocked.getParent().hasType(c))
          return false;

        if (!s.isSimple()) {
View Full Code Here
56
57
58
59
60
61
62
63
64
65
    return true;
  }

  protected boolean isBlockedByChain(BlockingContext cxt, ATermList chain, ATermAppl c) {
    Role firstRole = cxt.blocked.getABox().getRole(chain.getFirst());

    return !cxt.getIncomingRoles().contains(firstRole.getInverse())
           && cxt.blocked.getParent().hasType(ATermUtils.makeAllValues(chain.getNext(), c));
  }
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
  }

  private void collectComplexPropertyValues(Individual subj) {
    Set<Role> collected = new HashSet<Role>();
    for( Edge edge : subj.getOutEdges() ) {
      Role role = edge.getRole();
     
      // only collect non-simple, i.e. complex, roles
      // TODO we might not need to collect all non-simple roles
      // collecting only the base ones, i.e. minimal w.r.t. role
      // ordering, would be enough
      if( role.isSimple() || !collected.add( role ) )
        continue;
     
      collected.add( role );
     
      collectComplexPropertyValues( subj, role );
    }
   
    for( Edge edge : subj.getInEdges() ) {
      Role role = edge.getRole().getInverse();
     
      if( role.isSimple() || !collected.add( role ) )
        continue;

      collectComplexPropertyValues( subj, role );
    }
  }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
        Map<Node,DependencySet> mergedNodes = neighbor.getAllMerged();
          DependencySet edgeDepends = edge.getDepends();
          for( Entry<Node,DependencySet> entry : mergedNodes.entrySet() ) {
            Node mergedNode = entry.getKey();
            if( mergedNode.isRootNominal() && !mergedNode.equals( neighbor ) ) {
              Role r = edge.getRole();
              ATermAppl n = mergedNode.getName();
              DependencySet ds = edgeDepends.union( entry.getValue(), false ).cache();
              Edge e = out
                ? new CachedOutEdge( r, n, ds )
                : new CachedInEdge( r, n, ds );
View Full Code Here
141
142
143
144
145
146
147
148
   
    OWLObjectProperty prop = getNamedProperty( ope );
    simpleProperties.add( prop );

    prop.accept( this );
    Role role = kb.getRBox().getRole( term );
    role.setForceSimple( true );
  }
View Full Code Here
158
159
160
161
162
163
164
165
166
      Set<OWLObjectPropertyAxiom> axioms = entry.getValue();
      for( OWLObjectPropertyAxiom axiom : axioms )
        addUnsupportedAxiom( axiom );

      ATermAppl name = ATermUtils.makeTermAppl( nonSimpleProperty.getIRI().toString() );
      Role role = kb.getRBox().getRole( name );
      role.removeSubRoleChains();
    }
  }
View Full Code Here
784
785
786
787
788
789
790
791
792
793
794
795
        if( !isSomeValues( term ) )
          continue;
       
        ATermAppl p = (ATermAppl) term.getArgument( 0 );
       
        Role role = kb.getRole( p );
        if( role == null || role.hasComplexSubRole() )
          continue;
       
        ATermAppl disjunction = disjunction( terms );
        kb.addDomain( p, disjunction, explanation );
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.Role

  • aterm.ATermList
  • com.clarkparsia.pellet.el.RoleChainCache
  • com.clarkparsia.pellet.el.SimplifiedELClassifier
  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker$Visitor
  • com.clarkparsia.pellet.owlapiv3.PelletVisitor
  • com.clarkparsia.pellet.rules.ContinuousRulesStrategy
  • com.clarkparsia.pellet.rules.rete.AlphaEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork$AlphaNodeCreator
  • com.clarkparsia.pellet.rules.rete.Compiler
    • 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.