org.semanticweb.HermiT.hierarchy.QuasiOrderClassificationForRoles 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_conceptsForRoles;
protected final Map m_rolesForConcepts;
/**
* @param tableau tableau
* @param progressMonitor progressMonitor
* @param topElement topElement
* @param bottomElement bottomElement
* @param elements elements
* @param hasInverses hasInverses
* @param conceptsForRoles conceptsForRoles
* @param rolesForConcepts rolesForConcepts
*/
public QuasiOrderClassificationForRoles(Tableau tableau,ClassificationProgressMonitor progressMonitor,AtomicConcept topElement,AtomicConcept bottomElement,Set elements,boolean hasInverses,Map conceptsForRoles,Map rolesForConcepts) {
super(tableau,progressMonitor,topElement,bottomElement,elements);
m_hasInverses=hasInverses;
m_conceptsForRoles=conceptsForRoles;
m_rolesForConcepts=rolesForConcepts;
}
@Override
protected void initialiseKnownSubsumptionsUsingToldSubsumers(Collection dlClauses) {
for (DLClause dlClause : dlClauses) {
if (dlClause.getHeadLength()==1 && dlClause.getBodyLength()==1) {
DLPredicate headPredicate=dlClause.getHeadAtom(0).getDLPredicate();
DLPredicate bodyPredicate=dlClause.getBodyAtom(0).getDLPredicate();
if (headPredicate instanceof AtomicRole && m_conceptsForRoles.containsKey(headPredicate) && bodyPredicate instanceof AtomicRole && m_conceptsForRoles.containsKey(bodyPredicate)) {
AtomicRole headRole=(AtomicRole)headPredicate;
AtomicRole bodyRole=(AtomicRole)bodyPredicate;
AtomicConcept conceptForHeadRole=m_conceptsForRoles.get(headRole);
AtomicConcept conceptForBodyRole=m_conceptsForRoles.get(bodyRole);
assert conceptForBodyRole!=null;
assert conceptForHeadRole!=null;
if (dlClause.getBodyAtom(0).getArgument(0)!=dlClause.getHeadAtom(0).getArgument(0)) {
// r -> s^- and r^- -> s
AtomicConcept conceptForBodyInvRole=m_conceptsForRoles.get(bodyRole.getInverse());
addKnownSubsumption(conceptForBodyInvRole,conceptForHeadRole);
}
else {
// r-> s and r^- -> s^-
addKnownSubsumption(conceptForBodyRole,conceptForHeadRole);
}
}
}
}
}
@Override
protected void addKnownSubsumption(AtomicConcept subConcept,AtomicConcept superConcept) {
super.addKnownSubsumption(subConcept,superConcept);
if (m_hasInverses) {
AtomicConcept subConceptForInverse=m_conceptsForRoles.get((m_rolesForConcepts.get(subConcept)).getInverse());
AtomicConcept superConceptForInverse=m_conceptsForRoles.get((m_rolesForConcepts.get(superConcept)).getInverse());
super.addKnownSubsumption(subConceptForInverse,superConceptForInverse);
}
}
@Override
protected void addPossibleSubsumption(AtomicConcept subConcept,AtomicConcept superConcept) {
super.addPossibleSubsumption(subConcept,superConcept);
if (m_hasInverses) {
AtomicConcept subConceptForInverse=m_conceptsForRoles.get((m_rolesForConcepts.get(subConcept)).getInverse());
AtomicConcept superConceptForInverse=m_conceptsForRoles.get((m_rolesForConcepts.get(superConcept)).getInverse());
super.addPossibleSubsumption(subConceptForInverse,superConceptForInverse);
}
}
@Override
protected ReasoningTaskDescription getSatTestDescription(AtomicConcept atomicConcept) {
return ReasoningTaskDescription.isRoleSatisfiable(m_rolesForConcepts.get(atomicConcept),true);
}
@Override
protected ReasoningTaskDescription getSubsumptionTestDescription(AtomicConcept subConcept,AtomicConcept superConcept) {
return ReasoningTaskDescription.isRoleSubsumedBy(m_rolesForConcepts.get(subConcept),m_rolesForConcepts.get(superConcept),true);
}
@Override
protected ReasoningTaskDescription getSubsumedByListTestDescription(AtomicConcept subConcept,Object[] superconcepts) {
Object[] roles=new Object[superconcepts.length];
for (int i=0;i