org.semanticweb.HermiT.tableau.ExistentialExpansionManager 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_auxiliaryNodes;
protected final ExtensionTable.Retrieval m_ternaryExtensionTableSearch01Bound;
protected final ExtensionTable.Retrieval m_ternaryExtensionTableSearch02Bound;
protected final Map m_functionalRoles;
protected final UnionDependencySet m_binaryUnionDependencySet;
protected int[] m_indicesByBranchingPoint;
/**
* @param tableau tableau
*/
public ExistentialExpansionManager(Tableau tableau) {
m_tableau=tableau;
m_extensionManager=m_tableau.m_extensionManager;
m_expandedExistentials=new TupleTable(2);
m_auxiliaryTuple=new Object[2];
m_auxiliaryNodes=new ArrayList<>();
m_ternaryExtensionTableSearch01Bound=m_extensionManager.getTernaryExtensionTable().createRetrieval(new boolean[] { true,true,false },ExtensionTable.View.TOTAL);
m_ternaryExtensionTableSearch02Bound=m_extensionManager.getTernaryExtensionTable().createRetrieval(new boolean[] { true,false,true },ExtensionTable.View.TOTAL);
m_functionalRoles=new HashMap<>();
updateFunctionalRoles();
m_binaryUnionDependencySet=new UnionDependencySet(2);
m_indicesByBranchingPoint=new int[2];
}
protected void updateFunctionalRoles() {
Graph superRoleGraph=new Graph<>();
Set functionalRoles=new HashSet<>();
loadDLClausesIntoGraph(m_tableau.m_permanentDLOntology.getDLClauses(),superRoleGraph,functionalRoles);
for (Role role : superRoleGraph.getElements()) {
superRoleGraph.addEdge(role,role);
superRoleGraph.addEdge(role.getInverse(),role.getInverse());
}
superRoleGraph.transitivelyClose();
Graph subRoleGraph=superRoleGraph.getInverse();
m_functionalRoles.clear();
for (Role role : superRoleGraph.getElements()) {
Set relevantRoles=new HashSet<>();
Set allSuperroles=superRoleGraph.getSuccessors(role);
for (Role superrole : allSuperroles)
if (functionalRoles.contains(superrole))
relevantRoles.addAll(subRoleGraph.getSuccessors(superrole));
if (!relevantRoles.isEmpty()) {
Role[] relevantRolesArray=new Role[relevantRoles.size()];
relevantRoles.toArray(relevantRolesArray);
m_functionalRoles.put(role,relevantRolesArray);
}
}
}
protected static void loadDLClausesIntoGraph(Collection dlClauses,Graph superRoleGraph,Set functionalRoles) {
for (DLClause dlClause : dlClauses) {
if (dlClause.isAtomicRoleInclusion()) {
AtomicRole subrole=(AtomicRole)dlClause.getBodyAtom(0).getDLPredicate();
AtomicRole superrole=(AtomicRole)dlClause.getHeadAtom(0).getDLPredicate();
superRoleGraph.addEdge(subrole,superrole);
superRoleGraph.addEdge(subrole.getInverse(),superrole.getInverse());
}
else if (dlClause.isAtomicRoleInverseInclusion()) {
AtomicRole subrole=(AtomicRole)dlClause.getBodyAtom(0).getDLPredicate();
AtomicRole superrole=(AtomicRole)dlClause.getHeadAtom(0).getDLPredicate();
superRoleGraph.addEdge(subrole,superrole.getInverse());
superRoleGraph.addEdge(subrole.getInverse(),superrole);
}
else if (dlClause.isFunctionalityAxiom()) {
AtomicRole atomicRole=(AtomicRole)dlClause.getBodyAtom(0).getDLPredicate();
functionalRoles.add(atomicRole);
}
else if (dlClause.isInverseFunctionalityAxiom()) {
AtomicRole atomicRole=(AtomicRole)dlClause.getBodyAtom(0).getDLPredicate();
functionalRoles.add(atomicRole.getInverse());
}
}
}
/**
* @param existentialConcept existentialConcept
* @param forNode forNode
*/
public void markExistentialProcessed(ExistentialConcept existentialConcept,Node forNode) {
m_auxiliaryTuple[0]=existentialConcept;
m_auxiliaryTuple[1]=forNode;
m_expandedExistentials.addTuple(m_auxiliaryTuple);
forNode.removeFromUnprocessedExistentials(existentialConcept);
}
/**
* Branching point pushed.
*/
public void branchingPointPushed() {
int start=m_tableau.getCurrentBranchingPoint().m_level;
int requiredSize=start+1;
if (requiredSize>m_indicesByBranchingPoint.length) {
int newSize=m_indicesByBranchingPoint.length*3/2;
while (requiredSize>newSize)
newSize=newSize*3/2;
int[] newIndicesByBranchingPoint=new int[newSize];
System.arraycopy(m_indicesByBranchingPoint,0,newIndicesByBranchingPoint,0,m_indicesByBranchingPoint.length);
m_indicesByBranchingPoint=newIndicesByBranchingPoint;
}
m_indicesByBranchingPoint[start]=m_expandedExistentials.getFirstFreeTupleIndex();
}
/**
* Backtrack.
*/
public void backtrack() {
int newFirstFreeTupleIndex=m_indicesByBranchingPoint[m_tableau.getCurrentBranchingPoint().m_level];
for (int tupleIndex=m_expandedExistentials.getFirstFreeTupleIndex()-1;tupleIndex>=newFirstFreeTupleIndex;--tupleIndex) {
m_expandedExistentials.retrieveTuple(m_auxiliaryTuple,tupleIndex);
ExistentialConcept existentialConcept=(ExistentialConcept)m_auxiliaryTuple[0];
Node forNode=(Node)m_auxiliaryTuple[1];
forNode.addToUnprocessedExistentials(existentialConcept);
}
m_expandedExistentials.truncate(newFirstFreeTupleIndex);
}
/**
* Clear.
*/
public void clear() {
m_expandedExistentials.clear();
m_auxiliaryTuple[0]=null;
m_auxiliaryTuple[1]=null;
m_ternaryExtensionTableSearch01Bound.clear();
m_ternaryExtensionTableSearch02Bound.clear();
m_binaryUnionDependencySet.m_dependencySets[0]=null;
m_binaryUnionDependencySet.m_dependencySets[1]=null;
}
/**
* Creates a new node in the tableau if the at least concept that caused the expansion is for cardinality 1. If it is not of cardinality 1 and the role in the at least concept is a functional role, it sets a clash in the extension manager.
* @param atLeast atLeast
* @param forNode forNode
*
* @return true if the at least cardinality is 1 (causes an expansion) or it is greater than one but the role is functional (causes a clash) and false otherwise.
*/
public boolean tryFunctionalExpansion(AtLeast atLeast,Node forNode) {
if (atLeast.getNumber()==1) {
if (getFunctionalExpansionNode(atLeast.getOnRole(),forNode,m_auxiliaryTuple)) {
if (m_tableau.m_tableauMonitor!=null)
m_tableau.m_tableauMonitor.existentialExpansionStarted(atLeast,forNode);
Node functionalityNode=(Node)m_auxiliaryTuple[0];
m_binaryUnionDependencySet.m_dependencySets[0]=m_extensionManager.getConceptAssertionDependencySet(atLeast,forNode);
m_binaryUnionDependencySet.m_dependencySets[1]=(DependencySet)m_auxiliaryTuple[1];
m_extensionManager.addRoleAssertion(atLeast.getOnRole(),forNode,functionalityNode,m_binaryUnionDependencySet,true);
if (atLeast instanceof AtLeastConcept)
m_extensionManager.addConceptAssertion(((AtLeastConcept)atLeast).getToConcept(),functionalityNode,m_binaryUnionDependencySet,true);
else
m_extensionManager.addDataRangeAssertion(((AtLeastDataRange)atLeast).getToDataRange(),functionalityNode,m_binaryUnionDependencySet,true);
if (m_tableau.m_tableauMonitor!=null)
m_tableau.m_tableauMonitor.existentialExpansionFinished(atLeast,forNode);
return true;
}
}
else if (atLeast.getNumber()>1 && m_functionalRoles.containsKey(atLeast.getOnRole())) {
if (m_tableau.m_tableauMonitor!=null)
m_tableau.m_tableauMonitor.existentialExpansionStarted(atLeast,forNode);
DependencySet existentialDependencySet=m_extensionManager.getConceptAssertionDependencySet(atLeast,forNode);
m_extensionManager.setClash(existentialDependencySet);
if (m_tableau.m_tableauMonitor!=null)
m_tableau.m_tableauMonitor.existentialExpansionFinished(atLeast,forNode);
return true;
}
return false;
}
protected boolean getFunctionalExpansionNode(Role role,Node forNode,Object[] result) {
Role[] relevantRoles=m_functionalRoles.get(role);
if (relevantRoles!=null) {
for (Role relevantRole : relevantRoles) {
ExtensionTable.Retrieval retrieval;
int toNodeIndex;
if (relevantRole instanceof AtomicRole) {
retrieval=m_ternaryExtensionTableSearch01Bound;
retrieval.getBindingsBuffer()[0]=relevantRole;
retrieval.getBindingsBuffer()[1]=forNode;
toNodeIndex=2;
}
else {
retrieval=m_ternaryExtensionTableSearch02Bound;
retrieval.getBindingsBuffer()[0]=((InverseRole)relevantRole).getInverseOf();
retrieval.getBindingsBuffer()[2]=forNode;
toNodeIndex=1;
}
retrieval.open();
if (!retrieval.afterLast()) {
result[0]=retrieval.getTupleBuffer()[toNodeIndex];
result[1]=retrieval.getDependencySet();
return true;
}
}
}
return false;
}
/**
* @param atLeastConcept atLeastConcept
* @param forNode forNode
*/
public void doNormalExpansion(AtLeastConcept atLeastConcept,Node forNode) {
if (m_tableau.m_tableauMonitor!=null)
m_tableau.m_tableauMonitor.existentialExpansionStarted(atLeastConcept,forNode);
DependencySet existentialDependencySet=m_extensionManager.getConceptAssertionDependencySet(atLeastConcept,forNode);
int cardinality=atLeastConcept.getNumber();
if (cardinality==1) {
Node newNode=m_tableau.createNewTreeNode(existentialDependencySet,forNode);
m_extensionManager.addRoleAssertion(atLeastConcept.getOnRole(),forNode,newNode,existentialDependencySet,true);
m_extensionManager.addConceptAssertion(atLeastConcept.getToConcept(),newNode,existentialDependencySet,true);
}
else {
m_auxiliaryNodes.clear();
for (int index=0;index