org.semanticweb.HermiT.existentials.AbstractExpansionStrategy 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_processedExistentials;
protected final List m_auxiliaryNodes1;
protected final List m_auxiliaryNodes2;
protected Tableau m_tableau;
protected InterruptFlag m_interruptFlag;
protected ExtensionManager m_extensionManager;
protected ExtensionTable.Retrieval m_ternaryExtensionTableSearch01Bound;
protected ExtensionTable.Retrieval m_ternaryExtensionTableSearch02Bound;
protected ExistentialExpansionManager m_existentialExpansionManager;
protected DescriptionGraphManager m_descriptionGraphManager;
/**
* @param blockingStrategy blockingStrategy
* @param expandNodeAtATime expandNodeAtATime
*/
public AbstractExpansionStrategy(BlockingStrategy blockingStrategy,boolean expandNodeAtATime) {
m_blockingStrategy=blockingStrategy;
m_expandNodeAtATime=expandNodeAtATime;
m_processedExistentials=new ArrayList<>();
m_auxiliaryNodes1=new ArrayList<>();
m_auxiliaryNodes2=new ArrayList<>();
}
@Override
public void initialize(Tableau tableau) {
m_tableau=tableau;
m_interruptFlag=m_tableau.getInterruptFlag();
m_extensionManager=m_tableau.getExtensionManager();
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_existentialExpansionManager=m_tableau.getExistentialExpansionManager();
m_descriptionGraphManager=m_tableau.getDescriptionGraphManager();
m_blockingStrategy.initialize(m_tableau);
}
@Override
public void additionalDLOntologySet(DLOntology additionalDLOntology) {
m_blockingStrategy.additionalDLOntologySet(additionalDLOntology);
}
@Override
public void additionalDLOntologyCleared() {
m_blockingStrategy.additionalDLOntologyCleared();
}
@Override
public void clear() {
m_blockingStrategy.clear();
m_processedExistentials.clear();
m_ternaryExtensionTableSearch01Bound.clear();
m_ternaryExtensionTableSearch02Bound.clear();
}
@Override
public boolean expandExistentials(boolean finalChance) {
TableauMonitor monitor=m_tableau.getTableauMonitor();
m_blockingStrategy.computeBlocking(finalChance);
boolean extensionsChanged=false;
Node node=m_tableau.getFirstTableauNode();
while (node!=null && (!extensionsChanged || !m_expandNodeAtATime)) {
if (node.isActive() && !node.isBlocked() && node.hasUnprocessedExistentials()) {
// The node's set of unprocessed existentials may be changed during operation, so make a local copy to loop over.
m_processedExistentials.clear();
m_processedExistentials.addAll(node.getUnprocessedExistentials());
for (int index=m_processedExistentials.size()-1;index>=0;index--) {
ExistentialConcept existentialConcept=m_processedExistentials.get(index);
if (existentialConcept instanceof AtLeast) {
AtLeast atLeast=(AtLeast)existentialConcept;
switch (isSatisfied(atLeast,node)) {
case NOT_SATISFIED:
expandExistential(atLeast,node);
extensionsChanged=true;
break;
case PERMANENTLY_SATISFIED: // not satisfied by a nominal so that the NN/NI rule can break the existential
m_existentialExpansionManager.markExistentialProcessed(existentialConcept,node);
if (monitor!=null)
monitor.existentialSatisfied(existentialConcept,node);
break;
case CURRENTLY_SATISFIED: // satisfied until the NN/NI rule is applied and after which the existential might no longer be satisfied
// do nothing
if (monitor!=null)
monitor.existentialSatisfied(existentialConcept,node);
break;
default:
break;
}
}
else if (existentialConcept instanceof ExistsDescriptionGraph) {
ExistsDescriptionGraph existsDescriptionGraph=(ExistsDescriptionGraph)existentialConcept;
if (!m_descriptionGraphManager.isSatisfied(existsDescriptionGraph,node)) {
m_descriptionGraphManager.expand(existsDescriptionGraph,node);
extensionsChanged=true;
}
else {
if (monitor!=null)
monitor.existentialSatisfied(existsDescriptionGraph,node);
}
m_existentialExpansionManager.markExistentialProcessed(existentialConcept,node);
}
else
throw new IllegalStateException("Unsupported type of existential.");
m_interruptFlag.checkInterrupt();
}
}
node=node.getNextTableauNode();
m_interruptFlag.checkInterrupt();
}
return extensionsChanged;
}
@Override
public void assertionAdded(Concept concept,Node node,boolean isCore) {
m_blockingStrategy.assertionAdded(concept,node,isCore);
}
@Override
public void assertionCoreSet(Concept concept,Node node) {
m_blockingStrategy.assertionCoreSet(concept,node);
}
@Override
public void assertionRemoved(Concept concept,Node node,boolean isCore) {
m_blockingStrategy.assertionRemoved(concept,node,isCore);
}
@Override
public void assertionAdded(DataRange range,Node node,boolean isCore) {
m_blockingStrategy.assertionAdded(range,node,isCore);
}
@Override
public void assertionCoreSet(DataRange range,Node node) {
m_blockingStrategy.assertionCoreSet(range,node);
}
@Override
public void assertionRemoved(DataRange range,Node node,boolean isCore) {
m_blockingStrategy.assertionRemoved(range,node,isCore);
}
@Override
public void assertionAdded(AtomicRole atomicRole,Node nodeFrom,Node nodeTo,boolean isCore) {
m_blockingStrategy.assertionAdded(atomicRole,nodeFrom,nodeTo,isCore);
}
@Override
public void assertionCoreSet(AtomicRole atomicRole,Node nodeFrom,Node nodeTo) {
m_blockingStrategy.assertionCoreSet(atomicRole,nodeFrom,nodeTo);
}
@Override
public void assertionRemoved(AtomicRole atomicRole,Node nodeFrom,Node nodeTo,boolean isCore) {
m_blockingStrategy.assertionRemoved(atomicRole,nodeFrom,nodeTo,isCore);
}
@Override
public void nodesMerged(Node mergeFrom,Node mergeInto) {
m_blockingStrategy.nodesMerged(mergeFrom,mergeInto);
}
@Override
public void nodesUnmerged(Node mergeFrom,Node mergeInto) {
m_blockingStrategy.nodesUnmerged(mergeFrom,mergeInto);
}
@Override
public void nodeStatusChanged(Node node) {
m_blockingStrategy.nodeStatusChanged(node);
}
@Override
public void nodeInitialized(Node node) {
m_blockingStrategy.nodeInitialized(node);
}
@Override
public void nodeDestroyed(Node node) {
m_blockingStrategy.nodeDestroyed(node);
}
@Override
public void branchingPointPushed() {
}
@Override
public void backtrack() {
}
@Override
public void modelFound() {
m_blockingStrategy.modelFound();
}
@Override
public boolean isExact() {
return m_blockingStrategy.isExact();
}
@Override
public void dlClauseBodyCompiled(List workers,DLClause dlClause,List variables,Object[] valuesBuffer,boolean[] coreVariables) {
m_blockingStrategy.dlClauseBodyCompiled(workers,dlClause,variables,valuesBuffer,coreVariables);
}
protected SatType isSatisfied(AtLeast atLeast,Node forNode) {
int cardinality=atLeast.getNumber();
if (cardinality<=0)
return SatType.PERMANENTLY_SATISFIED;
Role onRole=atLeast.getOnRole();
ExtensionTable.Retrieval retrieval;
int toNodeIndex;
if (onRole instanceof AtomicRole) {
retrieval=m_ternaryExtensionTableSearch01Bound;
retrieval.getBindingsBuffer()[0]=onRole;
retrieval.getBindingsBuffer()[1]=forNode;
toNodeIndex=2;
}
else {
retrieval=m_ternaryExtensionTableSearch02Bound;
retrieval.getBindingsBuffer()[0]=((InverseRole)onRole).getInverseOf();
retrieval.getBindingsBuffer()[2]=forNode;
toNodeIndex=1;
}
if (cardinality==1) {
retrieval.open();
Object[] tupleBuffer=retrieval.getTupleBuffer();
while (!retrieval.afterLast()) {
Node toNode=(Node)tupleBuffer[toNodeIndex];
if (atLeast instanceof AtLeastDataRange) {
LiteralDataRange toDataRange=((AtLeastDataRange)atLeast).getToDataRange();
if (m_extensionManager.containsDataRangeAssertion(toDataRange,toNode)) {
if (isPermanentSatisfier(forNode,toNode) && m_blockingStrategy.isPermanentAssertion(toDataRange,toNode))
return SatType.PERMANENTLY_SATISFIED;
else
return SatType.CURRENTLY_SATISFIED;
}
}
else {
LiteralConcept toConcept=((AtLeastConcept)atLeast).getToConcept();
if ((!toNode.isBlocked() || forNode.isParentOf(toNode)) && m_extensionManager.containsConceptAssertion(toConcept,toNode)) {
if (isPermanentSatisfier(forNode,toNode) && m_blockingStrategy.isPermanentAssertion(toConcept,toNode))
return SatType.PERMANENTLY_SATISFIED;
else
return SatType.CURRENTLY_SATISFIED;
}
}
retrieval.next();
}
return SatType.NOT_SATISFIED;
}
else {
m_auxiliaryNodes1.clear();
retrieval.open();
Object[] tupleBuffer=retrieval.getTupleBuffer();
boolean allSatisfiersArePermanent=true;
while (!retrieval.afterLast()) {
Node toNode=(Node)tupleBuffer[toNodeIndex];
if (atLeast instanceof AtLeastDataRange) {
LiteralDataRange toDataRange=((AtLeastDataRange)atLeast).getToDataRange();
if (m_extensionManager.containsDataRangeAssertion(toDataRange,toNode)) {
if (!isPermanentSatisfier(forNode,toNode) || !m_blockingStrategy.isPermanentAssertion(toDataRange,toNode))
allSatisfiersArePermanent=false;
m_auxiliaryNodes1.add(toNode);
}
}
else {
LiteralConcept toConcept=((AtLeastConcept)atLeast).getToConcept();
if ((!toNode.isBlocked() || forNode.isParentOf(toNode)) && m_extensionManager.containsConceptAssertion(toConcept,toNode)) {
if (!isPermanentSatisfier(forNode,toNode) || !m_blockingStrategy.isPermanentAssertion(toConcept,toNode))
allSatisfiersArePermanent=false;
m_auxiliaryNodes1.add(toNode);
}
}
retrieval.next();
}
if (m_auxiliaryNodes1.size()>=cardinality) {
m_auxiliaryNodes2.clear();
if (containsSubsetOfNUnequalNodes(forNode,m_auxiliaryNodes1,0,m_auxiliaryNodes2,cardinality))
return allSatisfiersArePermanent ? SatType.PERMANENTLY_SATISFIED : SatType.CURRENTLY_SATISFIED;
}
return SatType.NOT_SATISFIED;
}
}
protected boolean isPermanentSatisfier(Node forNode,Node toNode) {
return forNode==toNode || forNode.getParent()==toNode || toNode.getParent()==forNode || toNode.isRootNode();
}
protected boolean containsSubsetOfNUnequalNodes(Node forNode,List nodes,int startAt,List selectedNodes,int cardinality) {
if (selectedNodes.size()==cardinality)
return true;
else {
outer: for (int index=startAt;index