Examples of au.csiro.snorocket.core.util.IConceptSet

au.csiro.snorocket.core.util.IConceptSet

     * (non-Javadoc)
     * 
     * @see au.csiro.snorocket.Subsumptions#get(int)
     */
    IConceptSet get(int concept) {
        IConceptSet subsumes = set.get(concept);


        if (null == subsumes) {
            // A Concept always subsumes itself and TOP
            subsumes = new SparseConceptSet();
            subsumes.add(concept);
            subsumes.add(IFactory.TOP_CONCEPT);
            set.put(concept, subsumes);
            size++;
        }


        return subsumes;

View Full Code Here

    int keyCount() {
        return size;
    }


    void put(int child, int parent) {
        IConceptSet subsumes = set.get(child);


        if (null == subsumes) {
            subsumes = new SparseConceptSet();
            set.put(child, subsumes);
            size++;
            // A Concept always subsumes itself and TOP
            subsumes.add(child);
            subsumes.add(IFactory.TOP_CONCEPT);
        }


        subsumes.add(parent);
    }

View Full Code Here

        final Context ctx = contextIndex.get(key);
        CR succ = ctx.getSucc();
        
        for(int roleId : succ.getRoles()) {
            NamedRole role = new NamedRole(factory.lookupRoleId(roleId).toString());
            IConceptSet values = getLeaves(succ.lookupConcept(roleId));
            for (IntIterator itr2 = values.iterator(); itr2.hasNext(); ) {
                int valueInt = itr2.next();
                if (!factory.isVirtualConcept(valueInt)) {
                    final String valueId = factory.lookupConceptId(valueInt).toString();
                    result.add(new Existential(role, new NamedConcept(valueId)));
                } else {

View Full Code Here

     *
     * @param concepts set of subsumptions to filter
     * @return
     */
    private IConceptSet getLeaves(final IConceptSet concepts) {
        final IConceptSet leafBs = IConceptSet.FACTORY.createConceptSet(concepts);
        final IConceptSet set = IConceptSet.FACTORY.createConceptSet(leafBs);


        for (final IntIterator bItr = set.iterator(); bItr.hasNext(); ) {
            final int b = bItr.next();


            final IConceptSet ancestors = IConceptSet.FACTORY.createConceptSet(getAncestors(no, b));
            ancestors.remove(b);
            leafBs.removeAll(ancestors);
        }
        return leafBs;
    }

View Full Code Here

                return;
            }
            if (log.isTraceEnabled()) log.trace("check for subsumption: " + role + "." + concept);


            final int cInt = factory.getConcept(((NamedConcept) concept).getId());
            final IConceptSet cAncestorSet = getAncestors(no, cInt);
            final int rInt = factory.getRole(role.getId());
            final RoleSet rSet = rc.get(rInt);


            final List<Existential> remove = new ArrayList<Existential>();
            boolean subsumed = false;


            for (Existential candidate: items) {
                final Concept value = candidate.getConcept();
                if (!(value instanceof NamedConcept)) {
                    log.debug("WARNING: pass through of nested complex value: " + value);
                    continue;
                }


                final int dInt = factory.getConcept(((NamedConcept) value).getId());
                final IConceptSet dAncestorSet = getAncestors(no, dInt);
                final int sInt = factory.getRole(((NamedRole) candidate.getRole()).getId());
                final RoleSet sSet = rc.get(sInt);


                if (rInt == sInt && cInt == dInt) {
                    subsumed = true;
                } else {
                    if (rSet.contains(sInt)) {
                        if (cAncestorSet.contains(dInt)) {
                            remove.add(candidate);
                            if (log.isTraceEnabled()) log.trace("\tremove " + candidate);
                        }
                    }


                    if (sSet.contains(rInt)) {
                        if (dAncestorSet.contains(cInt)) {
                            subsumed = true;
                            if (log.isTraceEnabled()) log.trace("\tsubsumed");
                        }
                    }
                }

View Full Code Here

        // Get all the subsumptions a [ x
        for (final IntIterator aItr = subsumptions.keyIterator(); aItr
                .hasNext();) {
            final int a = aItr.next();


            final IConceptSet Sa = subsumptions.get(a);


            for (final IntIterator xItr = Sa.iterator(); xItr.hasNext();) {
                final int x = xItr.next();


                // If any of the new axioms is of the form x [ y then add
                // an entry
                if (deltaNF1.containsKey(x)) {

View Full Code Here


        for (final IntIterator aItr = subsumptions.keyIterator(); aItr.hasNext();) {
            final int a = aItr.next();
            Context ctx = contextIndex.get(a);


            final IConceptSet Sa = subsumptions.get(a);


            for (final IntIterator xItr = Sa.iterator(); xItr.hasNext();) {
                final int x = xItr.next();


                if (deltaNF2.containsKey(x)) {
                    final IMonotonicCollection<NF2> set = deltaNF2.get(x);
                    for (NF2 entry : set) {

View Full Code Here

                        final int a = aItr.next();
                        boolean addIt = false;


                        // Get all of a's successors with role r
                        Context aCtx = contextIndex.get(a);
                        IConceptSet cs = aCtx.getSucc().lookupConcept(r);
                        for (final IntIterator bItr = cs.iterator(); bItr
                                .hasNext();) {
                            final int b = bItr.next();


                            if (subsumptions.get(b).contains(x)) {
                                addIt = true;

View Full Code Here

            for (final IntIterator aItr = subsumptions.keyIterator(); aItr
                    .hasNext();) {
                final int a = aItr.next();


                Context aCtx = contextIndex.get(a);
                IConceptSet cs = aCtx.getSucc().lookupConcept(nf4.getR());


                for (final IntIterator bItr = cs.iterator(); bItr.hasNext();) {
                    final int b = bItr.next();


                    IRoleQueueEntry entry = new IRoleQueueEntry() {
                        /**
                         * Serialisation version.

View Full Code Here


    public String toString() {
        final StringBuilder sb = new StringBuilder();


        for (int index = 0; index < data.length; index++) {
            IConceptSet cs = data[index];
            if (null != cs) {
                sb.append(index + "." + cs.toString());
            }
        }


        return sb.toString();
    }

View Full Code Here

0 1 2 3 4

TOP

Related Classes of au.csiro.snorocket.core.util.IConceptSet

au.csiro.snorocket.core.concurrent.Context

au.csiro.snorocket.core.concurrent.CR

au.csiro.snorocket.core.concurrent.TaxonomyWorker1

au.csiro.snorocket.core.concurrent.TaxonomyWorker2

au.csiro.snorocket.core.NormalisedOntology

au.csiro.snorocket.core.R1

au.csiro.snorocket.core.S

au.csiro.snorocket.core.SnorocketReasoner

au.csiro.snorocket.core.SnorocketReasoner$Builder

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.