QTL experiments.

components-core/src/main/java/org/dllearner/algorithms/qtl/QTL2Disjunctive.java

@@ -460,7 +460,7 @@ private EvaluatedRDFResourceTree computeBestPartialSolution(){
 				((LGGGeneratorSimple)lggGenerator).setTimeout(getRemainingPartialSolutionTime(), TimeUnit.SECONDS);
 				RDFResourceTree lgg = lggGenerator.getLGG(currentTree, uncoveredTree);
 				MonitorFactory.getTimeMonitor("lgg").stop();
-				System.out.println("COMPLETE:" + ((LGGGeneratorSimple)lggGenerator).isComplete());
+//				System.out.println("COMPLETE:" + ((LGGGeneratorSimple)lggGenerator).isComplete());
 //				logger.info("LGG: "  + lgg.getStringRepresentation());
 
 				// redundancy check
@@ -1071,15 +1071,6 @@ public void setNoise(double noise) {
 		this.noise = noise;
 	}
 
-	/**
-	 * @param maxExecutionTimeInSeconds the maximum execution time in seconds until the
-	 * algorithm will terminate gracefully
-	 */
-	@Override
-	public void setMaxExecutionTimeInSeconds(int maxExecutionTimeInSeconds) {
-		this.maxExecutionTimeInSeconds = maxExecutionTimeInSeconds;
-	}
-
 	/**
 	 * Default value is 1. Lower values force importance of covering positive examples.
 	 * @param beta the beta to set
@@ -1089,7 +1080,10 @@ public void setBeta(double beta) {
 	}
 
 	/**
-	 * @param maxTreeComputationTimeInSeconds the maxTreeComputationTimeInSeconds to set
+	 * Set the max. execution time for the computation of a partial solution. If this value isn't set, the
+	 * max. algorithm runtime will be used, thus, in worst case only one partial solution was computed.
+	 *
+	 * @param maxTreeComputationTimeInSeconds the max. computation for a partial solution tree
 	 */
 	public void setMaxTreeComputationTimeInSeconds(double maxTreeComputationTimeInSeconds) {
 		this.maxTreeComputationTimeInSeconds = maxTreeComputationTimeInSeconds;
@@ -1174,7 +1168,7 @@ public void setMaxTreeDepth(int maxTreeDepth) {
 	}
 
 	/**
-	 * @return the runtime until the best solution was found
+	 * @return the runtime in ms until the best solution was found
 	 */
 	public long getTimeBestSolutionFound() {
 		return timeBestSolutionFound;