org.semanticweb.HermiT.hierarchy.RoleElementManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of org.semanticweb.hermit Show documentation
Show all versions of org.semanticweb.hermit Show documentation
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 a value representing the OWLAPI release it is compatible with. Note that the group id for the upstream HermiT is com.hermit-reasoner, while this fork is released under net.sourceforge.owlapi.
This fork exists to allow HermiT users to use newer OWLAPI versions than the ones supported by the original HermiT codebase.
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.
The 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 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;
}
}
@Override
public String toString() {
StringBuilder buffer=new StringBuilder();
for (Map.Entry e : m_roleToElement.entrySet()) {
buffer.append(e.getKey()).append(" -> ").append(e.getValue()).append('\n');
}
return buffer.toString();
}
public class RoleElement {
protected final AtomicRole m_role;
protected final Map> m_knownRelations;
protected final 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);
}
@Override
public String toString() {
StringBuilder buffer=new StringBuilder(m_role.toString()).append(" (known instances: ");
int initialSize=buffer.length();
m_knownRelations.forEach((i, set)->set.forEach(s->{
if(initialSize!=buffer.length())
buffer.append(", ");
buffer.append("(").append(i).append(", ").append(s).append(")");
}));
buffer.append(" | possible instances: ");
int initialSize1=buffer.length();
m_possibleRelations.forEach((i, set)->set.forEach(s->{
if(initialSize1!=buffer.length())
buffer.append(", ");
buffer.append("(").append(i).append(", ").append(s).append(")");
}));
buffer.append(") ");
return buffer.toString();
}
}
}