All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.semanticweb.HermiT.hierarchy.RoleElementManager Maven / Gradle / Ivy

Go to download

HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more. This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers. The version number of this package is a composite of the HermiT version and an value representing releases of this packaged version. So, 1.3.7.1 is the first release of the mavenized version of HermiT based on the 1.3.7 release of HermiT. This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.

There is a newer version: 1.3.8.4
Show newest version
/* Copyright 2008, 2009, 2010 by the Oxford University Computing Laboratory

   This file is part of HermiT.

   HermiT is free software: you can redistribute it and/or modify
   it under the terms of the GNU Lesser General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   HermiT is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License
   along with HermiT.  If not, see .
 */

package org.semanticweb.HermiT.hierarchy;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

import org.semanticweb.HermiT.model.AtomicRole;
import org.semanticweb.HermiT.model.Individual;

public class RoleElementManager {
    
    public static final String LB=System.getProperty("line.separator");
    
    protected final Map m_roleToElement;

    
    protected RoleElementManager() {
        m_roleToElement=new HashMap();
    }
    public RoleElement getRoleElement(AtomicRole role) {
        if (m_roleToElement.containsKey(role)) 
            return m_roleToElement.get(role);
        else {
            RoleElement element=new RoleElement(role);
            m_roleToElement.put(role, element);
            return element;
        }
    }
    public String toString() {
        StringBuffer buffer=new StringBuffer();
        for (AtomicRole role : m_roleToElement.keySet()) {
            buffer.append(role);
            buffer.append(" -> ");
            buffer.append(m_roleToElement.get(role).toString());
            buffer.append(LB);
        }
        return buffer.toString();
    }
    
    public class RoleElement {
        protected final AtomicRole m_role;
        protected Map> m_knownRelations;
        protected Map> m_possibleRelations;
        
        protected RoleElement(AtomicRole role) {
            m_role=role;
            m_knownRelations=new HashMap>();
            m_possibleRelations=new HashMap>();
        }
        public AtomicRole getRole() {
            return m_role;
        }
        public boolean isKnown(Individual individual1, Individual individual2) {
            return m_knownRelations.containsKey(individual1) && m_knownRelations.get(individual1).contains(individual2);
        }
        public boolean isPossible(Individual individual1, Individual individual2) {
            return m_possibleRelations.containsKey(individual1) && m_possibleRelations.get(individual1).contains(individual2);
        }
        public Map> getKnownRelations() {
            return m_knownRelations;
        }
        public Map> getPossibleRelations() {
            return m_possibleRelations;
        }
        public boolean hasPossibles() {
            return !m_possibleRelations.isEmpty();
        }
        public void setToKnown(Individual individual1, Individual individual2) {
            Set successors=m_possibleRelations.get(individual1);
            successors.remove(individual2);
            if (successors.isEmpty())
                m_possibleRelations.remove(individual1);
            addKnown(individual1, individual2);
        }
        public boolean addKnown(Individual individual1, Individual individual2) {
            Set successors=m_knownRelations.get(individual1);
            if (successors==null) {
                successors=new HashSet();
                m_knownRelations.put(individual1, successors);
            }
            return successors.add(individual2);
        }
        public boolean addKnowns(Individual individual, Set individuals) {
            Set successors=m_knownRelations.get(individual);
            if (successors==null) {
                successors=new HashSet();
                m_knownRelations.put(individual, successors);
            }
            return successors.addAll(individuals);
        }
        public boolean removeKnown(Individual individual1, Individual individual2) {
            Set successors=m_knownRelations.get(individual1);
            boolean removed=false;
            if (successors!=null) {
                removed=successors.remove(individual2);
                if (successors.isEmpty())
                    m_knownRelations.remove(individual1);
            }
            return removed;
        }
        public boolean addPossible(Individual individual1, Individual individual2) {
            Set successors=m_possibleRelations.get(individual1);
            if (successors==null) {
                successors=new HashSet();
                m_possibleRelations.put(individual1, successors);
            }
            return successors.add(individual2);
        }
        public boolean removePossible(Individual individual1, Individual individual2) {
            Set successors=m_possibleRelations.get(individual1);
            boolean removed=false;
            if (successors!=null) {
                removed=successors.remove(individual2);
                if (successors.isEmpty())
                    m_possibleRelations.remove(individual1);
            }
            return removed;
        }
        public boolean addPossibles(Individual individual, Set individuals) {
            Set successors=m_possibleRelations.get(individual);
            if (successors==null) {
                successors=new HashSet();
                m_possibleRelations.put(individual, successors);
            }
            return successors.addAll(individuals);
        }
        public String toString() {
            StringBuffer buffer=new StringBuffer();
            buffer.append(m_role);
            buffer.append(" (known instances: ");
            boolean notfirst=false;
            for (Individual individual : m_knownRelations.keySet()) {
                for (Individual successor : m_knownRelations.get(individual)) {
                    if (notfirst) { 
                        buffer.append(", ");
                        notfirst=true;
                    }
                    buffer.append("(");
                    buffer.append(individual.toString());
                    buffer.append(", ");
                    buffer.append(successor.toString());
                    buffer.append(")");
                }
            }
            buffer.append(" | possible instances: ");
            notfirst=false;
            for (Individual individual : m_possibleRelations.keySet()) {
                for (Individual successor : m_possibleRelations.get(individual)) {
                    if (notfirst) { 
                        buffer.append(", ");
                        notfirst=true;
                    }
                    buffer.append("(");
                    buffer.append(individual.toString());
                    buffer.append(", ");
                    buffer.append(successor.toString());
                    buffer.append(")");
                }
            }
            buffer.append(") ");
            return buffer.toString();
        }
    }
}





© 2015 - 2025 Weber Informatics LLC | Privacy Policy