[DL-Learner SVN] SF.net SVN: dl-learner: [836] trunk/src/dl-learner/org/dllearner

[<ku...@us...>]

Revision: 836
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=836&view=rev
Author:   kurzum
Date:     2008-05-13 08:55:28 -0700 (Tue, 13 May 2008)

Log Message:
-----------
moved most special comparator to function printbestsolutions

Modified Paths:
--------------
    trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
    trunk/src/dl-learner/org/dllearner/kb/sparql/configuration/SparqlEndpoint.java

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-05-13 14:17:32 UTC (rev 835)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-05-13 15:55:28 UTC (rev 836)
@@ -456,16 +456,7 @@
 			logger.debug(manchester);
 			logger.debug(KBSyntax);
 			
-			boolean showOrderedSolutions = true;
 			
-			if(showOrderedSolutions) {
-				System.out.println("ordered by generality (most special solutions first):");
-				SubsumptionComparator sc = new SubsumptionComparator(rs);
-				TreeSet<Description> solutionsOrderedBySubsumption = new TreeSet<Description>(sc);
-				solutionsOrderedBySubsumption.addAll(solutions);
-				for(Description d : solutionsOrderedBySubsumption)
-					System.out.println(d);
-			}
 		}
 		
 		logger.debug("size of candidate set: " + candidates.size());
@@ -1076,11 +1067,22 @@
 			nrOfSolutions=candidatesStable.size();
 		int i=0;
 		for(ExampleBasedNode n : candidatesStable.descendingSet()) {
-			logger.trace(n.getShortDescription(nrOfPositiveExamples, nrOfNegativeExamples, baseURI));
+			logger.trace("best: "+n.getShortDescription(nrOfPositiveExamples, nrOfNegativeExamples, baseURI));
 			if(i==nrOfSolutions)
 				return ;
 			i++;
 		}
+		
+		boolean showOrderedSolutions = true;
+		
+		if(showOrderedSolutions) {
+			logger.trace("ordered by generality (most special solutions first):");
+			SubsumptionComparator sc = new SubsumptionComparator(rs);
+			TreeSet<Description> solutionsOrderedBySubsumption = new TreeSet<Description>(sc);
+			solutionsOrderedBySubsumption.addAll(solutions);
+			for(Description d : solutionsOrderedBySubsumption)
+				logger.trace("special: "+d);
+		}
 		/*for (int j = 0; j < solutions.size(); j++) {
 			Description d = solutions.get(j);
 			logger.trace(d.toString());

Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/configuration/SparqlEndpoint.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/configuration/SparqlEndpoint.java	2008-05-13 14:17:32 UTC (rev 835)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/configuration/SparqlEndpoint.java	2008-05-13 15:55:28 UTC (rev 836)
@@ -276,7 +276,7 @@
 	 public static SparqlEndpoint EndpointMusicbrainz() {
 		 URL u = null;
 		 try { 
-			 u = new URL(" http://dbtune.org/musicbrainz/sparql");
+			 u = new URL("http://dbtune.org/musicbrainz/sparql");
 		 } catch (Exception e) {
 			 e.printStackTrace();
 		 }
@@ -287,7 +287,7 @@
 	 public static SparqlEndpoint EndpointUSCensus() {
 		 URL u = null;
 		 try { 
-			 u = new URL(" http://www.rdfabout.com/sparql");
+			 u = new URL("http://www.rdfabout.com/sparql");
 		 } catch (Exception e) {
 			 e.printStackTrace();
 		 }


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.