Menu
▾
▴
[DL-Learner SVN] SF.net SVN: dl-learner:[1604] trunk/src/dl-learner/org/dllearner
|
From: <jen...@us...> - 2009-02-13 17:10:53
|
Revision: 1604
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=1604&view=rev
Author: jenslehmann
Date: 2009-02-13 17:10:49 +0000 (Fri, 13 Feb 2009)
Log Message:
-----------
fast retrieval algorithm started
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refinement2/ExampleBasedNode.java
trunk/src/dl-learner/org/dllearner/core/configurators/FastInstanceCheckerConfigurator.java
trunk/src/dl-learner/org/dllearner/reasoning/FastInstanceChecker.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refinement2/ExampleBasedNode.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refinement2/ExampleBasedNode.java 2009-02-13 11:44:38 UTC (rev 1603)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refinement2/ExampleBasedNode.java 2009-02-13 17:10:49 UTC (rev 1604)
@@ -49,6 +49,8 @@
// example based variables
private Set<Individual> coveredPositives;
private Set<Individual> coveredNegatives;
+// private int coveredPositiveSize;
+// private int coveredNegativeSize;
// the method by which quality was evaluated in this node
public enum QualityEvaluationMethod { START, REASONER, TOO_WEAK_LIST, OVERLY_GENERAL_LIST };
Modified: trunk/src/dl-learner/org/dllearner/core/configurators/FastInstanceCheckerConfigurator.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/configurators/FastInstanceCheckerConfigurator.java 2009-02-13 11:44:38 UTC (rev 1603)
+++ trunk/src/dl-learner/org/dllearner/core/configurators/FastInstanceCheckerConfigurator.java 2009-02-13 17:10:49 UTC (rev 1604)
@@ -70,6 +70,15 @@
public boolean getDefaultNegation() {
return (Boolean) ComponentManager.getInstance().getConfigOptionValue(fastInstanceChecker, "defaultNegation") ;
}
+/**
+* forallRetrievalSemantics This option controls how to interpret the all quantifier in orall r.C. The standard option isto return all those which do not have an r-filler not in C. The domain semantics is to use thosewhich are in the domain of r and do not have an r-filler not in C. The forallExists semantics is touse those which have at least one r-filler and do not have an r-filler not in C..
+* mandatory: false| reinit necessary: true
+* default value: forallExists
+* @return String
+**/
+public String getForallRetrievalSemantics() {
+return (String) ComponentManager.getInstance().getConfigOptionValue(fastInstanceChecker, "forallRetrievalSemantics") ;
+}
/**
* @param reasonerType FaCT++ or Pellet to dematerialize.
@@ -89,6 +98,15 @@
ComponentManager.getInstance().applyConfigEntry(fastInstanceChecker, "defaultNegation", defaultNegation);
reinitNecessary = true;
}
+/**
+* @param forallRetrievalSemantics This option controls how to interpret the all quantifier in orall r.C. The standard option isto return all those which do not have an r-filler not in C. The domain semantics is to use thosewhich are in the domain of r and do not have an r-filler not in C. The forallExists semantics is touse those which have at least one r-filler and do not have an r-filler not in C..
+* mandatory: false| reinit necessary: true
+* default value: forallExists
+**/
+public void setForallRetrievalSemantics(String forallRetrievalSemantics) {
+ComponentManager.getInstance().applyConfigEntry(fastInstanceChecker, "forallRetrievalSemantics", forallRetrievalSemantics);
+reinitNecessary = true;
+}
/**
* true, if this component needs reinitializsation.
Modified: trunk/src/dl-learner/org/dllearner/reasoning/FastInstanceChecker.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/reasoning/FastInstanceChecker.java 2009-02-13 11:44:38 UTC (rev 1603)
+++ trunk/src/dl-learner/org/dllearner/reasoning/FastInstanceChecker.java 2009-02-13 17:10:49 UTC (rev 1604)
@@ -28,6 +28,7 @@
import java.util.SortedSet;
import java.util.TreeMap;
import java.util.TreeSet;
+import java.util.Map.Entry;
import org.apache.log4j.Logger;
import org.dllearner.core.ComponentInitException;
@@ -82,7 +83,10 @@
* object creation, which makes it extremely fast compared to standard
* reasoners.
*
- * Note: This algorithm works only on concepts in negation normal form!
+ * Meanwhile, the algorithm has been extended to also perform fast retrieval
+ * operations. However, those need write access to memory and potentially have
+ * to deal with all individuals in a knowledge base. For many knowledge bases,
+ * they should still be reasonably fast.
*
* @author Jens Lehmann
*
@@ -149,6 +153,15 @@
// http://owlapi.svn.sourceforge.net/viewvc/owlapi/owl1_1/trunk/tutorial/src/main/java/uk/ac/manchester/owl/tutorial/examples/ClosureAxiomsExample.java?view=markup
options.add(type);
options.add(new BooleanConfigOption("defaultNegation", "Whether to use default negation, i.e. an instance not being in a class means that it is in the negation of the class.", true, false, true));
+ StringConfigOption forallSemantics = new StringConfigOption("forallRetrievalSemantics",
+ "This option controls how to interpret the all quantifier in \forall r.C. The standard option is" +
+ "to return all those which do not have an r-filler not in C. The domain semantics is to use those" +
+ "which are in the domain of r and do not have an r-filler not in C. The forallExists semantics is to" +
+ "use those which have at least one r-filler and do not have an r-filler not in C.", "forallExists");
+ forallSemantics.setAllowedValues(new String[] { "standard", "domain", "forallExists" });
+ // closure option? see:
+ // http://owlapi.svn.sourceforge.net/viewvc/owlapi/owl1_1/trunk/tutorial/src/main/java/uk/ac/manchester/owl/tutorial/examples/ClosureAxiomsExample.java?view=markup
+ options.add(forallSemantics);
return options;
}
@@ -482,22 +495,111 @@
}
@Override
- public SortedSet<Individual> getIndividualsImpl(Description concept)
+ public SortedSet<Individual> getIndividualsImpl(Description description)
throws ReasoningMethodUnsupportedException {
- if (concept instanceof NamedClass) {
- return classInstancesPos.get((NamedClass) concept);
- } else if (concept instanceof Negation && concept.getChild(0) instanceof NamedClass) {
- return classInstancesNeg.get((NamedClass) concept.getChild(0));
+ // policy: returned sets are clones, i.e. can be modified
+ // (of course we only have to clone the leafs of a class description tree)
+ if (description instanceof NamedClass) {
+ return new TreeSet<Individual>(classInstancesPos.get((NamedClass) description));
+ } else if (description instanceof Negation && description.getChild(0) instanceof NamedClass) {
+ return new TreeSet<Individual>(classInstancesNeg.get((NamedClass) description.getChild(0)));
+ } else if (description instanceof Thing) {
+ return new TreeSet<Individual>(individuals);
+ } else if (description instanceof Nothing) {
+ return new TreeSet<Individual>();
+ } else if (description instanceof Union) {
+ // copy instances of first element and then subtract all others
+ SortedSet<Individual> ret = getIndividualsImpl(description.getChild(0));
+ int childNr = 0;
+ for(Description child : description.getChildren()) {
+ if(childNr != 0) {
+ ret.addAll(getIndividualsImpl(child));
+ }
+ childNr++;
+ }
+ return ret;
+ } else if (description instanceof Intersection) {
+ // copy instances of first element and then subtract all others
+ SortedSet<Individual> ret = getIndividualsImpl(description.getChild(0));
+ int childNr = 0;
+ for(Description child : description.getChildren()) {
+ if(childNr != 0) {
+ ret.retainAll(getIndividualsImpl(child));
+ }
+ childNr++;
+ }
+ return ret;
+ } else if (description instanceof ObjectSomeRestriction) {
+ SortedSet<Individual> targetSet = getIndividualsImpl(description.getChild(0));
+ SortedSet<Individual> returnSet = new TreeSet<Individual>();
+
+ ObjectPropertyExpression ope = ((ObjectSomeRestriction) description).getRole();
+ if (!(ope instanceof ObjectProperty)) {
+ throw new ReasoningMethodUnsupportedException("Instance check for description "
+ + description + " unsupported. Inverse object properties not supported.");
+ }
+ ObjectProperty op = (ObjectProperty) ope;
+ Map<Individual, SortedSet<Individual>> mapping = opPos.get(op);
+
+ // each individual is connected to a set of individuals via the property;
+ // we loop through the complete mapping
+ for(Entry<Individual, SortedSet<Individual>> entry : mapping.entrySet()) {
+ SortedSet<Individual> inds = entry.getValue();
+ for(Individual ind : inds) {
+ if(targetSet.contains(ind)) {
+ returnSet.add(ind);
+ // once we found an individual, we do not need to check the others
+ continue;
+ }
+ }
+ }
+ } else if (description instanceof ObjectAllRestriction) {
+ // \forall restrictions are difficult to handle; assume we want to check
+ // \forall hasChild.male with domain(hasChild)=Person; then for all non-persons
+ // this is satisfied trivially (all of their non-existing children are male)
+ if(!configurator.getForallRetrievalSemantics().equals("forallExists")) {
+ throw new Error("Only forallExists semantics currently implemented.");
+ }
+
+ // problem: we need to make sure that \neg \exists r.\top \equiv \forall r.\bot
+ // can still be reached in an algorithm (\forall r.\bot \equiv \bot under forallExists
+ // semantics)
+
+ SortedSet<Individual> targetSet = getIndividualsImpl(description.getChild(0));
+
+ ObjectPropertyExpression ope = ((ObjectAllRestriction) description).getRole();
+ if (!(ope instanceof ObjectProperty)) {
+ throw new ReasoningMethodUnsupportedException("Instance check for description "
+ + description + " unsupported. Inverse object properties not supported.");
+ }
+ ObjectProperty op = (ObjectProperty) ope;
+ Map<Individual, SortedSet<Individual>> mapping = opPos.get(op);
+ SortedSet<Individual> returnSet = new TreeSet<Individual>(mapping.keySet());
+
+ // each individual is connected to a set of individuals via the property;
+ // we loop through the complete mapping
+ for(Entry<Individual, SortedSet<Individual>> entry : mapping.entrySet()) {
+ SortedSet<Individual> inds = entry.getValue();
+ for(Individual ind : inds) {
+ if(!targetSet.contains(ind)) {
+ returnSet.remove(ind);
+ continue;
+ }
+ }
+ }
}
-
+
+ throw new ReasoningMethodUnsupportedException("Retrieval for description "
+ + description + " unsupported.");
+
// return rs.retrieval(concept);
- SortedSet<Individual> inds = new TreeSet<Individual>();
- for (Individual i : individuals) {
- if (hasType(concept, i)) {
- inds.add(i);
- }
- }
- return inds;
+// SortedSet<Individual> inds = new TreeSet<Individual>();
+// for (Individual i : individuals) {
+// if (hasType(concept, i)) {
+// inds.add(i);
+// }
+// }
+// return inds;
}
/*
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
