You can subscribe to this list here.
2007 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(120) |
Sep
(36) |
Oct
(116) |
Nov
(17) |
Dec
(44) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2008 |
Jan
(143) |
Feb
(192) |
Mar
(74) |
Apr
(84) |
May
(105) |
Jun
(64) |
Jul
(49) |
Aug
(120) |
Sep
(159) |
Oct
(156) |
Nov
(51) |
Dec
(28) |
2009 |
Jan
(17) |
Feb
(55) |
Mar
(33) |
Apr
(57) |
May
(54) |
Jun
(28) |
Jul
(6) |
Aug
(16) |
Sep
(38) |
Oct
(30) |
Nov
(26) |
Dec
(52) |
2010 |
Jan
(7) |
Feb
(91) |
Mar
(65) |
Apr
(2) |
May
(14) |
Jun
(25) |
Jul
(38) |
Aug
(48) |
Sep
(80) |
Oct
(70) |
Nov
(75) |
Dec
(77) |
2011 |
Jan
(68) |
Feb
(53) |
Mar
(51) |
Apr
(35) |
May
(65) |
Jun
(101) |
Jul
(29) |
Aug
(230) |
Sep
(95) |
Oct
(49) |
Nov
(110) |
Dec
(63) |
2012 |
Jan
(41) |
Feb
(42) |
Mar
(25) |
Apr
(46) |
May
(51) |
Jun
(44) |
Jul
(45) |
Aug
(29) |
Sep
(12) |
Oct
(9) |
Nov
(17) |
Dec
(2) |
2013 |
Jan
(12) |
Feb
(14) |
Mar
(7) |
Apr
(16) |
May
(54) |
Jun
(27) |
Jul
(11) |
Aug
(5) |
Sep
(85) |
Oct
(27) |
Nov
(37) |
Dec
(32) |
2014 |
Jan
(8) |
Feb
(29) |
Mar
(5) |
Apr
(3) |
May
(22) |
Jun
(3) |
Jul
(4) |
Aug
(3) |
Sep
|
Oct
|
Nov
|
Dec
|
From: <jen...@us...> - 2008-02-15 16:52:09
|
Revision: 577 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=577&view=rev Author: jenslehmann Date: 2008-02-15 08:18:52 -0800 (Fri, 15 Feb 2008) Log Message: ----------- - added php-examples directory, which should contain simple examples of web service interface usage - created small Utilities class (partially from old LearnerClient file) - added reasoning example Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/server/DLLearnerWS.java Added Paths: ----------- trunk/src/php-examples/ trunk/src/php-examples/Reasoning.php trunk/src/php-examples/Utilities.php Modified: trunk/src/dl-learner/org/dllearner/server/DLLearnerWS.java =================================================================== --- trunk/src/dl-learner/org/dllearner/server/DLLearnerWS.java 2008-02-15 12:44:08 UTC (rev 576) +++ trunk/src/dl-learner/org/dllearner/server/DLLearnerWS.java 2008-02-15 16:18:52 UTC (rev 577) @@ -35,6 +35,10 @@ import javax.jws.soap.SOAPBinding; import org.dllearner.Info; +import org.dllearner.algorithms.BruteForceLearner; +import org.dllearner.algorithms.RandomGuesser; +import org.dllearner.algorithms.gp.GP; +import org.dllearner.algorithms.refexamples.ExampleBasedROLComponent; import org.dllearner.algorithms.refinement.ROLearner; import org.dllearner.core.Component; import org.dllearner.core.ComponentManager; @@ -57,6 +61,7 @@ import org.dllearner.parser.KBParser; import org.dllearner.parser.ParseException; import org.dllearner.reasoning.DIGReasoner; +import org.dllearner.reasoning.OWLAPIReasoner; import org.dllearner.utilities.Datastructures; import org.dllearner.utilities.Helper; @@ -87,10 +92,15 @@ knowledgeSourceMapping.put("owlfile", OWLFile.class); knowledgeSourceMapping.put("sparql", SparqlKnowledgeSource.class); reasonerMapping.put("dig", DIGReasoner.class); + reasonerMapping.put("owlapi", OWLAPIReasoner.class); learningProblemMapping.put("posNegDefinition", PosNegDefinitionLP.class); learningProblemMapping.put("posNegInclusion", PosNegInclusionLP.class); learningProblemMapping.put("posOnlyDefinition", PosOnlyDefinitionLP.class); - learningAlgorithmMapping.put("refinement", ROLearner.class); + learningAlgorithmMapping.put("random", RandomGuesser.class); + learningAlgorithmMapping.put("bruteForce", BruteForceLearner.class); + learningAlgorithmMapping.put("genetic", ROLearner.class); + learningAlgorithmMapping.put("refinement", GP.class); + learningAlgorithmMapping.put("refexamples", ExampleBasedROLComponent.class); components = Helper.union(knowledgeSourceMapping.keySet(),reasonerMapping.keySet()); components = Helper.union(components, learningProblemMapping.keySet()); components = Helper.union(components, learningAlgorithmMapping.keySet()); Added: trunk/src/php-examples/Reasoning.php =================================================================== --- trunk/src/php-examples/Reasoning.php (rev 0) +++ trunk/src/php-examples/Reasoning.php 2008-02-15 16:18:52 UTC (rev 577) @@ -0,0 +1,59 @@ +<?php +/** + * Copyright (C) 2007-2008, Jens Lehmann + * + * This file is part of DL-Learner. + * + * DL-Learner is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 3 of the License, or + * (at your option) any later version. + * + * DL-Learner 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 General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + * + */ + + /** + * Small example showing how to use DL-Learner for reasoning. + * + * @author Jens Lehmann + */ + +include('Utilities.php'); + +// load WSDL files (has to be done due to a Java web service bug) +ini_set("soap.wsdl_cache_enabled","0"); +$wsdluri="http://localhost:8181/services?wsdl"; +Utilities::loadWSDLfiles($wsdluri); + +// specifiy ontology +$ontology = 'file:'.realpath("../../examples/family/father.owl"); + +// create DL-Learner client +$client = new SoapClient("main.wsdl"); + +// load owl file in DIG reasoner (you need a running DIG reasoner) +$id = $client->generateID(); +$ksID = $client->addKnowledgeSource($id, "owlfile", $ontology); +$client->init($id, $ksID); +$rID = $client->setReasoner($id, "dig"); +$client->init($id, $rID); + +// create a concept in internal DL-Learner syntax +// ( = all female persons having at least one child) +$concept = '"http://example.com/father#female" AND EXISTS "http://example.com/father#hasChild".TOP'; +$instances = $client->retrieval($id, $concept); + +// print instances +echo 'instances of ' . $concept . ': <br />'; +echo '<pre>'; +print_r($instances->item); +echo '</pre>'; + +?> \ No newline at end of file Added: trunk/src/php-examples/Utilities.php =================================================================== --- trunk/src/php-examples/Utilities.php (rev 0) +++ trunk/src/php-examples/Utilities.php 2008-02-15 16:18:52 UTC (rev 577) @@ -0,0 +1,167 @@ +<?php +/** + * Copyright (C) 2007-2008, Jens Lehmann + * + * This file is part of DL-Learner. + * + * DL-Learner is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 3 of the License, or + * (at your option) any later version. + * + * DL-Learner 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 General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + * + */ + +// Pear HTTP_Request class required +include ('HTTP/Request.php'); + +/** + * Collection of static utility functions. + * + * @author Jens Lehmann + * @author Sebastian Hellmann + */ + +class Utilities { + + /** + * Loads WSDL and imported XSD files from web service and stores them + * locally. + */ + public static function loadWSDLfiles($wsdluri) { + $main = self :: getRequest($wsdluri); + $other = self :: getXSDImports($main); + $newMain = self :: changeXSDImports($main); + self :: writeToFile("main.wsdl", $newMain); + $x = 0; + foreach ($other as $o) { + self :: writeToFile("def" . ($x++) . ".xsd", self :: getRequest($o)); + } + } + + /** + * Change XSD imports in WSDL file to point to local imports. + */ + public static function changeXSDImports($wsdlFileContent) { + $before = "<xsd:import schemaLocation=\""; + $after = "\" namespace=\""; + $newWSDL = ""; + $desca = "def"; + $descb = ".xsd"; + $x = 0; + while ($posstart = strpos($wsdlFileContent, $before)) { + $posstart += strlen($before); + $newWSDL .= substr($wsdlFileContent, 0, $posstart); + $wsdlFileContent = substr($wsdlFileContent, $posstart); + $newWSDL .= $desca . ($x++) . $descb; + $posend = strpos($wsdlFileContent, $after); + $wsdlFileContent = substr($wsdlFileContent, $posend); + } + return $newWSDL . $wsdlFileContent; + } + + /** + * Extracts XSD imports from WSDL file. + */ + public static function getXSDImports($wsdlFileContent) { + $before = "<xsd:import schemaLocation=\""; + $after = "\" namespace=\""; + $ret = array (); + while ($posstart = strpos($wsdlFileContent, $before)) { + $posstart += strlen($before); + $wsdlFileContent = substr($wsdlFileContent, $posstart); + $posend = strpos($wsdlFileContent, $after); + $tmp = substr($wsdlFileContent, 0, $posend); + $ret[] = $tmp; + $wsdlFileContent = substr($wsdlFileContent, $posend +strlen($after)); + } + return $ret; + } + + /** + * Peforms a GET request and returns body of result. + */ + public static function getRequest($uri) { + $req = & new HTTP_Request($uri); + $req->setMethod(HTTP_REQUEST_METHOD_GET); + $req->sendRequest(); + $ret = $req->getResponseBody(); + return $ret; + } + + /** + * Writes $content to file $filename. + */ + public static function writeToFile($filename, $content) { + $fp = fopen($filename, "w"); + fwrite($fp, $content); + fclose($fp); + } + + /** + * Prints a list of all Web Service components and their configuration options. + */ + public static function printWebserviceComponents($client) { + echo '<h1>Web Service Information</h1>'; + + echo '<h2>Knowledge Sources</h2>'; + Utilities :: printComponentsInfo($client, $client->getKnowledgeSources()->item); + + echo '<h2>Reasoners</h2>'; + Utilities :: printComponentsInfo($client, $client->getReasoners()->item); + + echo '<h2>Learning Problems</h2>'; + Utilities :: printComponentsInfo($client, $client->getLearningProblems()->item); + + echo '<h2>Learning Algorithms</h2>'; + Utilities :: printComponentsInfo($client, $client->getLearningAlgorithms()->item); + } + + /** + * Print information about all given components. + */ + public static function printComponentsInfo($client, $components) { + foreach ($components as $component) + Utilities :: printComponentInfo($client, $component); + } + + /** + * Print information about a component. + */ + public static function printComponentInfo($client, $component) { + echo '<h3>component: ' . $component . '</h3>'; + + $options = $client->getConfigOptions($component, true)->item; + if (!is_array($options)) + $options = array ( + $options + ); + + foreach ($options as $option) + Utilities :: printOption($option); + } + + /** + * Prints information about an option. + * + * @param String Option as returned by the DL-Learner web service + * getConfigOption() method. + */ + public static function printOption($option) { + $parts = split('#', $option); + echo 'option name: <b>' . $parts[0] . '</b><br />'; + echo 'option description: ' . $parts[1] . '<br />'; + echo 'option class: ' . $parts[2] . '<br />'; + if ($parts[3] != 'null') + echo 'option name: ' . $parts[3] . '<br />'; + echo '<br />'; + } +} +?> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-15 12:44:12
|
Revision: 576 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=576&view=rev Author: tonytacker Date: 2008-02-15 04:44:08 -0800 (Fri, 15 Feb 2008) Log Message: ----------- add isValidValue(value) to all widgets Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-15 12:44:08 UTC (rev 576) @@ -150,16 +150,19 @@ value = true; specialOption = (BooleanConfigOption) config.getComponentManager() .getConfigOption(componentOption, configOption.getName()); - try { - ConfigEntry<Boolean> specialEntry = new ConfigEntry<Boolean>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set Boolean: " + configOption.getName() + " = " - + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<Boolean> specialEntry = new ConfigEntry<Boolean>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set Boolean: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("Boolean: not valid value"); } } Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java 2008-02-15 12:44:08 UTC (rev 576) @@ -146,15 +146,18 @@ value = Double.parseDouble(doubleField.getText()); // get from input specialOption = (DoubleConfigOption) config.getComponentManager() .getConfigOption(componentOption, configOption.getName()); - try { - ConfigEntry<Double> specialEntry = new ConfigEntry<Double>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set Double: " + configOption.getName() + " = " - + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<Double> specialEntry = new ConfigEntry<Double>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set Double: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("Double: not valid value"); } } Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java 2008-02-15 12:44:08 UTC (rev 576) @@ -147,15 +147,18 @@ value = Integer.parseInt(integerField.getText()); // get from input specialOption = (IntegerConfigOption) config.getComponentManager() .getConfigOption(componentOption, configOption.getName()); - try { - ConfigEntry<Integer> specialEntry = new ConfigEntry<Integer>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set Integer: " + configOption.getName() + " = " - + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<Integer> specialEntry = new ConfigEntry<Integer>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set Integer: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("Integer: not valid value"); } } Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java 2008-02-15 12:44:08 UTC (rev 576) @@ -123,7 +123,7 @@ value = (String) config.getComponentManager() .getConfigOptionValue(oldComponent, configOption.getName()); - if (value != null) { + if (value != null) { stringField.setText(value.toString()); setEntry(); } @@ -165,16 +165,19 @@ value = stringField.getText(); // get from input specialOption = (StringConfigOption) config.getComponentManager() .getConfigOption(componentOption, configOption.getName()); - try { - ConfigEntry<String> specialEntry = new ConfigEntry<String>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set String: " + configOption.getName() + " = " - + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<String> specialEntry = new ConfigEntry<String>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set String: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("String: not valid value"); } /* Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java 2008-02-15 12:44:08 UTC (rev 576) @@ -295,18 +295,20 @@ StringSetConfigOption specialOption; specialOption = (StringSetConfigOption) config.getComponentManager() .getConfigOption(componentOption, configOption.getName()); + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<Set<String>> specialEntry = new ConfigEntry<Set<String>>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set StringSet: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("StringSet: not valid value"); - try { - ConfigEntry<Set<String>> specialEntry = new ConfigEntry<Set<String>>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set StringSet: " + configOption.getName() - + " = " + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } - } /** Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java 2008-02-15 10:14:14 UTC (rev 575) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java 2008-02-15 12:44:08 UTC (rev 576) @@ -242,17 +242,19 @@ specialOption = (StringTupleListConfigOption) config .getComponentManager().getConfigOption(componentOption, configOption.getName()); - - try { - ConfigEntry<List<StringTuple>> specialEntry = new ConfigEntry<List<StringTuple>>( - specialOption, value); - config.getComponentManager().applyConfigEntry(component, - specialEntry); - System.out.println("set StringTupleList: " + configOption.getName() - + " = " + value); - } catch (InvalidConfigOptionValueException s) { - s.printStackTrace(); - } + if (specialOption.isValidValue(value)) { + try { + ConfigEntry<List<StringTuple>> specialEntry = new ConfigEntry<List<StringTuple>>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set StringTupleList: " + + configOption.getName() + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } else + System.out.println("StringTupleList: not valid value"); } /** This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <sk...@us...> - 2008-02-15 10:14:25
|
Revision: 575 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=575&view=rev Author: sknappe Date: 2008-02-15 02:14:14 -0800 (Fri, 15 Feb 2008) Log Message: ----------- some changes to concept details Modified Paths: -------------- trunk/src/dbpedia-navigator/DLLearnerConnection.php trunk/src/dbpedia-navigator/ajaxfunctions.php trunk/src/dbpedia-navigator/index.php Modified: trunk/src/dbpedia-navigator/DLLearnerConnection.php =================================================================== --- trunk/src/dbpedia-navigator/DLLearnerConnection.php 2008-02-14 16:47:52 UTC (rev 574) +++ trunk/src/dbpedia-navigator/DLLearnerConnection.php 2008-02-15 10:14:14 UTC (rev 575) @@ -100,6 +100,21 @@ } return $concepts->item; } + + function getConceptDepth() + { + return $this->client->getConceptDepth($this->id,3)->item; + } + + function getConceptArity() + { + return $this->client->getConceptArity($this->id,3)->item; + } + + function getConceptLength($concept) + { + return $this->client->getConceptLength($concept); + } function getTriples($label) { Modified: trunk/src/dbpedia-navigator/ajaxfunctions.php =================================================================== --- trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-14 16:47:52 UTC (rev 574) +++ trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-15 10:14:14 UTC (rev 575) @@ -291,8 +291,19 @@ session_start(); unset($_SESSION['positive'][$subject]); + //add Positives and Negatives to Interests + $posInterests=""; + if (isset($_SESSION['positive'])) foreach($_SESSION['positive'] as $pos){ + $posInterests.=urldecode(substr (strrchr ($pos, "/"), 1))." <a href=\"\" onclick=\"xajax_toNegative('".$pos."');return false;\"><img src=\"".$_GET['path']."images/minus.jpg\" alt=\"Minus\"/></a> <a href=\"\" onclick=\"xajax_removePosInterest('".$pos."');return false;\"><img src=\"".$_GET['path']."images/remove.png\" alt=\"Delete\"/></a><br/>"; + } + $negInterests=""; + if (isset($_SESSION['negative'])) foreach($_SESSION['negative'] as $neg){ + $negInterests.=urldecode(substr (strrchr ($neg, "/"), 1))." <a href=\"\" onclick=\"xajax_toPositive('".$neg."');return false;\"><img src=\"".$_GET['path']."images/plus.jpg\" alt=\"Plus\"/></a> <a href=\"\" onclick=\"xajax_removeNegInterest('".$neg."');return false;\"><img src=\"".$_GET['path']."images/remove.png\" alt=\"Delete\"/></a><br/>"; + } + $objResponse = new xajaxResponse(); - $objResponse->call('xajax_showInterests'); + $objResponse->assign('Positives','innerHTML',$posInterests); + $objResponse->assign('Negatives','innerHTML',$negInterests); return $objResponse; } @@ -303,8 +314,19 @@ session_start(); unset($_SESSION['negative'][$subject]); + //add Positives and Negatives to Interests + $posInterests=""; + if (isset($_SESSION['positive'])) foreach($_SESSION['positive'] as $pos){ + $posInterests.=urldecode(substr (strrchr ($pos, "/"), 1))." <a href=\"\" onclick=\"xajax_toNegative('".$pos."');return false;\"><img src=\"".$_GET['path']."images/minus.jpg\" alt=\"Minus\"/></a> <a href=\"\" onclick=\"xajax_removePosInterest('".$pos."');return false;\"><img src=\"".$_GET['path']."images/remove.png\" alt=\"Delete\"/></a><br/>"; + } + $negInterests=""; + if (isset($_SESSION['negative'])) foreach($_SESSION['negative'] as $neg){ + $negInterests.=urldecode(substr (strrchr ($neg, "/"), 1))." <a href=\"\" onclick=\"xajax_toPositive('".$neg."');return false;\"><img src=\"".$_GET['path']."images/plus.jpg\" alt=\"Plus\"/></a> <a href=\"\" onclick=\"xajax_removeNegInterest('".$neg."');return false;\"><img src=\"".$_GET['path']."images/remove.png\" alt=\"Delete\"/></a><br/>"; + } + $objResponse = new xajaxResponse(); - $objResponse->call('xajax_showInterests'); + $objResponse->assign('Positives','innerHTML',$posInterests); + $objResponse->assign('Negatives','innerHTML',$negInterests); return $objResponse; } @@ -335,14 +357,16 @@ require_once("DLLearnerConnection.php"); $sc=new DLLearnerConnection($id, $ksID); try{ - $concepts=$sc->getConceptFromExamples($posArray,$negArray); + $concepts=$sc->getConceptFromExamples($posArray,$negArray); + $conceptDepth=$sc->getConceptDepth(); + $conceptArity=$sc->getConceptArity(); $concept.="<table border=0>\n"; $i=1; foreach ($concepts as $con){ $concept.="<tr><td><a href=\"\" onclick=\"xajax_getSubjectsFromConcept('".$con."');return false;\" onMouseOver=\"showdiv('div".$i."');showdiv('ConceptBox');\" onMouseOut=\"hidediv('div".$i."');hidediv('ConceptBox');\" />".$con."</a></td></tr>"; //put information about concepts in divs - $conceptinformation.="<div id=\"div".$i."\" style=\"display:none\">".$con."</div>"; + $conceptinformation.="<div id=\"div".$i."\" style=\"display:none\">Concept Depth: ".$conceptDepth[$i-1]."<br/>Concept Arity: ".$conceptArity[$i-1]."<br/>Concept Length: ".$sc->getConceptLength($con)."</div>"; $i++; } $concept.="</table>"; Modified: trunk/src/dbpedia-navigator/index.php =================================================================== --- trunk/src/dbpedia-navigator/index.php 2008-02-14 16:47:52 UTC (rev 574) +++ trunk/src/dbpedia-navigator/index.php 2008-02-15 10:14:14 UTC (rev 575) @@ -206,7 +206,7 @@ </ul> </div> - <div class="box" id="ConceptBox" style="position:absolute;top:0px;right:20px;opacity:0.90;display:none;z-index:5;"> + <div class="box" id="ConceptBox" style="position:absolute;top:15px;right:15px;width:18%;opacity:0.90;display:none;z-index:5;"> <div class="boxtitle">Detailed Concept Information</div> <div class="boxcontent" id="ConceptInformation"></div> </div> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-14 16:47:57
|
Revision: 574 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=574&view=rev Author: tonytacker Date: 2008-02-14 08:47:52 -0800 (Thu, 14 Feb 2008) Log Message: ----------- come more colors for init-buttons Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java trunk/src/dl-learner/org/dllearner/gui/StartGUI.java Modified: trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-14 15:58:45 UTC (rev 573) +++ trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-14 16:47:52 UTC (rev 574) @@ -23,6 +23,7 @@ import java.util.List; import javax.swing.*; import java.awt.BorderLayout; +import java.awt.Color; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import org.dllearner.core.KnowledgeSource; @@ -81,6 +82,7 @@ choosenClassIndex = cb.getSelectedIndex(); setSource(); + updateInitButtonColor(); } public void actionPerformed(ActionEvent e) { @@ -113,15 +115,12 @@ * after this, next tab can be used */ public void init() { - if (/* - * !config.isInitKnowledgeSource() && - */config.getKnowledgeSource() != null && config.getURI() != null) { + if (config.getKnowledgeSource() != null && config.getURI() != null) { config.getKnowledgeSource().init(); config.setInitKnowledgeSource(true); System.out.println("init KnowledgeSource"); startGUI.updateTabColors(); } - // config.autoInit(); } /** @@ -131,4 +130,14 @@ optionPanel.update(config.getKnowledgeSource(), config .getOldKnowledgeSource(), sources.get(choosenClassIndex)); } + + /** + * make init-button red if you have to click + */ + public void updateInitButtonColor() { + if (!config.isInitKnowledgeSource()) { + initButton.setForeground(Color.RED); + } else + initButton.setForeground(Color.BLACK); + } } Modified: trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java 2008-02-14 15:58:45 UTC (rev 573) +++ trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java 2008-02-14 16:47:52 UTC (rev 574) @@ -22,6 +22,7 @@ import javax.swing.*; import java.awt.BorderLayout; +import java.awt.Color; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.util.List; @@ -81,6 +82,7 @@ add(optionPanel, BorderLayout.CENTER); add(initPanel, BorderLayout.PAGE_END); + updateInitButtonColor(); } public void actionPerformed(ActionEvent e) { @@ -103,10 +105,7 @@ * after this, you can change widgets */ public void setLearningAlgorithm() { - // config.autoInit(); - if (/* - * config.isInitLearningProblem() && - */config.getLearningProblem() != null + if (config.getLearningProblem() != null && config.getReasoningService() != null) { config.setLearningAlgorithm(config.getComponentManager() .learningAlgorithm(learners.get(choosenClassIndex), @@ -120,13 +119,13 @@ * after this, next tab can be used */ public void init() { + setLearningAlgorithm(); if (config.getLearningProblem() != null) { config.getLearningAlgorithm().init(); config.setInitLearningAlgorithm(true); System.out.println("init LearningAlgorithm"); startGUI.updateTabColors(); } - // config.autoInit(); } /** @@ -137,4 +136,14 @@ optionPanel.update(config.getLearningAlgorithm(), config .getOldLearningAlgorithm(), learners.get(choosenClassIndex)); } + + /** + * make init-button red if you have to click + */ + public void updateInitButtonColor() { + if (!config.isInitLearningAlgorithm()) { + initButton.setForeground(Color.RED); + } else + initButton.setForeground(Color.BLACK); + } } Modified: trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-14 15:58:45 UTC (rev 573) +++ trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-14 16:47:52 UTC (rev 574) @@ -21,6 +21,7 @@ */ import java.awt.BorderLayout; +import java.awt.Color; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.util.List; @@ -83,6 +84,7 @@ choosenClassIndex = cb.getSelectedIndex(); // setLearningProblem(); + updateInitButtonColor(); } public void actionPerformed(ActionEvent e) { @@ -117,6 +119,7 @@ * after this, next tab can be used */ private void init() { + setLearningProblem(); if (config.getReasoner() != null && config.getLearningProblem() != null) { config.getLearningProblem().init(); config.setInitLearningProblem(true); @@ -133,4 +136,14 @@ optionPanel.update(config.getLearningProblem(), config .getOldLearningProblem(), problems.get(choosenClassIndex)); } + + /** + * make init-button red if you have to click + */ + public void updateInitButtonColor() { + if (!config.isInitLearningProblem()) { + initButton.setForeground(Color.RED); + } else + initButton.setForeground(Color.BLACK); + } } Modified: trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java 2008-02-14 15:58:45 UTC (rev 573) +++ trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java 2008-02-14 16:47:52 UTC (rev 574) @@ -21,6 +21,7 @@ */ import java.awt.BorderLayout; +import java.awt.Color; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.util.List; @@ -45,7 +46,7 @@ private JPanel choosePanel = new JPanel(); private JPanel initPanel = new JPanel(); private OptionPanel optionPanel; - private JButton initButton, autoInitButton; + private JButton initButton, setButton; private String[] cbItems = {}; private JComboBox cb = new JComboBox(cbItems); private int choosenClassIndex; @@ -61,8 +62,8 @@ initButton.addActionListener(this); initPanel.add(initButton); initButton.setEnabled(true); - autoInitButton = new JButton("Set"); - autoInitButton.addActionListener(this); + setButton = new JButton("Set"); + setButton.addActionListener(this); choosePanel.add(cb); @@ -75,7 +76,7 @@ optionPanel = new OptionPanel(config, config.getReasoner(), config .getOldReasonerSet(), reasoners.get(choosenClassIndex)); - choosePanel.add(autoInitButton); + choosePanel.add(setButton); cb.addActionListener(this); add(choosePanel, BorderLayout.PAGE_START); @@ -84,6 +85,7 @@ choosenClassIndex = cb.getSelectedIndex(); setReasoner(); + updateInitButtonColor(); } public void actionPerformed(ActionEvent e) { @@ -95,7 +97,7 @@ setReasoner(); } - if (e.getSource() == autoInitButton) { + if (e.getSource() == setButton) { config.setInitReasoner(false); setReasoner(); } @@ -108,13 +110,14 @@ * after this, you can change widgets */ public void setReasoner() { - // config.autoInit(); if (config.isInitKnowledgeSource()) { config.setReasoner(config.getComponentManager().reasoner( reasoners.get(choosenClassIndex), config.getKnowledgeSource())); updateOptionPanel(); startGUI.updateTabColors(); + config.setInitReasoner(false); + updateInitButtonColor(); } } @@ -122,8 +125,8 @@ * after this, next tab can be used */ public void init() { - if (config.getKnowledgeSource() != null - && config.getReasoner() != null) { + setReasoner(); + if (config.getKnowledgeSource() != null && config.getReasoner() != null) { config.getReasoner().init(); System.out.println("init Reasoner"); // set ReasoningService @@ -132,9 +135,7 @@ System.out.println("init ReasoningService"); config.setInitReasoner(true); startGUI.updateTabColors(); - } - // config.autoInit(); } /** @@ -145,4 +146,13 @@ reasoners.get(choosenClassIndex)); } + /** + * make init-button red if you have to click + */ + public void updateInitButtonColor() { + if (!config.isInitReasoner()) { + initButton.setForeground(Color.RED); + } else + initButton.setForeground(Color.BLACK); + } } Modified: trunk/src/dl-learner/org/dllearner/gui/StartGUI.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/StartGUI.java 2008-02-14 15:58:45 UTC (rev 573) +++ trunk/src/dl-learner/org/dllearner/gui/StartGUI.java 2008-02-14 16:47:52 UTC (rev 574) @@ -138,5 +138,10 @@ tabPane.setForegroundAt(3, Color.RED); tabPane.setForegroundAt(4, Color.RED); } + tab0.updateInitButtonColor(); + tab1.updateInitButtonColor(); + tab2.updateInitButtonColor(); + tab3.updateInitButtonColor(); + } } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-14 15:58:48
|
Revision: 573 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=573&view=rev Author: tonytacker Date: 2008-02-14 07:58:45 -0800 (Thu, 14 Feb 2008) Log Message: ----------- Add 2 buttons in runPanel. Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/RunPanel.java Modified: trunk/src/dl-learner/org/dllearner/gui/RunPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/RunPanel.java 2008-02-14 15:08:47 UTC (rev 572) +++ trunk/src/dl-learner/org/dllearner/gui/RunPanel.java 2008-02-14 15:58:45 UTC (rev 573) @@ -26,8 +26,6 @@ import javax.swing.*; -// import org.dllearner.core.dl.Concept; - /** * RunPanel let algorithm start and stop and show informations about. * @@ -38,17 +36,18 @@ private static final long serialVersionUID = 1643304576470046636L; - private JButton runButton, stopButton, testButton; + private JButton runButton, stopButton, getBestSolutionButton, + getSolutionScoreButton; private JTextArea infoArea; private Config config; private ThreadRun thread; + private Boolean runBoolean = new Boolean(false); private JPanel showPanel = new JPanel(); private JPanel infoPanel = new JPanel(); - private JPanel testPanel = new JPanel(); + private JPanel solutionPanel = new JPanel(); - RunPanel(Config config) { super(new BorderLayout()); @@ -58,41 +57,51 @@ runButton.addActionListener(this); stopButton = new JButton("Stop"); stopButton.addActionListener(this); - testButton = new JButton("TEST"); - testButton.addActionListener(this); + getBestSolutionButton = new JButton("GetBestSolution"); + getBestSolutionButton.addActionListener(this); + + getSolutionScoreButton = new JButton("GetSolutionScore"); + getSolutionScoreButton.addActionListener(this); + infoArea = new JTextArea(20, 50); JScrollPane infoScroll = new JScrollPane(infoArea); showPanel.add(runButton); showPanel.add(stopButton); - showPanel.add(testButton); infoPanel.add(infoScroll); + solutionPanel.add(getBestSolutionButton); + solutionPanel.add(getSolutionScoreButton); + add(showPanel, BorderLayout.PAGE_START); add(infoPanel, BorderLayout.CENTER); - add(testPanel, BorderLayout.PAGE_END); + add(solutionPanel, BorderLayout.PAGE_END); } public void actionPerformed(ActionEvent e) { + // start if (e.getSource() == runButton && config.getLearningAlgorithm() != null) { - //config.autoInit(); thread = new ThreadRun(config); thread.start(); - // Concept solution = - // config.getLearningAlgorithm().getBestSolution(); - // infoArea.setText(solution.toString()); + this.runBoolean = true; } + // stop if (e.getSource() == stopButton && config.getLearningAlgorithm() != null) { - // config.getLearningAlgorithm().stop(); thread.exit(); - } - if (e.getSource() == testButton) { - } - + // getBestSolution + if (e.getSource() == getBestSolutionButton && runBoolean) { + infoArea.setText(config.getLearningAlgorithm().getBestSolution() + .toString()); + } + // getSolutionScore + if (e.getSource() == getSolutionScoreButton && runBoolean) { + infoArea.setText(config.getLearningAlgorithm().getSolutionScore() + .toString()); + } } } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-14 15:08:52
|
Revision: 572 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=572&view=rev Author: tonytacker Date: 2008-02-14 07:08:47 -0800 (Thu, 14 Feb 2008) Log Message: ----------- "Set"-button on top reloads now previous made entry from last component. You can change i.e. KnowledgeSource and can initiate the other tabulators (Reasoner, LerningProblem, LearningAlgorithm) without setting your options again. Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/CheckBoxList.java trunk/src/dl-learner/org/dllearner/gui/Config.java trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java Modified: trunk/src/dl-learner/org/dllearner/gui/CheckBoxList.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/CheckBoxList.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/CheckBoxList.java 2008-02-14 15:08:47 UTC (rev 572) @@ -81,11 +81,11 @@ * Is a Set of Strings. */ public void setSelections(Set<String> selectionSet) { - for (int i = 0; i < list.size(); i++) { + for (int i = 0; i < this.list.size(); i++) { if (selectionSet.contains(list.get(i).getText())) list.get(i).setSelected(true); else - list.get(i).setSelected(false); + this.list.get(i).setSelected(false); } } Modified: trunk/src/dl-learner/org/dllearner/gui/Config.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/Config.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/Config.java 2008-02-14 15:08:47 UTC (rev 572) @@ -20,16 +20,12 @@ * */ -import java.util.HashSet; -import java.util.Set; - import org.dllearner.core.ComponentManager; import org.dllearner.core.KnowledgeSource; import org.dllearner.core.LearningProblem; import org.dllearner.core.ReasoningService; import org.dllearner.core.LearningAlgorithm; import org.dllearner.core.ReasonerComponent; -import org.dllearner.core.Component; /** * Config save all together used variables: ComponentManager, KnowledgeSource, @@ -41,15 +37,15 @@ public class Config { private ComponentManager cm = ComponentManager.getInstance(); private KnowledgeSource source; - private Set<Component> oldKnowledgeSourceSet = new HashSet<Component>(); + private KnowledgeSource oldSource; private String uri; private ReasonerComponent reasoner; - private Set<Component> oldReasonerSet = new HashSet<Component>(); + private ReasonerComponent oldReasoner; private ReasoningService rs; private LearningProblem lp; - private Set<Component> oldLearningProblemSet = new HashSet<Component>(); + private LearningProblem oldLearningProblem; private LearningAlgorithm la; - private Set<Component> oldLearningAlgorithmSet = new HashSet<Component>(); + private LearningAlgorithm oldLearningAlgorithm; private boolean[] isInit = new boolean[4]; /** @@ -86,7 +82,7 @@ * @param knowledgeSource */ public void setKnowledgeSource(KnowledgeSource knowledgeSource) { - this.oldKnowledgeSourceSet.add(this.source); + this.oldSource = this.source; this.source = knowledgeSource; } @@ -104,8 +100,8 @@ * * @return old KnowledgeSource */ - public Set<Component> getOldKnowledgeSource() { - return this.oldKnowledgeSourceSet; + public KnowledgeSource getOldKnowledgeSource() { + return this.oldSource; } /** @@ -114,7 +110,7 @@ * @param reasoner */ public void setReasoner(ReasonerComponent reasoner) { - this.oldReasonerSet.add(this.reasoner); + this.oldReasoner = this.reasoner; this.reasoner = reasoner; } @@ -132,8 +128,8 @@ * * @return oldReasonerSet. */ - public Set<Component> getOldReasonerSet() { - return this.oldReasonerSet; + public ReasonerComponent getOldReasonerSet() { + return this.oldReasoner; } /** @@ -160,7 +156,7 @@ * @param learningProblem */ public void setLearningProblem(LearningProblem learningProblem) { - this.oldLearningProblemSet.add(this.lp); + this.oldLearningProblem = this.lp; this.lp = learningProblem; } @@ -178,8 +174,8 @@ * * @return old learningProblemSet. */ - public Set<Component> getOldLearningProblem() { - return this.oldLearningProblemSet; + public LearningProblem getOldLearningProblem() { + return this.oldLearningProblem; } /** @@ -188,7 +184,7 @@ * @param learningAlgorithm */ public void setLearningAlgorithm(LearningAlgorithm learningAlgorithm) { - this.oldLearningAlgorithmSet.add(this.la); + this.oldLearningAlgorithm = this.la; this.la = learningAlgorithm; } @@ -206,8 +202,8 @@ * * @return old LearningAlgorithmSet */ - public Set<Component> getOldLearningAlgorithm() { - return this.oldLearningAlgorithmSet; + public LearningAlgorithm getOldLearningAlgorithm() { + return this.oldLearningAlgorithm; } /** Modified: trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-14 15:08:47 UTC (rev 572) @@ -40,6 +40,7 @@ private Config config; private StartGUI startGUI; private JButton initButton; + private JButton setButton; private String[] kbBoxItems = {}; private JComboBox cb = new JComboBox(kbBoxItems); private JPanel choosePanel = new JPanel(); @@ -55,6 +56,8 @@ this.startGUI = startGUI; sources = config.getComponentManager().getKnowledgeSources(); + setButton = new JButton ("Set"); + setButton.addActionListener(this); initButton = new JButton("Init KnowledgeSource"); initButton.addActionListener(this); initButton.setEnabled(true); @@ -67,10 +70,9 @@ cb.addActionListener(this); choosePanel.add(cb); - optionPanel = new OptionPanel(config, - config.getKnowledgeSource(), - config.getOldKnowledgeSource(), - sources.get(choosenClassIndex)); + choosePanel.add(setButton); + optionPanel = new OptionPanel(config, config.getKnowledgeSource(), + config.getOldKnowledgeSource(), sources.get(choosenClassIndex)); initPanel.add(initButton); add(choosePanel, BorderLayout.PAGE_START); @@ -91,6 +93,9 @@ setSource(); } + if (e.getSource() == setButton) + setSource(); + if (e.getSource() == initButton) init(); } Modified: trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-14 15:08:47 UTC (rev 572) @@ -108,21 +108,6 @@ config.setLearningProblem(config.getComponentManager() .learningProblem(problems.get(choosenClassIndex), config.getReasoningService())); - // TEST - // previous set value in old component - if (config.getLearningProblem() != null - && config.getOldLearningProblem() != null) { - System.out.println("NOW: " - + config.getLearningProblem().getClass()); - System.out.println("OLD: " + config.getOldLearningProblem()); - System.out.println("OLD contains?: " - + config.getOldLearningProblem().contains( - config.getLearningProblem().getClass())); - if (config.getLearningProblem().getClass().equals( - config.getOldLearningProblem().getClass())) { - System.out.println("--> THE SAME"); - } - } startGUI.updateTabColors(); updateOptionPanel(); } Modified: trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-14 15:08:47 UTC (rev 572) @@ -25,9 +25,7 @@ import java.awt.GridBagConstraints; import java.awt.GridBagLayout; -import java.util.HashSet; import java.util.List; -import java.util.Set; import javax.swing.JPanel; import javax.swing.JScrollPane; @@ -51,18 +49,17 @@ private List<ConfigOption<?>> optionList; private JPanel centerPanel = new JPanel(); private Component component; - private Set<Component> oldComponentSet = new HashSet<Component>(); + private Component oldComponent; private GridBagLayout gridBagLayout = new GridBagLayout(); private GridBagConstraints constraints = new GridBagConstraints(); public OptionPanel(Config config, Component component, - Set<Component> oldComponentSet, - Class<? extends Component> componentOption) { + Component oldComponent, Class<? extends Component> componentOption) { super(new BorderLayout()); this.config = config; this.component = component; - this.oldComponentSet = oldComponentSet; + this.oldComponent = oldComponent; this.componentOption = componentOption; optionList = ComponentManager.getConfigOptions(componentOption); @@ -81,10 +78,10 @@ } /** update this OptionPanel */ - public void update(Component component, Set<Component> oldComponentSet, + public void update(Component component, Component oldComponent, Class<? extends Component> componentOption) { this.component = component; - this.oldComponentSet = oldComponentSet; + this.oldComponent = oldComponent; this.componentOption = componentOption; showWidgets(); @@ -103,30 +100,30 @@ if (optionList.get(i).getClass().toString().contains( "IntegerConfigOption")) { widgetPanel = new WidgetPanelInteger(config, component, - componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "BooleanConfigOption")) { widgetPanel = new WidgetPanelBoolean(config, component, - oldComponentSet, componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "DoubleConfigOption")) { widgetPanel = new WidgetPanelDouble(config, component, - componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "StringConfigOption")) { widgetPanel = new WidgetPanelString(config, component, - componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "StringSetConfigOption")) { widgetPanel = new WidgetPanelStringSet(config, component, - componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "StringTupleListConfigOption")) { widgetPanel = new WidgetPanelStringTupleList(config, component, - componentOption, optionList.get(i)); + oldComponent, componentOption, optionList.get(i)); } else { widgetPanel = new WidgetPanelDefault(config, component, - componentOption, optionList.get(i)); + /* oldComponent, */componentOption, optionList.get(i)); } gridBagLayout.setConstraints(widgetPanel, constraints); centerPanel.add(widgetPanel); Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-14 15:08:47 UTC (rev 572) @@ -29,8 +29,6 @@ import javax.swing.JLabel; import javax.swing.JPanel; -import java.util.Set; - import org.dllearner.core.Component; import org.dllearner.core.config.ConfigEntry; import org.dllearner.core.config.ConfigOption; @@ -52,20 +50,19 @@ private JLabel nameLabel; private JPanel widgetPanel = new JPanel(); private Component component; - private Set<Component> oldComponentSet; + private Component oldComponent; private Class<? extends Component> componentOption; private Boolean value; private String[] kbBoxItems = { "false", "true" }; private JComboBox cb = new JComboBox(kbBoxItems); public WidgetPanelBoolean(Config config, Component component, - Set<Component> oldComponentSet, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; - this.oldComponentSet = oldComponentSet; + this.oldComponent = oldComponent; this.componentOption = componentOption; showLabel(); // name of option and tooltip @@ -98,26 +95,20 @@ configOption.getName()); } // previous set value from old - /* - * if (component != null && componentOld != null) { if - * (component.getClass().equals(componentOld.getClass())) { - * value = (Boolean) config.getComponentManager() - * .getConfigOptionValue(componentOld, configOption.getName()); - */ - if (component != null && oldComponentSet != null) { - if (oldComponentSet.contains(component)) { - System.out.println("oldComponentSet: " - + oldComponentSet); - // value = (Boolean) - // config.getComponentManager().getConfigOptionValue(componentOld, - // configOption.getName()); - + if (component != null && oldComponent != null) { + if (oldComponent.getClass().equals(component.getClass())) { + value = (Boolean) config.getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value == null) + value = false; + else + setEntry(); // set cb-index if (value == false) cb.setSelectedIndex(0); else cb.setSelectedIndex(1); - setEntry(); } } // default value Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelDouble.java 2008-02-14 15:08:47 UTC (rev 572) @@ -53,17 +53,19 @@ private JPanel widgetPanel = new JPanel(); private JButton setButton = new JButton("Set"); private Component component; + private Component oldComponent; private Class<? extends Component> componentOption; private Double value; private JTextField doubleField = new JTextField(5); public WidgetPanelDouble(Config config, Component component, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponent = oldComponent; this.componentOption = componentOption; showLabel(); // name of option and tooltip @@ -96,6 +98,20 @@ .getConfigOptionValue(component, configOption.getName()); } + // previous set value from old + if (component != null && oldComponent != null) { + if (oldComponent.getClass().equals(component.getClass())) { + value = (Double) config.getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value == null) + value = 0.0; + else { + doubleField.setText(value.toString()); + setEntry(); + } + } + } // default value else if (configOption.getDefaultValue() != null) { value = (Double) configOption.getDefaultValue(); Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelInteger.java 2008-02-14 15:08:47 UTC (rev 572) @@ -54,17 +54,19 @@ private JPanel widgetPanel = new JPanel(); private JButton setButton = new JButton("Set"); private Component component; + private Component oldComponent; private Class<? extends Component> componentOption; private Integer value; private JTextField integerField = new JTextField(3); public WidgetPanelInteger(Config config, Component component, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponent = oldComponent; this.componentOption = componentOption; showLabel(); // name of option and tooltip @@ -97,6 +99,20 @@ .getConfigOptionValue(component, configOption.getName()); } + // previous set value from old + if (component != null && oldComponent != null) { + if (oldComponent.getClass().equals(component.getClass())) { + value = (Integer) config.getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value == null) + value = 0; + else { + integerField.setText(value.toString()); + setEntry(); + } + } + } // default value else if (configOption.getDefaultValue() != null) { value = (Integer) configOption.getDefaultValue(); Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelString.java 2008-02-14 15:08:47 UTC (rev 572) @@ -55,17 +55,19 @@ private JPanel widgetPanel = new JPanel(); private JButton setButton = new JButton("Set"); private Component component; + private Component oldComponent; private Class<? extends Component> componentOption; private String value; private JTextField stringField = new JTextField(35); public WidgetPanelString(Config config, Component component, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponent = oldComponent; this.componentOption = componentOption; showLabel(); // name of option and tooltip @@ -115,6 +117,18 @@ .getConfigOptionValue(component, configOption.getName()); } + // previous set value from old + if (component != null && oldComponent != null) { + if (oldComponent.getClass().equals(component.getClass())) { + value = (String) config.getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value != null) { + stringField.setText(value.toString()); + setEntry(); + } + } + } // default value else if (configOption.getDefaultValue() != null) { value = (String) configOption.getDefaultValue(); Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringSet.java 2008-02-14 15:08:47 UTC (rev 572) @@ -73,6 +73,7 @@ private JTextField stringField = new JTextField(25); private Component component; + private Component oldComponent; private Class<? extends Component> componentOption; private Set<String> value = new HashSet<String>(); @@ -83,12 +84,13 @@ private CheckBoxList cBL = new CheckBoxList(); public WidgetPanelStringSet(Config config, Component component, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponent = oldComponent; this.componentOption = componentOption; widgetPanel.setLayout(gridbag); @@ -167,7 +169,18 @@ value = (Set<String>) config.getComponentManager() .getConfigOptionValue(component, configOption.getName()); - + // previous set value from old + if (component != null && oldComponent != null) { + if (oldComponent.getClass() + .equals(component.getClass())) { + value = (Set<String>) config.getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value != null) { + setEntry(); + } + } + } // fill list if (value != null) { for (Iterator<String> iterator = value.iterator(); iterator @@ -177,6 +190,7 @@ } } } + if (!isSpecial()) { // NORMAL LAYOUT // stringField @@ -215,8 +229,6 @@ buildConstraints(constraints, 1, 1, 1, 1, 100, 100); gridbag.setConstraints(setButton, constraints); widgetPanel.add(setButton, constraints); - // set selections - cBL.setSelections(value); // DEFINE LIST // positiveExamples or negativeExamples if (configOption.getName().equalsIgnoreCase( @@ -256,6 +268,9 @@ for (ObjectProperty ind : atomicRoles) cBL.add(ind.getName()); } + // set selections + if (value != null) + cBL.setSelections(value); } } // UNKNOWN Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java 2008-02-13 19:28:25 UTC (rev 571) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java 2008-02-14 15:08:47 UTC (rev 572) @@ -72,6 +72,7 @@ private List<StringTuple> exampleList = new LinkedList<StringTuple>(); private Component component; + private Component oldComponent; private Class<? extends Component> componentOption; private List<StringTuple> value = new LinkedList<StringTuple>(); @@ -81,12 +82,13 @@ private JButton setButton = new JButton("set"); public WidgetPanelStringTupleList(Config config, Component component, - Class<? extends Component> componentOption, + Component oldComponent, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponent = oldComponent; this.componentOption = componentOption; widgetPanel.setLayout(gridbag); @@ -156,7 +158,20 @@ value = (List<StringTuple>) config.getComponentManager() .getConfigOptionValue(component, configOption.getName()); - + // previous set value from old + if (component != null && oldComponent != null) { + if (oldComponent.getClass() + .equals(component.getClass())) { + value = (List<StringTuple>) config + .getComponentManager() + .getConfigOptionValue(oldComponent, + configOption.getName()); + if (value != null) { + setEntry(); + exampleList = value; + } + } + } // fill list if (value != null) { for (Iterator<StringTuple> iterator = value.iterator(); iterator This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-13 19:28:35
|
Revision: 571 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=571&view=rev Author: tonytacker Date: 2008-02-13 11:28:25 -0800 (Wed, 13 Feb 2008) Log Message: ----------- please ignore - i'm thinking about a way to get old entry's Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/Config.java trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java Modified: trunk/src/dl-learner/org/dllearner/gui/Config.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/Config.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/Config.java 2008-02-13 19:28:25 UTC (rev 571) @@ -20,28 +20,36 @@ * */ +import java.util.HashSet; +import java.util.Set; + import org.dllearner.core.ComponentManager; import org.dllearner.core.KnowledgeSource; import org.dllearner.core.LearningProblem; import org.dllearner.core.ReasoningService; import org.dllearner.core.LearningAlgorithm; import org.dllearner.core.ReasonerComponent; +import org.dllearner.core.Component; /** * Config save all together used variables: ComponentManager, KnowledgeSource, * Reasoner, ReasoningService, LearningProblem, LearningAlgorithm; also inits of - * these components + * these components. * * @author Tilo Hielscher */ public class Config { private ComponentManager cm = ComponentManager.getInstance(); private KnowledgeSource source; + private Set<Component> oldKnowledgeSourceSet = new HashSet<Component>(); private String uri; private ReasonerComponent reasoner; + private Set<Component> oldReasonerSet = new HashSet<Component>(); private ReasoningService rs; private LearningProblem lp; + private Set<Component> oldLearningProblemSet = new HashSet<Component>(); private LearningAlgorithm la; + private Set<Component> oldLearningAlgorithmSet = new HashSet<Component>(); private boolean[] isInit = new boolean[4]; /** @@ -73,57 +81,77 @@ } /** - * Get Reasoner. + * Set KnowledgeSource. * - * @return reasoner + * @param knowledgeSource */ - public ReasonerComponent getReasoner() { - return this.reasoner; + public void setKnowledgeSource(KnowledgeSource knowledgeSource) { + this.oldKnowledgeSourceSet.add(this.source); + this.source = knowledgeSource; } /** + * Get KnowledgeSource. + * + * @return KnowledgeSource + */ + public KnowledgeSource getKnowledgeSource() { + return this.source; + } + + /** + * Get old KnowledgeSource. + * + * @return old KnowledgeSource + */ + public Set<Component> getOldKnowledgeSource() { + return this.oldKnowledgeSourceSet; + } + + /** * Set Reasoner. * * @param reasoner */ public void setReasoner(ReasonerComponent reasoner) { + this.oldReasonerSet.add(this.reasoner); this.reasoner = reasoner; } /** - * Get ReasoningService. + * Get Reasoner. * - * @return ReasoningService + * @return reasoner */ - public ReasoningService getReasoningService() { - return this.rs; + public ReasonerComponent getReasoner() { + return this.reasoner; } /** - * Set ReasoningService. + * Get old Reasoner as a set. * - * @param reasoningService + * @return oldReasonerSet. */ - public void setReasoningService(ReasoningService reasoningService) { - this.rs = reasoningService; + public Set<Component> getOldReasonerSet() { + return this.oldReasonerSet; } /** - * Get KnowledgeSource. + * Set ReasoningService. * - * @return KnowledgeSource + * @param reasoningService */ - public KnowledgeSource getKnowledgeSource() { - return this.source; + public void setReasoningService(ReasoningService reasoningService) { + this.rs = reasoningService; } /** - * Set KnowledgeSource. + * Get ReasoningService. * - * @param knowledgeSource + * @return ReasoningService */ - public void setKnowledgeSource(KnowledgeSource knowledgeSource) { - this.source = knowledgeSource; + public ReasoningService getReasoningService() { + return this.rs; } /** @@ -132,6 +160,7 @@ * @param learningProblem */ public void setLearningProblem(LearningProblem learningProblem) { + this.oldLearningProblemSet.add(this.lp); this.lp = learningProblem; } @@ -145,11 +174,21 @@ } /** + * Get old LearningProblem as a set. + * + * @return old learningProblemSet. + */ + public Set<Component> getOldLearningProblem() { + return this.oldLearningProblemSet; + } + + /** * Set LearningAlgorithm. * * @param learningAlgorithm */ public void setLearningAlgorithm(LearningAlgorithm learningAlgorithm) { + this.oldLearningAlgorithmSet.add(this.la); this.la = learningAlgorithm; } @@ -163,6 +202,15 @@ } /** + * Get old LearningAlgorithmSet. + * + * @return old LearningAlgorithmSet + */ + public Set<Component> getOldLearningAlgorithm() { + return this.oldLearningAlgorithmSet; + } + + /** * KnowledgeSource.init has run? * * @return true, if init was made, false if not Modified: trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/KnowledgeSourcePanel.java 2008-02-13 19:28:25 UTC (rev 571) @@ -67,7 +67,9 @@ cb.addActionListener(this); choosePanel.add(cb); - optionPanel = new OptionPanel(config, config.getKnowledgeSource(), + optionPanel = new OptionPanel(config, + config.getKnowledgeSource(), + config.getOldKnowledgeSource(), sources.get(choosenClassIndex)); initPanel.add(initButton); @@ -121,7 +123,7 @@ * update OptionPanel with new selection */ public void updateOptionPanel() { - optionPanel.update(config.getKnowledgeSource(), sources - .get(choosenClassIndex)); + optionPanel.update(config.getKnowledgeSource(), config + .getOldKnowledgeSource(), sources.get(choosenClassIndex)); } } Modified: trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/LearningAlgorithmPanel.java 2008-02-13 19:28:25 UTC (rev 571) @@ -74,7 +74,8 @@ cb.addActionListener(this); optionPanel = new OptionPanel(config, config.getLearningAlgorithm(), - learners.get(choosenClassIndex)); + config.getOldLearningAlgorithm(), learners + .get(choosenClassIndex)); add(choosePanel, BorderLayout.PAGE_START); add(optionPanel, BorderLayout.CENTER); @@ -133,7 +134,7 @@ */ public void updateOptionPanel() { // update OptionPanel - optionPanel.update(config.getLearningAlgorithm(), learners - .get(choosenClassIndex)); + optionPanel.update(config.getLearningAlgorithm(), config + .getOldLearningAlgorithm(), learners.get(choosenClassIndex)); } } Modified: trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/LearningProblemPanel.java 2008-02-13 19:28:25 UTC (rev 571) @@ -75,7 +75,7 @@ choosenClassIndex = cb.getSelectedIndex(); optionPanel = new OptionPanel(config, config.getLearningProblem(), - problems.get(choosenClassIndex)); + config.getOldLearningProblem(), problems.get(choosenClassIndex)); add(choosePanel, BorderLayout.PAGE_START); add(optionPanel, BorderLayout.CENTER); @@ -108,8 +108,23 @@ config.setLearningProblem(config.getComponentManager() .learningProblem(problems.get(choosenClassIndex), config.getReasoningService())); + // TEST + // previous set value in old component + if (config.getLearningProblem() != null + && config.getOldLearningProblem() != null) { + System.out.println("NOW: " + + config.getLearningProblem().getClass()); + System.out.println("OLD: " + config.getOldLearningProblem()); + System.out.println("OLD contains?: " + + config.getOldLearningProblem().contains( + config.getLearningProblem().getClass())); + if (config.getLearningProblem().getClass().equals( + config.getOldLearningProblem().getClass())) { + System.out.println("--> THE SAME"); + } + } + startGUI.updateTabColors(); updateOptionPanel(); - startGUI.updateTabColors(); } } @@ -130,7 +145,7 @@ */ private void updateOptionPanel() { // update OptionPanel - optionPanel.update(config.getLearningProblem(), problems - .get(choosenClassIndex)); + optionPanel.update(config.getLearningProblem(), config + .getOldLearningProblem(), problems.get(choosenClassIndex)); } } Modified: trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-13 19:28:25 UTC (rev 571) @@ -25,7 +25,9 @@ import java.awt.GridBagConstraints; import java.awt.GridBagLayout; +import java.util.HashSet; import java.util.List; +import java.util.Set; import javax.swing.JPanel; import javax.swing.JScrollPane; @@ -49,15 +51,18 @@ private List<ConfigOption<?>> optionList; private JPanel centerPanel = new JPanel(); private Component component; + private Set<Component> oldComponentSet = new HashSet<Component>(); private GridBagLayout gridBagLayout = new GridBagLayout(); private GridBagConstraints constraints = new GridBagConstraints(); public OptionPanel(Config config, Component component, + Set<Component> oldComponentSet, Class<? extends Component> componentOption) { super(new BorderLayout()); this.config = config; this.component = component; + this.oldComponentSet = oldComponentSet; this.componentOption = componentOption; optionList = ComponentManager.getConfigOptions(componentOption); @@ -71,17 +76,18 @@ centerScroller.setPreferredSize(new Dimension(400, 200)); // add Panels add(centerScroller, BorderLayout.CENTER); - + // show widgets showWidgets(); - } /** update this OptionPanel */ - public void update(Component component, + public void update(Component component, Set<Component> oldComponentSet, Class<? extends Component> componentOption) { + this.component = component; + this.oldComponentSet = oldComponentSet; this.componentOption = componentOption; - this.component = component; showWidgets(); + } /** @@ -101,7 +107,7 @@ } else if (optionList.get(i).getClass().toString().contains( "BooleanConfigOption")) { widgetPanel = new WidgetPanelBoolean(config, component, - componentOption, optionList.get(i)); + oldComponentSet, componentOption, optionList.get(i)); } else if (optionList.get(i).getClass().toString().contains( "DoubleConfigOption")) { widgetPanel = new WidgetPanelDouble(config, component, Modified: trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/ReasonerPanel.java 2008-02-13 19:28:25 UTC (rev 571) @@ -72,8 +72,8 @@ reasoners.get(i))); } - optionPanel = new OptionPanel(config, config.getReasoner(), reasoners - .get(choosenClassIndex)); + optionPanel = new OptionPanel(config, config.getReasoner(), config + .getOldReasonerSet(), reasoners.get(choosenClassIndex)); choosePanel.add(autoInitButton); cb.addActionListener(this); @@ -92,12 +92,13 @@ if (choosenClassIndex != cb.getSelectedIndex()) { choosenClassIndex = cb.getSelectedIndex(); config.setInitReasoner(false); - setReasoner(); } - if (e.getSource() == autoInitButton) + if (e.getSource() == autoInitButton) { + config.setInitReasoner(false); setReasoner(); + } if (e.getSource() == initButton) init(); @@ -121,7 +122,7 @@ * after this, next tab can be used */ public void init() { - if (/* !config.isInitReasoner() && */config.getKnowledgeSource() != null + if (config.getKnowledgeSource() != null && config.getReasoner() != null) { config.getReasoner().init(); System.out.println("init Reasoner"); @@ -140,8 +141,8 @@ * update OptionPanel with new selection */ public void updateOptionPanel() { - optionPanel.update(config.getReasoner(), reasoners - .get(choosenClassIndex)); + optionPanel.update(config.getReasoner(), config.getOldReasonerSet(), + reasoners.get(choosenClassIndex)); } } Modified: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-13 17:32:23 UTC (rev 570) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelBoolean.java 2008-02-13 19:28:25 UTC (rev 571) @@ -29,6 +29,8 @@ import javax.swing.JLabel; import javax.swing.JPanel; +import java.util.Set; + import org.dllearner.core.Component; import org.dllearner.core.config.ConfigEntry; import org.dllearner.core.config.ConfigOption; @@ -50,18 +52,20 @@ private JLabel nameLabel; private JPanel widgetPanel = new JPanel(); private Component component; + private Set<Component> oldComponentSet; private Class<? extends Component> componentOption; - private Boolean value; private String[] kbBoxItems = { "false", "true" }; private JComboBox cb = new JComboBox(kbBoxItems); public WidgetPanelBoolean(Config config, Component component, + Set<Component> oldComponentSet, Class<? extends Component> componentOption, ConfigOption<?> configOption) { this.config = config; this.configOption = configOption; this.component = component; + this.oldComponentSet = oldComponentSet; this.componentOption = componentOption; showLabel(); // name of option and tooltip @@ -70,6 +74,7 @@ } public void actionPerformed(ActionEvent e) { + setEntry(); } @@ -92,11 +97,34 @@ .getConfigOptionValue(component, configOption.getName()); } + // previous set value from old + /* + * if (component != null && componentOld != null) { if + * (component.getClass().equals(componentOld.getClass())) { + * value = (Boolean) config.getComponentManager() + * .getConfigOptionValue(componentOld, configOption.getName()); + */ + if (component != null && oldComponentSet != null) { + if (oldComponentSet.contains(component)) { + System.out.println("oldComponentSet: " + + oldComponentSet); + // value = (Boolean) + // config.getComponentManager().getConfigOptionValue(componentOld, + // configOption.getName()); + + // set cb-index + if (value == false) + cb.setSelectedIndex(0); + else + cb.setSelectedIndex(1); + setEntry(); + } + } // default value - else if (configOption.getDefaultValue() != null) { + if (value != null && configOption.getDefaultValue() != null) { value = (Boolean) configOption.getDefaultValue(); } - // value == null + // value == null? if (value == null) { value = false; } @@ -142,4 +170,5 @@ s.printStackTrace(); } } + } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <jen...@us...> - 2008-02-13 17:32:41
|
Revision: 570 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=570&view=rev Author: jenslehmann Date: 2008-02-13 09:32:23 -0800 (Wed, 13 Feb 2008) Log Message: ----------- fixed bug #1892730 Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/cli/ConfFileOption.java trunk/src/dl-learner/org/dllearner/cli/Start.java Modified: trunk/src/dl-learner/org/dllearner/cli/ConfFileOption.java =================================================================== --- trunk/src/dl-learner/org/dllearner/cli/ConfFileOption.java 2008-02-13 14:54:37 UTC (rev 569) +++ trunk/src/dl-learner/org/dllearner/cli/ConfFileOption.java 2008-02-13 17:32:23 UTC (rev 570) @@ -81,7 +81,7 @@ this.option = option; this.subOption = subOption; doubleValue = value; - isDoubleOption = false; + isDoubleOption = true; } public ConfFileOption(String option, Set<String> values) { Modified: trunk/src/dl-learner/org/dllearner/cli/Start.java =================================================================== --- trunk/src/dl-learner/org/dllearner/cli/Start.java 2008-02-13 14:54:37 UTC (rev 569) +++ trunk/src/dl-learner/org/dllearner/cli/Start.java 2008-02-13 17:32:23 UTC (rev 570) @@ -130,12 +130,13 @@ String baseDir = file.getParentFile().getPath(); // create component manager instance - System.out.print("starting component manager ... "); + String message = "starting component manager ... "; long cmStartTime = System.nanoTime(); ComponentManager cm = ComponentManager.getInstance(); long cmTime = System.nanoTime() - cmStartTime; - System.out.println("OK (" + Helper.prettyPrintNanoSeconds(cmTime) + ")"); - + message += "OK (" + Helper.prettyPrintNanoSeconds(cmTime) + ")"; + logger.info(message); + // create a mapping between components and prefixes in the conf file Map<Class<? extends Component>, String> componentPrefixMapping = createComponentPrefixMapping(); @@ -355,7 +356,7 @@ cm.applyConfigEntry(component, entry); } else { - handleError("The type of conf file entry " + option + " is not correct."); + handleError("The type of conf file entry \"" + option.getFullName() + "\" is not correct: value \"" + option.getValue() + "\" not valid for option type \"" + configOption.getClass().getName() + "\"."); } } catch (InvalidConfigOptionValueException e) { @@ -702,7 +703,7 @@ } private static void handleError(String message) { - System.err.println(message); + logger.error(message); System.exit(0); } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <sk...@us...> - 2008-02-13 14:54:41
|
Revision: 569 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=569&view=rev Author: sknappe Date: 2008-02-13 06:54:37 -0800 (Wed, 13 Feb 2008) Log Message: ----------- little bugfix Modified Paths: -------------- trunk/src/dbpedia-navigator/ajaxfunctions.php Modified: trunk/src/dbpedia-navigator/ajaxfunctions.php =================================================================== --- trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-13 14:27:13 UTC (rev 568) +++ trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-13 14:54:37 UTC (rev 569) @@ -342,7 +342,7 @@ foreach ($concepts as $con){ $concept.="<tr><td><a href=\"\" onclick=\"xajax_getSubjectsFromConcept('".$con."');return false;\" onMouseOver=\"showdiv('div".$i."');showdiv('ConceptBox');\" onMouseOut=\"hidediv('div".$i."');hidediv('ConceptBox');\" />".$con."</a></td></tr>"; //put information about concepts in divs - $conceptinformation.="<div id=\"div".$i."\">".$con."</div>"; + $conceptinformation.="<div id=\"div".$i."\" style=\"display:none\">".$con."</div>"; $i++; } $concept.="</table>"; This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <sk...@us...> - 2008-02-13 14:27:19
|
Revision: 568 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=568&view=rev Author: sknappe Date: 2008-02-13 06:27:13 -0800 (Wed, 13 Feb 2008) Log Message: ----------- detailed concept shown (not very much information yet) Modified Paths: -------------- trunk/src/dbpedia-navigator/ajaxfunctions.php trunk/src/dbpedia-navigator/index.php Modified: trunk/src/dbpedia-navigator/ajaxfunctions.php =================================================================== --- trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-13 14:23:04 UTC (rev 567) +++ trunk/src/dbpedia-navigator/ajaxfunctions.php 2008-02-13 14:27:13 UTC (rev 568) @@ -321,6 +321,7 @@ session_write_close(); setRunning($id,"true"); $concept=""; + $conceptinformation=""; if (isset($positives)) { $posArray=array(); @@ -337,8 +338,12 @@ $concepts=$sc->getConceptFromExamples($posArray,$negArray); $concept.="<table border=0>\n"; + $i=1; foreach ($concepts as $con){ - $concept.="<tr><td><a href=\"\" onclick=\"xajax_getSubjectsFromConcept('".$con."');return false;\" />".$con."</a></td></tr>"; + $concept.="<tr><td><a href=\"\" onclick=\"xajax_getSubjectsFromConcept('".$con."');return false;\" onMouseOver=\"showdiv('div".$i."');showdiv('ConceptBox');\" onMouseOut=\"hidediv('div".$i."');hidediv('ConceptBox');\" />".$con."</a></td></tr>"; + //put information about concepts in divs + $conceptinformation.="<div id=\"div".$i."\">".$con."</div>"; + $i++; } $concept.="</table>"; } catch(Exception $e){ @@ -349,6 +354,7 @@ $objResponse = new xajaxResponse(); $objResponse->assign("conceptlink", "innerHTML", $concept); + $objResponse->assign("ConceptInformation", "innerHTML", $conceptinformation); return $objResponse; } Modified: trunk/src/dbpedia-navigator/index.php =================================================================== --- trunk/src/dbpedia-navigator/index.php 2008-02-13 14:23:04 UTC (rev 567) +++ trunk/src/dbpedia-navigator/index.php 2008-02-13 14:27:13 UTC (rev 568) @@ -42,6 +42,14 @@ xajax.$('SearchResultBox').style.display = 'block'; xajax.$('LastArticlesBox').style.display = 'block'; }; + + function showdiv(id){ + document.getElementById(id).style.display='block'; + } + + function hidediv(id) { + document.getElementById(id).style.display='none'; + } </script> </head> <body <?php if (isset($_GET['resource'])) print "onLoad=\"xajax_getarticle('".$_GET['resource']."',-1);return false;\"";unset($_GET['resource']);?>> @@ -154,16 +162,8 @@ two months, so it would be nice to have a script based partly automated or at least documented solution for creating a DBpedia mirror).</li> <li>Improve stability: Fix sometimes occurring PHP errors and warnings (check PHP error log).</li> - <li>Currently there are three SPARQL query methods: for labels, subjects, and article. These should - probably be replaced by a single web service method which allows to execute a SPARQL query. This will - greatly simplify the DL-Learner code while making the PHP code only slightly more complex. Such a method - also makes much more sense as a web service method, because other applications will need different SPARQL - queries. Similar to the learn method, there should be a threaded and a non-threaded version of the SPARQL - query method. This allows not to have the overhead of creating a separate thread for simple SPARQL queries - (especially since we assume that the DBpedia SPARQL endpoint is local).</li> <li>Automatically learn concepts whenever an example has been added (and there is at least one positive example present).</li> - <li>Show n (for example 5) instead of 1 best concept.</li> <li>For each result, display a "+" which shows more information about the concept in an overlay box, e.g. its Description Logic or OWL syntax, its classification accuracy on the examples, and which examples it classifies (in-)correctly.</li> @@ -206,6 +206,10 @@ </ul> </div> + <div class="box" id="ConceptBox" style="position:absolute;top:0px;right:20px;opacity:0.90;display:none;z-index:5;"> + <div class="boxtitle">Detailed Concept Information</div> + <div class="boxcontent" id="ConceptInformation"></div> + </div> </body> </html> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 14:23:15
|
Revision: 567 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=567&view=rev Author: kurzum Date: 2008-02-13 06:23:04 -0800 (Wed, 13 Feb 2008) Log Message: ----------- finished family Modified Paths: -------------- trunk/examples/commandcollection.txt trunk/examples/family/daughter.conf trunk/examples/family/grandfather.conf trunk/examples/family/uncle.conf Added Paths: ----------- trunk/examples/family/daughter.kb trunk/examples/family/father.conf trunk/examples/family/father_owl.conf trunk/examples/family/grandfather.kb trunk/examples/father.kb Removed Paths: ------------- trunk/examples/family/father2.conf trunk/examples/family/fatherOld.conf Modified: trunk/examples/commandcollection.txt =================================================================== --- trunk/examples/commandcollection.txt 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/commandcollection.txt 2008-02-13 14:23:04 UTC (rev 567) @@ -7,6 +7,8 @@ showInternalKB = true; showSubsumptionHierarchy = true; +// do not display http://localhost/foo# in concepts +// and roles to make the output more readable hidePrefix("http://localhost/foo#"); // reasoner settings @@ -20,6 +22,8 @@ refinement.horizontalExpansionFactor = 0.6; refinement.quiet = false; refinement.useTooWeakList = true; +refinement.heuristic = flexible; +percentPerLengthUnit = 0.05; //learning problems problem = posOnlyDefinition; Modified: trunk/examples/family/daughter.conf =================================================================== --- trunk/examples/family/daughter.conf 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/family/daughter.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -12,11 +12,11 @@ import("daughter.kb"); /** examples **/ --father(stefan). -+father(markus). -+father(bernd). --father(heinz). --father(anna). --father(gabi). --father(michelle). --father(franz). +-stefan ++markus ++bernd +-heinz +-anna +-gabi +-michelle +-franz Added: trunk/examples/family/daughter.kb =================================================================== --- trunk/examples/family/daughter.kb (rev 0) +++ trunk/examples/family/daughter.kb 2008-02-13 14:23:04 UTC (rev 567) @@ -0,0 +1,27 @@ +/** background knowledge ***/ + +// male and female are disjoint +BOTTOM = (male AND female). + +// role hierarchy +Subrole(hasSon, hasChild). +Subrole(hasDaughter, hasChild). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +male(franz). +female(anna). +female(gabi). +female(michelle). + +// children +hasSon(stefan,markus). +hasDaughter(markus,anna). +hasDaughter(bernd,gabi). +hasDaughter(gabi,anna). +hasSon(anna,heinz). +hasSon(franz,heinz). +hasDaughter(franz,michelle). \ No newline at end of file Added: trunk/examples/family/father.conf =================================================================== --- trunk/examples/family/father.conf (rev 0) +++ trunk/examples/family/father.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -0,0 +1,22 @@ +/** + * Father Example + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** background knowledge ***/ + +import("father.kb"); +// import("father_incl.kb"); + +/** examples **/ ++stefan ++markus ++bernd +-heinz +-anna +-gabi +-michelle Deleted: trunk/examples/family/father2.conf =================================================================== --- trunk/examples/family/father2.conf 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/family/father2.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -1,26 +0,0 @@ -/** - * Another Father Example (this time using OWL import) - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -reasoner = dig; -import("father.owl"); - -// do not display http://example.com/father# in concepts -// and roles to make the output more readable -hidePrefix = "http://example.com/father#"; - -writeDIGProtocol = false; -digProtocolFile = "log/father2_dig.txt"; - -/** examples **/ -+"http://example.com/father#stefan" -+"http://example.com/father#markus" -+"http://example.com/father#martin" --"http://example.com/father#heinz" --"http://example.com/father#anna" --"http://example.com/father#michelle" Deleted: trunk/examples/family/fatherOld.conf =================================================================== --- trunk/examples/family/fatherOld.conf 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/family/fatherOld.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -1,58 +0,0 @@ -/** - * Father Example - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** settings **/ -// reasoner settings -reasoner = dig; -digReasonerURL = "http://localhost:8081"; -useRetrievalForClassification = true; -refinement.useDIGMultiInstanceChecks = twoChecks; - -// algorithm settings -algorithm = refinement; -refinement.horizontalExpansionFactor = 0.5; -refinement.quiet = false; - -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchTree.txt"; - -// control output -showIndividuals = true; -showConcepts = true; -showRoles = true; -showInternalKB = true; -showSubsumptionHierarchy = true; - -/** background knowledge ***/ -BOTTOM = (male AND female). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -female(anna). -female(gabi). -female(michelle). - -// children -hasChild(stefan,markus). -hasChild(markus,anna). -hasChild(bernd,gabi). -hasChild(anna,heinz). - -/** examples **/ -+father(stefan). -+father(markus). -+father(bernd). --father(heinz). --father(anna). --father(gabi). --father(michelle). Copied: trunk/examples/family/father_owl.conf (from rev 564, trunk/examples/family/father2.conf) =================================================================== --- trunk/examples/family/father_owl.conf (rev 0) +++ trunk/examples/family/father_owl.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -0,0 +1,23 @@ +/** + * Another Father Example (this time using OWL import) + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +import("father.owl"); + +// do not display http://example.com/father# in concepts +// and roles to make the output more readable +hidePrefix = "http://example.com/father#"; + + +/** examples **/ ++"http://example.com/father#stefan" ++"http://example.com/father#markus" ++"http://example.com/father#martin" +-"http://example.com/father#heinz" +-"http://example.com/father#anna" +-"http://example.com/father#michelle" Modified: trunk/examples/family/grandfather.conf =================================================================== --- trunk/examples/family/grandfather.conf 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/family/grandfather.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -10,76 +10,21 @@ * Copyright (C) 2007, Jens Lehmann */ -/** settings **/ -algorithm = refinement; -// refinement.heuristic = flexible; -// percentPerLengthUnit = 0.05; -refinement.horizontalExpansionFactor = 0.6; +/** background knowledge ***/ -/** background knowledge **/ -male SUB person. -female SUB person. +import("grandfather.kb"); -// disjunct concepts -(male AND female) SUB BOTTOM. - -Symmetric(married). -Functional(married). - -// persons -male(m1). -male(m2). -male(m3). -male(m4). -male(m5). -male(m6). -male(m7). -female(f1). -female(f2). -female(f3). -female(f4). -female(f5). -female(f6). -female(f7). -female(f8). - -// married-relations -married(m1,f1). -married(m2,f4). -married(m5,f5). -married(f6,m7). -married(m6,f8). - -// hasChild-relations -hasChild(m1,m2). -hasChild(m1,f2). -hasChild(m1,m5). -hasChild(f1,m2). -hasChild(f1,f2). -hasChild(f1,m5). - -hasChild(m2,m3). -hasChild(f4,m3). -hasChild(f2,f3). -hasChild(f2,m4). -hasChild(m5,f6). -hasChild(f5,f6). -hasChild(f6,m6). -hasChild(m7,m6). -hasChild(f8,f7). -hasChild(m6,f7). - /** examples **/ -+grandfather(m1). --grandfather(m2). --grandfather(m3). --grandfather(m4). -+grandfather(m5). --grandfather(m6). -+grandfather(m7). --grandfather(f1). --grandfather(f2). --grandfather(f3). --grandfather(f4). --grandfather(f5). --grandfather(f6). ++m1 +-m2 +-m3 +-m4 ++m5 +-m6 ++m7 +-f1 +-f2 +-f3 +-f4 +-f5 +-f6 Added: trunk/examples/family/grandfather.kb =================================================================== --- trunk/examples/family/grandfather.kb (rev 0) +++ trunk/examples/family/grandfather.kb 2008-02-13 14:23:04 UTC (rev 567) @@ -0,0 +1,53 @@ +/** background knowledge **/ +male SUB person. +female SUB person. + +// disjunct concepts +(male AND female) SUB BOTTOM. + +Symmetric(married). +Functional(married). + +// persons +male(m1). +male(m2). +male(m3). +male(m4). +male(m5). +male(m6). +male(m7). +female(f1). +female(f2). +female(f3). +female(f4). +female(f5). +female(f6). +female(f7). +female(f8). + +// married-relations +married(m1,f1). +married(m2,f4). +married(m5,f5). +married(f6,m7). +married(m6,f8). + +// hasChild-relations +hasChild(m1,m2). +hasChild(m1,f2). +hasChild(m1,m5). +hasChild(f1,m2). +hasChild(f1,f2). +hasChild(f1,m5). + +hasChild(m2,m3). +hasChild(f4,m3). +hasChild(f2,f3). +hasChild(f2,m4). +hasChild(m5,f6). +hasChild(f5,f6). +hasChild(f6,m6). +hasChild(m7,m6). +hasChild(f8,f7). +hasChild(m6,f7). + Modified: trunk/examples/family/uncle.conf =================================================================== --- trunk/examples/family/uncle.conf 2008-02-13 14:12:30 UTC (rev 566) +++ trunk/examples/family/uncle.conf 2008-02-13 14:23:04 UTC (rev 567) @@ -14,12 +14,7 @@ * Copyright (C) 2007, Jens Lehmann */ -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/search_uncle.txt"; - -digReasoner.writeDIGProtocol = false; -digReasoner.digProtocolFile = "log/dig_uncle.txt"; - +/** background knowledge ***/ import("uncle.kb"); /** examples **/ Added: trunk/examples/father.kb =================================================================== --- trunk/examples/father.kb (rev 0) +++ trunk/examples/father.kb 2008-02-13 14:23:04 UTC (rev 567) @@ -0,0 +1,16 @@ +BOTTOM = (male AND female). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +female(anna). +female(gabi). +female(michelle). + +// children +hasChild(stefan,markus). +hasChild(markus,anna). +hasChild(bernd,gabi). +hasChild(anna,heinz). This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ton...@us...> - 2008-02-13 14:12:33
|
Revision: 566 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=566&view=rev Author: tonytacker Date: 2008-02-13 06:12:30 -0800 (Wed, 13 Feb 2008) Log Message: ----------- new icon Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/icon.gif Modified: trunk/src/dl-learner/org/dllearner/gui/icon.gif =================================================================== (Binary files differ) This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 14:04:57
|
Revision: 565 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=565&view=rev Author: kurzum Date: 2008-02-13 06:04:45 -0800 (Wed, 13 Feb 2008) Log Message: ----------- intermediate Modified Paths: -------------- trunk/examples/commandcollection.txt trunk/examples/family/daughter.conf Added Paths: ----------- trunk/examples/father.conf Removed Paths: ------------- trunk/examples/family/father.conf Modified: trunk/examples/commandcollection.txt =================================================================== --- trunk/examples/commandcollection.txt 2008-02-13 13:56:54 UTC (rev 564) +++ trunk/examples/commandcollection.txt 2008-02-13 14:04:45 UTC (rev 565) @@ -21,10 +21,13 @@ refinement.quiet = false; refinement.useTooWeakList = true; +//learning problems +problem = posOnlyDefinition; // search tree protocol refinement.writeSearchTree = false; refinement.searchTreeFile = "log/SearchTree.txt"; +refinement.replaceSearchTree = false; //dig protocol Modified: trunk/examples/family/daughter.conf =================================================================== --- trunk/examples/family/daughter.conf 2008-02-13 13:56:54 UTC (rev 564) +++ trunk/examples/family/daughter.conf 2008-02-13 14:04:45 UTC (rev 565) @@ -8,45 +8,9 @@ * Copyright (C) 2007, Jens Lehmann */ -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchTreeDaughter.txt"; - -// control output -showIndividuals = true; -showConcepts = true; -showRoles = true; -showInternalKB = true; -showSubsumptionHierarchy = true; - /** background knowledge ***/ +import("daughter.kb"); -// male and female are disjoint -BOTTOM = (male AND female). - -// role hierarchy -Subrole(hasSon, hasChild). -Subrole(hasDaughter, hasChild). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -male(franz). -female(anna). -female(gabi). -female(michelle). - -// children -hasSon(stefan,markus). -hasDaughter(markus,anna). -hasDaughter(bernd,gabi). -hasDaughter(gabi,anna). -hasSon(anna,heinz). -hasSon(franz,heinz). -hasDaughter(franz,michelle). - /** examples **/ -father(stefan). +father(markus). Deleted: trunk/examples/family/father.conf =================================================================== --- trunk/examples/family/father.conf 2008-02-13 13:56:54 UTC (rev 564) +++ trunk/examples/family/father.conf 2008-02-13 14:04:45 UTC (rev 565) @@ -1,43 +0,0 @@ -/** - * Father Example - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** settings **/ -// reasoner settings -reasoner = dig; -//digReasonerURL = "http://localhost:8081"; -//useRetrievalForClassification = true; -//refinement.useDIGMultiInstanceChecks = twoChecks; - -// algorithm settings -algorithm = refinement; - -// problem = posOnlyDefinition; - -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchFather.txt"; - -// control output -cli.checkSatisfiability = true; -cli.showIndividuals = false; -cli.showConcepts = false; -cli.showRoles = true; -cli.showSubsumptionHierarchy = false; - -import("father.kb"); -// import("father_incl.kb"); - -/** examples **/ -+stefan -+markus -+bernd --heinz --anna --gabi --michelle Copied: trunk/examples/father.conf (from rev 564, trunk/examples/family/father.conf) =================================================================== --- trunk/examples/father.conf (rev 0) +++ trunk/examples/father.conf 2008-02-13 14:04:45 UTC (rev 565) @@ -0,0 +1,23 @@ +/** + * Father Example + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** settings **/ + + +import("father.kb"); + + +/** examples **/ ++stefan ++markus ++bernd +-heinz +-anna +-gabi +-michelle This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 13:57:00
|
Revision: 564 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=564&view=rev Author: kurzum Date: 2008-02-13 05:56:54 -0800 (Wed, 13 Feb 2008) Log Message: ----------- moved all to family folder Added Paths: ----------- trunk/examples/family/daughter.conf trunk/examples/family/father.conf trunk/examples/family/father.kb trunk/examples/family/father.owl trunk/examples/family/father2.conf trunk/examples/family/fatherOld.conf trunk/examples/family/father_incl.kb trunk/examples/family/grandfather.conf trunk/examples/family/uncle.conf trunk/examples/family/uncle.kb trunk/examples/family/uncle.owl Removed Paths: ------------- trunk/examples/daughter.conf trunk/examples/father.conf trunk/examples/father.kb trunk/examples/father.owl trunk/examples/father2.conf trunk/examples/fatherOld.conf trunk/examples/father_incl.kb trunk/examples/grandfather.conf trunk/examples/uncle.conf trunk/examples/uncle.kb trunk/examples/uncle.owl Deleted: trunk/examples/daughter.conf =================================================================== --- trunk/examples/daughter.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/daughter.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,58 +0,0 @@ -/** - * Example "grandfather with daughter" - * - * possible solution: - * male AND EXISTS hasDaughter.EXISTS hasChild.TOP - * male AND EXISTS hasChild.(female AND EXISTS hasChild.TOP) - * - * Copyright (C) 2007, Jens Lehmann - */ - -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchTreeDaughter.txt"; - -// control output -showIndividuals = true; -showConcepts = true; -showRoles = true; -showInternalKB = true; -showSubsumptionHierarchy = true; - -/** background knowledge ***/ - -// male and female are disjoint -BOTTOM = (male AND female). - -// role hierarchy -Subrole(hasSon, hasChild). -Subrole(hasDaughter, hasChild). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -male(franz). -female(anna). -female(gabi). -female(michelle). - -// children -hasSon(stefan,markus). -hasDaughter(markus,anna). -hasDaughter(bernd,gabi). -hasDaughter(gabi,anna). -hasSon(anna,heinz). -hasSon(franz,heinz). -hasDaughter(franz,michelle). - -/** examples **/ --father(stefan). -+father(markus). -+father(bernd). --father(heinz). --father(anna). --father(gabi). --father(michelle). --father(franz). Copied: trunk/examples/family/daughter.conf (from rev 551, trunk/examples/daughter.conf) =================================================================== --- trunk/examples/family/daughter.conf (rev 0) +++ trunk/examples/family/daughter.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,58 @@ +/** + * Example "grandfather with daughter" + * + * possible solution: + * male AND EXISTS hasDaughter.EXISTS hasChild.TOP + * male AND EXISTS hasChild.(female AND EXISTS hasChild.TOP) + * + * Copyright (C) 2007, Jens Lehmann + */ + +// search tree protocol +refinement.writeSearchTree = false; +refinement.searchTreeFile = "log/searchTreeDaughter.txt"; + +// control output +showIndividuals = true; +showConcepts = true; +showRoles = true; +showInternalKB = true; +showSubsumptionHierarchy = true; + +/** background knowledge ***/ + +// male and female are disjoint +BOTTOM = (male AND female). + +// role hierarchy +Subrole(hasSon, hasChild). +Subrole(hasDaughter, hasChild). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +male(franz). +female(anna). +female(gabi). +female(michelle). + +// children +hasSon(stefan,markus). +hasDaughter(markus,anna). +hasDaughter(bernd,gabi). +hasDaughter(gabi,anna). +hasSon(anna,heinz). +hasSon(franz,heinz). +hasDaughter(franz,michelle). + +/** examples **/ +-father(stefan). ++father(markus). ++father(bernd). +-father(heinz). +-father(anna). +-father(gabi). +-father(michelle). +-father(franz). Copied: trunk/examples/family/father.conf (from rev 551, trunk/examples/father.conf) =================================================================== --- trunk/examples/family/father.conf (rev 0) +++ trunk/examples/family/father.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,43 @@ +/** + * Father Example + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** settings **/ +// reasoner settings +reasoner = dig; +//digReasonerURL = "http://localhost:8081"; +//useRetrievalForClassification = true; +//refinement.useDIGMultiInstanceChecks = twoChecks; + +// algorithm settings +algorithm = refinement; + +// problem = posOnlyDefinition; + +// search tree protocol +refinement.writeSearchTree = false; +refinement.searchTreeFile = "log/searchFather.txt"; + +// control output +cli.checkSatisfiability = true; +cli.showIndividuals = false; +cli.showConcepts = false; +cli.showRoles = true; +cli.showSubsumptionHierarchy = false; + +import("father.kb"); +// import("father_incl.kb"); + +/** examples **/ ++stefan ++markus ++bernd +-heinz +-anna +-gabi +-michelle Copied: trunk/examples/family/father.kb (from rev 551, trunk/examples/father.kb) =================================================================== --- trunk/examples/family/father.kb (rev 0) +++ trunk/examples/family/father.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,16 @@ +BOTTOM = (male AND female). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +female(anna). +female(gabi). +female(michelle). + +// children +hasChild(stefan,markus). +hasChild(markus,anna). +hasChild(bernd,gabi). +hasChild(anna,heinz). Copied: trunk/examples/family/father.owl (from rev 551, trunk/examples/father.owl) =================================================================== --- trunk/examples/family/father.owl (rev 0) +++ trunk/examples/family/father.owl 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,35 @@ +<?xml version="1.0"?> +<rdf:RDF + xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" + xmlns:xsd="http://www.w3.org/2001/XMLSchema#" + xmlns="http://example.com/father#" + xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" + xmlns:owl="http://www.w3.org/2002/07/owl#" + xml:base="http://example.com/father"> + <owl:Ontology rdf:about=""/> + <owl:Class rdf:ID="female"/> + <owl:Class rdf:ID="male"> + <owl:equivalentClass> + <owl:Class> + <owl:complementOf rdf:resource="#female"/> + </owl:Class> + </owl:equivalentClass> + </owl:Class> + <owl:ObjectProperty rdf:ID="hasChild"/> + <male rdf:ID="markus"> + <hasChild> + <female rdf:ID="anna"> + <hasChild> + <male rdf:ID="heinz"/> + </hasChild> + </female> + </hasChild> + </male> + <male rdf:ID="stefan"> + <hasChild rdf:resource="#markus"/> + </male> + <female rdf:ID="michelle"/> + <male rdf:ID="martin"> + <hasChild rdf:resource="#heinz"/> + </male> +</rdf:RDF> Copied: trunk/examples/family/father2.conf (from rev 551, trunk/examples/father2.conf) =================================================================== --- trunk/examples/family/father2.conf (rev 0) +++ trunk/examples/family/father2.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,26 @@ +/** + * Another Father Example (this time using OWL import) + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +reasoner = dig; +import("father.owl"); + +// do not display http://example.com/father# in concepts +// and roles to make the output more readable +hidePrefix = "http://example.com/father#"; + +writeDIGProtocol = false; +digProtocolFile = "log/father2_dig.txt"; + +/** examples **/ ++"http://example.com/father#stefan" ++"http://example.com/father#markus" ++"http://example.com/father#martin" +-"http://example.com/father#heinz" +-"http://example.com/father#anna" +-"http://example.com/father#michelle" Copied: trunk/examples/family/fatherOld.conf (from rev 551, trunk/examples/fatherOld.conf) =================================================================== --- trunk/examples/family/fatherOld.conf (rev 0) +++ trunk/examples/family/fatherOld.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,58 @@ +/** + * Father Example + * + * possible solution: + * male AND EXISTS hasChild.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** settings **/ +// reasoner settings +reasoner = dig; +digReasonerURL = "http://localhost:8081"; +useRetrievalForClassification = true; +refinement.useDIGMultiInstanceChecks = twoChecks; + +// algorithm settings +algorithm = refinement; +refinement.horizontalExpansionFactor = 0.5; +refinement.quiet = false; + +// search tree protocol +refinement.writeSearchTree = false; +refinement.searchTreeFile = "log/searchTree.txt"; + +// control output +showIndividuals = true; +showConcepts = true; +showRoles = true; +showInternalKB = true; +showSubsumptionHierarchy = true; + +/** background knowledge ***/ +BOTTOM = (male AND female). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +female(anna). +female(gabi). +female(michelle). + +// children +hasChild(stefan,markus). +hasChild(markus,anna). +hasChild(bernd,gabi). +hasChild(anna,heinz). + +/** examples **/ ++father(stefan). ++father(markus). ++father(bernd). +-father(heinz). +-father(anna). +-father(gabi). +-father(michelle). Copied: trunk/examples/family/father_incl.kb (from rev 551, trunk/examples/father_incl.kb) =================================================================== --- trunk/examples/family/father_incl.kb (rev 0) +++ trunk/examples/family/father_incl.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,20 @@ +BOTTOM = (male AND female). + +// persons +male(markus). +male(stefan). +male(heinz). +male(bernd). +female(anna). +female(gabi). +female(michelle). + +// children +hasChild(stefan,markus). +hasChild(markus,anna). +hasChild(bernd,gabi). +hasChild(anna,heinz). + +// to learn the inclusion axiom father SUBCLASS OF male AND EXISTS hasChild.TOP +// properly, we have to specifiy explicity that heinz does not have children +NOT EXISTS hasChild.TOP(heinz). Copied: trunk/examples/family/grandfather.conf (from rev 551, trunk/examples/grandfather.conf) =================================================================== --- trunk/examples/family/grandfather.conf (rev 0) +++ trunk/examples/family/grandfather.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,85 @@ +/** + * Grandfather Example + * + * possible solution: + * male AND EXISTS hasChild.EXISTS hasChild.TOP + * + * Compared tp the father example, we have an additional concept person and + * and additional role married here to make the task more complex. + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** settings **/ +algorithm = refinement; +// refinement.heuristic = flexible; +// percentPerLengthUnit = 0.05; +refinement.horizontalExpansionFactor = 0.6; + +/** background knowledge **/ +male SUB person. +female SUB person. + +// disjunct concepts +(male AND female) SUB BOTTOM. + +Symmetric(married). +Functional(married). + +// persons +male(m1). +male(m2). +male(m3). +male(m4). +male(m5). +male(m6). +male(m7). +female(f1). +female(f2). +female(f3). +female(f4). +female(f5). +female(f6). +female(f7). +female(f8). + +// married-relations +married(m1,f1). +married(m2,f4). +married(m5,f5). +married(f6,m7). +married(m6,f8). + +// hasChild-relations +hasChild(m1,m2). +hasChild(m1,f2). +hasChild(m1,m5). +hasChild(f1,m2). +hasChild(f1,f2). +hasChild(f1,m5). + +hasChild(m2,m3). +hasChild(f4,m3). +hasChild(f2,f3). +hasChild(f2,m4). +hasChild(m5,f6). +hasChild(f5,f6). +hasChild(f6,m6). +hasChild(m7,m6). +hasChild(f8,f7). +hasChild(m6,f7). + +/** examples **/ ++grandfather(m1). +-grandfather(m2). +-grandfather(m3). +-grandfather(m4). ++grandfather(m5). +-grandfather(m6). ++grandfather(m7). +-grandfather(f1). +-grandfather(f2). +-grandfather(f3). +-grandfather(f4). +-grandfather(f5). +-grandfather(f6). Copied: trunk/examples/family/uncle.conf (from rev 551, trunk/examples/uncle.conf) =================================================================== --- trunk/examples/family/uncle.conf (rev 0) +++ trunk/examples/family/uncle.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,40 @@ +/** + * Uncle Example + * + * possible solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP + * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP)) + * + * The complexity of the learning task depends to a large extend on the length + * of the smallest possible solution. For this reason this is a very hard + * learning task, despite the simplicity of the background knowledge. + * + * Note: Currently the data is insufficient, i.e. it allows the algorithm to + * to find shorter correct solutions than the desired one above. + * + * Copyright (C) 2007, Jens Lehmann + */ + +refinement.writeSearchTree = false; +refinement.searchTreeFile = "log/search_uncle.txt"; + +digReasoner.writeDIGProtocol = false; +digReasoner.digProtocolFile = "log/dig_uncle.txt"; + +import("uncle.kb"); + +/** examples **/ ++heinrich ++alfred ++heinz ++hans ++alex +-jan +-markus +-susi +-anna +-maria +-katrin +-johanna +-mandy +-miriam +-hanna Copied: trunk/examples/family/uncle.kb (from rev 551, trunk/examples/uncle.kb) =================================================================== --- trunk/examples/family/uncle.kb (rev 0) +++ trunk/examples/family/uncle.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,44 @@ +BOTTOM = (male AND female). +Functional(married). +Symmetric(married). +Symmetric(hasSibling). + +male(heinrich). +male(jan). +male(markus). +male(alfred). +male(hans). +male(heinz). +male(alex). +female(susi). +female(anna). +female(maria). +female(katrin). +female(johanna). +female(mandy). +female(miriam). +female(hanna). + +married(heinrich,susi). +married(anna,jan). +married(alfred,katrin). +married(hans,johanna). + +hasSibling(susi,anna). +hasSibling(alfred,maria). +hasSibling(alfred,heinz). +hasSibling(heinz,maria). +hasSibling(johanna,mandy). +hasSibling(hanna,alex). + +hasChild(anna,alfred). +hasChild(anna,maria). +hasChild(anna,heinz). +hasChild(jan,alfred). +hasChild(jan,maria). +hasChild(jan,heinz). +hasChild(maria,markus). +hasChild(alfred,hans). +hasChild(katrin,hans). +hasChild(mandy,miriam). +hasChild(hanna,jan). Copied: trunk/examples/family/uncle.owl (from rev 551, trunk/examples/uncle.owl) =================================================================== --- trunk/examples/family/uncle.owl (rev 0) +++ trunk/examples/family/uncle.owl 2008-02-13 13:56:54 UTC (rev 564) @@ -0,0 +1,104 @@ +<?xml version="1.0" encoding="ISO-8859-1"?> +<!DOCTYPE rdf:RDF [ + <!ENTITY owl 'http://www.w3.org/2002/07/owl#'> +]> + +<rdf:RDF + xml:base="http://localhost/foo" + xmlns:a="http://localhost/foo#" + xmlns:owl="http://www.w3.org/2002/07/owl#" + xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" + xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"> + +<owl:Ontology rdf:about=""/> + +<owl:Class rdf:about="&owl;Nothing"> + <owl:equivalentClass> + <owl:Class> + <owl:intersectionOf rdf:parseType="Collection"> + <owl:Class rdf:about="#male"/> + <owl:Class rdf:about="#female"/> + </owl:intersectionOf> + </owl:Class> + </owl:equivalentClass> +</owl:Class> + +<owl:ObjectProperty rdf:ID="hasSibling"> + <rdf:type rdf:resource="&owl;SymmetricProperty"/> +</owl:ObjectProperty> + +<owl:ObjectProperty rdf:ID="married"> + <rdf:type rdf:resource="&owl;SymmetricProperty"/> + <rdf:type rdf:resource="&owl;FunctionalProperty"/> +</owl:ObjectProperty> + +<a:male rdf:ID="alex"/> + +<a:male rdf:ID="alfred"> + <a:hasChild rdf:resource="#hans"/> + <a:hasSibling rdf:resource="#heinz"/> + <a:hasSibling rdf:resource="#maria"/> + <a:married rdf:resource="#katrin"/> +</a:male> + +<a:female rdf:ID="anna"> + <a:hasChild rdf:resource="#alfred"/> + <a:hasChild rdf:resource="#heinz"/> + <a:hasChild rdf:resource="#maria"/> + <a:married rdf:resource="#jan"/> +</a:female> + +<a:female rdf:ID="hanna"> + <a:hasChild rdf:resource="#jan"/> + <a:hasSibling rdf:resource="#alex"/> +</a:female> + +<a:male rdf:ID="hans"> + <a:married rdf:resource="#johanna"/> +</a:male> + +<a:male rdf:ID="heinrich"> + <a:married rdf:resource="#susi"/> +</a:male> + +<a:male rdf:ID="heinz"> + <a:hasSibling rdf:resource="#maria"/> +</a:male> + +<a:male rdf:ID="jan"> + <a:hasChild rdf:resource="#alfred"/> + <a:hasChild rdf:resource="#heinz"/> + <a:hasChild rdf:resource="#maria"/> +</a:male> + +<a:female rdf:ID="johanna"> + <a:hasSibling rdf:resource="#mandy"/> +</a:female> + +<a:female rdf:ID="katrin"> + <a:hasChild rdf:resource="#hans"/> +</a:female> + +<a:female rdf:ID="mandy"> + <a:hasChild rdf:resource="#miriam"/> +</a:female> + +<a:female rdf:ID="maria"> + <a:hasChild rdf:resource="#markus"/> +</a:female> + +<a:male rdf:ID="markus"/> + +<a:female rdf:ID="miriam"/> + +<a:female rdf:ID="susi"> + <a:hasSibling rdf:resource="#anna"/> +</a:female> + +<owl:Class rdf:ID="female"/> + +<owl:Class rdf:ID="male"/> + +<owl:ObjectProperty rdf:ID="hasChild"/> + +</rdf:RDF> Deleted: trunk/examples/father.conf =================================================================== --- trunk/examples/father.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/father.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,43 +0,0 @@ -/** - * Father Example - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** settings **/ -// reasoner settings -reasoner = dig; -//digReasonerURL = "http://localhost:8081"; -//useRetrievalForClassification = true; -//refinement.useDIGMultiInstanceChecks = twoChecks; - -// algorithm settings -algorithm = refinement; - -// problem = posOnlyDefinition; - -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchFather.txt"; - -// control output -cli.checkSatisfiability = true; -cli.showIndividuals = false; -cli.showConcepts = false; -cli.showRoles = true; -cli.showSubsumptionHierarchy = false; - -import("father.kb"); -// import("father_incl.kb"); - -/** examples **/ -+stefan -+markus -+bernd --heinz --anna --gabi --michelle Deleted: trunk/examples/father.kb =================================================================== --- trunk/examples/father.kb 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/father.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -1,16 +0,0 @@ -BOTTOM = (male AND female). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -female(anna). -female(gabi). -female(michelle). - -// children -hasChild(stefan,markus). -hasChild(markus,anna). -hasChild(bernd,gabi). -hasChild(anna,heinz). Deleted: trunk/examples/father.owl =================================================================== --- trunk/examples/father.owl 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/father.owl 2008-02-13 13:56:54 UTC (rev 564) @@ -1,35 +0,0 @@ -<?xml version="1.0"?> -<rdf:RDF - xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" - xmlns:xsd="http://www.w3.org/2001/XMLSchema#" - xmlns="http://example.com/father#" - xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" - xmlns:owl="http://www.w3.org/2002/07/owl#" - xml:base="http://example.com/father"> - <owl:Ontology rdf:about=""/> - <owl:Class rdf:ID="female"/> - <owl:Class rdf:ID="male"> - <owl:equivalentClass> - <owl:Class> - <owl:complementOf rdf:resource="#female"/> - </owl:Class> - </owl:equivalentClass> - </owl:Class> - <owl:ObjectProperty rdf:ID="hasChild"/> - <male rdf:ID="markus"> - <hasChild> - <female rdf:ID="anna"> - <hasChild> - <male rdf:ID="heinz"/> - </hasChild> - </female> - </hasChild> - </male> - <male rdf:ID="stefan"> - <hasChild rdf:resource="#markus"/> - </male> - <female rdf:ID="michelle"/> - <male rdf:ID="martin"> - <hasChild rdf:resource="#heinz"/> - </male> -</rdf:RDF> Deleted: trunk/examples/father2.conf =================================================================== --- trunk/examples/father2.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/father2.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,26 +0,0 @@ -/** - * Another Father Example (this time using OWL import) - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -reasoner = dig; -import("father.owl"); - -// do not display http://example.com/father# in concepts -// and roles to make the output more readable -hidePrefix = "http://example.com/father#"; - -writeDIGProtocol = false; -digProtocolFile = "log/father2_dig.txt"; - -/** examples **/ -+"http://example.com/father#stefan" -+"http://example.com/father#markus" -+"http://example.com/father#martin" --"http://example.com/father#heinz" --"http://example.com/father#anna" --"http://example.com/father#michelle" Deleted: trunk/examples/fatherOld.conf =================================================================== --- trunk/examples/fatherOld.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/fatherOld.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,58 +0,0 @@ -/** - * Father Example - * - * possible solution: - * male AND EXISTS hasChild.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** settings **/ -// reasoner settings -reasoner = dig; -digReasonerURL = "http://localhost:8081"; -useRetrievalForClassification = true; -refinement.useDIGMultiInstanceChecks = twoChecks; - -// algorithm settings -algorithm = refinement; -refinement.horizontalExpansionFactor = 0.5; -refinement.quiet = false; - -// search tree protocol -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/searchTree.txt"; - -// control output -showIndividuals = true; -showConcepts = true; -showRoles = true; -showInternalKB = true; -showSubsumptionHierarchy = true; - -/** background knowledge ***/ -BOTTOM = (male AND female). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -female(anna). -female(gabi). -female(michelle). - -// children -hasChild(stefan,markus). -hasChild(markus,anna). -hasChild(bernd,gabi). -hasChild(anna,heinz). - -/** examples **/ -+father(stefan). -+father(markus). -+father(bernd). --father(heinz). --father(anna). --father(gabi). --father(michelle). Deleted: trunk/examples/father_incl.kb =================================================================== --- trunk/examples/father_incl.kb 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/father_incl.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -1,20 +0,0 @@ -BOTTOM = (male AND female). - -// persons -male(markus). -male(stefan). -male(heinz). -male(bernd). -female(anna). -female(gabi). -female(michelle). - -// children -hasChild(stefan,markus). -hasChild(markus,anna). -hasChild(bernd,gabi). -hasChild(anna,heinz). - -// to learn the inclusion axiom father SUBCLASS OF male AND EXISTS hasChild.TOP -// properly, we have to specifiy explicity that heinz does not have children -NOT EXISTS hasChild.TOP(heinz). Deleted: trunk/examples/grandfather.conf =================================================================== --- trunk/examples/grandfather.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/grandfather.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,85 +0,0 @@ -/** - * Grandfather Example - * - * possible solution: - * male AND EXISTS hasChild.EXISTS hasChild.TOP - * - * Compared tp the father example, we have an additional concept person and - * and additional role married here to make the task more complex. - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** settings **/ -algorithm = refinement; -// refinement.heuristic = flexible; -// percentPerLengthUnit = 0.05; -refinement.horizontalExpansionFactor = 0.6; - -/** background knowledge **/ -male SUB person. -female SUB person. - -// disjunct concepts -(male AND female) SUB BOTTOM. - -Symmetric(married). -Functional(married). - -// persons -male(m1). -male(m2). -male(m3). -male(m4). -male(m5). -male(m6). -male(m7). -female(f1). -female(f2). -female(f3). -female(f4). -female(f5). -female(f6). -female(f7). -female(f8). - -// married-relations -married(m1,f1). -married(m2,f4). -married(m5,f5). -married(f6,m7). -married(m6,f8). - -// hasChild-relations -hasChild(m1,m2). -hasChild(m1,f2). -hasChild(m1,m5). -hasChild(f1,m2). -hasChild(f1,f2). -hasChild(f1,m5). - -hasChild(m2,m3). -hasChild(f4,m3). -hasChild(f2,f3). -hasChild(f2,m4). -hasChild(m5,f6). -hasChild(f5,f6). -hasChild(f6,m6). -hasChild(m7,m6). -hasChild(f8,f7). -hasChild(m6,f7). - -/** examples **/ -+grandfather(m1). --grandfather(m2). --grandfather(m3). --grandfather(m4). -+grandfather(m5). --grandfather(m6). -+grandfather(m7). --grandfather(f1). --grandfather(f2). --grandfather(f3). --grandfather(f4). --grandfather(f5). --grandfather(f6). Deleted: trunk/examples/uncle.conf =================================================================== --- trunk/examples/uncle.conf 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/uncle.conf 2008-02-13 13:56:54 UTC (rev 564) @@ -1,40 +0,0 @@ -/** - * Uncle Example - * - * possible solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP - * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP)) - * - * The complexity of the learning task depends to a large extend on the length - * of the smallest possible solution. For this reason this is a very hard - * learning task, despite the simplicity of the background knowledge. - * - * Note: Currently the data is insufficient, i.e. it allows the algorithm to - * to find shorter correct solutions than the desired one above. - * - * Copyright (C) 2007, Jens Lehmann - */ - -refinement.writeSearchTree = false; -refinement.searchTreeFile = "log/search_uncle.txt"; - -digReasoner.writeDIGProtocol = false; -digReasoner.digProtocolFile = "log/dig_uncle.txt"; - -import("uncle.kb"); - -/** examples **/ -+heinrich -+alfred -+heinz -+hans -+alex --jan --markus --susi --anna --maria --katrin --johanna --mandy --miriam --hanna Deleted: trunk/examples/uncle.kb =================================================================== --- trunk/examples/uncle.kb 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/uncle.kb 2008-02-13 13:56:54 UTC (rev 564) @@ -1,44 +0,0 @@ -BOTTOM = (male AND female). -Functional(married). -Symmetric(married). -Symmetric(hasSibling). - -male(heinrich). -male(jan). -male(markus). -male(alfred). -male(hans). -male(heinz). -male(alex). -female(susi). -female(anna). -female(maria). -female(katrin). -female(johanna). -female(mandy). -female(miriam). -female(hanna). - -married(heinrich,susi). -married(anna,jan). -married(alfred,katrin). -married(hans,johanna). - -hasSibling(susi,anna). -hasSibling(alfred,maria). -hasSibling(alfred,heinz). -hasSibling(heinz,maria). -hasSibling(johanna,mandy). -hasSibling(hanna,alex). - -hasChild(anna,alfred). -hasChild(anna,maria). -hasChild(anna,heinz). -hasChild(jan,alfred). -hasChild(jan,maria). -hasChild(jan,heinz). -hasChild(maria,markus). -hasChild(alfred,hans). -hasChild(katrin,hans). -hasChild(mandy,miriam). -hasChild(hanna,jan). Deleted: trunk/examples/uncle.owl =================================================================== --- trunk/examples/uncle.owl 2008-02-13 13:55:23 UTC (rev 563) +++ trunk/examples/uncle.owl 2008-02-13 13:56:54 UTC (rev 564) @@ -1,104 +0,0 @@ -<?xml version="1.0" encoding="ISO-8859-1"?> -<!DOCTYPE rdf:RDF [ - <!ENTITY owl 'http://www.w3.org/2002/07/owl#'> -]> - -<rdf:RDF - xml:base="http://localhost/foo" - xmlns:a="http://localhost/foo#" - xmlns:owl="http://www.w3.org/2002/07/owl#" - xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" - xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"> - -<owl:Ontology rdf:about=""/> - -<owl:Class rdf:about="&owl;Nothing"> - <owl:equivalentClass> - <owl:Class> - <owl:intersectionOf rdf:parseType="Collection"> - <owl:Class rdf:about="#male"/> - <owl:Class rdf:about="#female"/> - </owl:intersectionOf> - </owl:Class> - </owl:equivalentClass> -</owl:Class> - -<owl:ObjectProperty rdf:ID="hasSibling"> - <rdf:type rdf:resource="&owl;SymmetricProperty"/> -</owl:ObjectProperty> - -<owl:ObjectProperty rdf:ID="married"> - <rdf:type rdf:resource="&owl;SymmetricProperty"/> - <rdf:type rdf:resource="&owl;FunctionalProperty"/> -</owl:ObjectProperty> - -<a:male rdf:ID="alex"/> - -<a:male rdf:ID="alfred"> - <a:hasChild rdf:resource="#hans"/> - <a:hasSibling rdf:resource="#heinz"/> - <a:hasSibling rdf:resource="#maria"/> - <a:married rdf:resource="#katrin"/> -</a:male> - -<a:female rdf:ID="anna"> - <a:hasChild rdf:resource="#alfred"/> - <a:hasChild rdf:resource="#heinz"/> - <a:hasChild rdf:resource="#maria"/> - <a:married rdf:resource="#jan"/> -</a:female> - -<a:female rdf:ID="hanna"> - <a:hasChild rdf:resource="#jan"/> - <a:hasSibling rdf:resource="#alex"/> -</a:female> - -<a:male rdf:ID="hans"> - <a:married rdf:resource="#johanna"/> -</a:male> - -<a:male rdf:ID="heinrich"> - <a:married rdf:resource="#susi"/> -</a:male> - -<a:male rdf:ID="heinz"> - <a:hasSibling rdf:resource="#maria"/> -</a:male> - -<a:male rdf:ID="jan"> - <a:hasChild rdf:resource="#alfred"/> - <a:hasChild rdf:resource="#heinz"/> - <a:hasChild rdf:resource="#maria"/> -</a:male> - -<a:female rdf:ID="johanna"> - <a:hasSibling rdf:resource="#mandy"/> -</a:female> - -<a:female rdf:ID="katrin"> - <a:hasChild rdf:resource="#hans"/> -</a:female> - -<a:female rdf:ID="mandy"> - <a:hasChild rdf:resource="#miriam"/> -</a:female> - -<a:female rdf:ID="maria"> - <a:hasChild rdf:resource="#markus"/> -</a:female> - -<a:male rdf:ID="markus"/> - -<a:female rdf:ID="miriam"/> - -<a:female rdf:ID="susi"> - <a:hasSibling rdf:resource="#anna"/> -</a:female> - -<owl:Class rdf:ID="female"/> - -<owl:Class rdf:ID="male"/> - -<owl:ObjectProperty rdf:ID="hasChild"/> - -</rdf:RDF> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 13:55:28
|
Revision: 563 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=563&view=rev Author: kurzum Date: 2008-02-13 05:55:23 -0800 (Wed, 13 Feb 2008) Log Message: ----------- folder examples family added a command list for copy and paste reasons Added Paths: ----------- trunk/examples/commandcollection.txt trunk/examples/family/ Added: trunk/examples/commandcollection.txt =================================================================== --- trunk/examples/commandcollection.txt (rev 0) +++ trunk/examples/commandcollection.txt 2008-02-13 13:55:23 UTC (rev 563) @@ -0,0 +1,47 @@ +// just a collection of options for copy and paste + +// control output +showIndividuals = true; +showConcepts = true; +showRoles = true; +showInternalKB = true; +showSubsumptionHierarchy = true; + +hidePrefix("http://localhost/foo#"); + +// reasoner settings +reasoner = dig; +digReasonerURL = "http://localhost:8081"; +useRetrievalForClassification = true; +refinement.useDIGMultiInstanceChecks = twoChecks; + +// algorithm settings +algorithm = refinement; +refinement.horizontalExpansionFactor = 0.6; +refinement.quiet = false; +refinement.useTooWeakList = true; + + +// search tree protocol +refinement.writeSearchTree = false; +refinement.searchTreeFile = "log/SearchTree.txt"; + + +//dig protocol +writeDIGProtocol = true; +digProtocolFile = "dig.log"; + +//knowledgesources +import("someFile.kb"); +import("someFile.owl"); + + +// SPARQL options +sparql.recursionDepth = 1; + +//predefined filter (1 = YAGO based learning) +sparql.predefinedFilter = 5; +sparql.predefinedEndpoint = 1; + +import("http://dbpedia.openlinksw.com:8890/sparql","SPARQL"); +sparql.instances = {}; This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 13:52:43
|
Revision: 562 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=562&view=rev Author: kurzum Date: 2008-02-13 05:52:29 -0800 (Wed, 13 Feb 2008) Log Message: ----------- updated arch picture Modified Paths: -------------- trunk/examples/arch/arch.png Modified: trunk/examples/arch/arch.png =================================================================== (Binary files differ) This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 11:39:57
|
Revision: 560 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=560&view=rev Author: kurzum Date: 2008-02-13 03:39:41 -0800 (Wed, 13 Feb 2008) Log Message: ----------- trains Modified Paths: -------------- trunk/examples/trains/trains.conf trunk/examples/trains/trains_owl.conf Modified: trunk/examples/trains/trains.conf =================================================================== --- trunk/examples/trains/trains.conf 2008-02-13 11:35:36 UTC (rev 559) +++ trunk/examples/trains/trains.conf 2008-02-13 11:39:41 UTC (rev 560) @@ -30,9 +30,10 @@ * Copyright (C) 2007, Jens Lehmann */ -// refinement.writeSearchTree = true; -// refinement.searchTreeFile = "log/searchTreeTrains.txt"; +/*Background knowledge*/ + + import("trains.kb"); /** examples **/ Modified: trunk/examples/trains/trains_owl.conf =================================================================== --- trunk/examples/trains/trains_owl.conf 2008-02-13 11:35:36 UTC (rev 559) +++ trunk/examples/trains/trains_owl.conf 2008-02-13 11:39:41 UTC (rev 560) @@ -5,19 +5,20 @@ * Copyright (C) 2007, Jens Lehmann */ +hidePrefix = "http://example.com/foo#"; + +/*Background knowledge*/ + import("trains.owl"); -algorithm = refinement; -refinement.quiet = false; -hidePrefix = "http://example.com/foo#"; - -+eastbound("http://example.com/foo#east1"). -+eastbound("http://example.com/foo#east2"). -+eastbound("http://example.com/foo#east3"). -+eastbound("http://example.com/foo#east4"). -+eastbound("http://example.com/foo#east5"). --eastbound("http://example.com/foo#west6"). --eastbound("http://example.com/foo#west7"). --eastbound("http://example.com/foo#west8"). --eastbound("http://example.com/foo#west9"). --eastbound("http://example.com/foo#west10"). +/*Examples*/ ++"http://example.com/foo#east1" ++"http://example.com/foo#east2" ++"http://example.com/foo#east3" ++"http://example.com/foo#east4" ++"http://example.com/foo#east5" +-"http://example.com/foo#west6" +-"http://example.com/foo#west7" +-"http://example.com/foo#west8" +-"http://example.com/foo#west9" +-"http://example.com/foo#west10" This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 11:35:44
|
Revision: 559 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=559&view=rev Author: kurzum Date: 2008-02-13 03:35:36 -0800 (Wed, 13 Feb 2008) Log Message: ----------- poker Modified Paths: -------------- trunk/examples/poker/pair.conf trunk/examples/poker/pair_owl.conf trunk/examples/poker/straight.conf trunk/examples/poker/straight_owl.conf Added Paths: ----------- trunk/examples/poker/pair.kb trunk/examples/poker/straight.kb Modified: trunk/examples/poker/pair.conf =================================================================== --- trunk/examples/poker/pair.conf 2008-02-13 11:15:53 UTC (rev 558) +++ trunk/examples/poker/pair.conf 2008-02-13 11:35:36 UTC (rev 559) @@ -9,1672 +9,57 @@ * Copyright (C) 2007, Jens Lehmann */ -deck(hand0). -card(card0). -hasCard(hand0,card0). -hasSuit(card0,hearts). -hasRank(card0,ten). -sameSuit(card0,card1). -sameSuit(card0,card2). -sameSuit(card0,card3). -sameSuit(card0,card4). -nextRank(card0,card1). +/*Background knowledge*/ -card(card1). -hasCard(hand0,card1). -hasSuit(card1,hearts). -hasRank(card1,jack). -sameSuit(card1,card2). -sameSuit(card1,card3). -sameSuit(card1,card4). -nextRank(card1,card3). +import("pair.kb"); -card(card2). -hasCard(hand0,card2). -hasSuit(card2,hearts). -hasRank(card2,king). -sameSuit(card2,card3). -sameSuit(card2,card4). -nextRank(card2,card4). - -card(card3). -hasCard(hand0,card3). -hasSuit(card3,hearts). -hasRank(card3,queen). -sameSuit(card3,card4). -nextRank(card3,card2). - -card(card4). -hasCard(hand0,card4). -hasSuit(card4,hearts). -hasRank(card4,ace). - --pair(hand0). - -deck(hand1). -card(card5). -hasCard(hand1,card5). -hasSuit(card5,spades). -hasRank(card5,jack). -sameSuit(card5,card6). -sameSuit(card5,card7). -sameSuit(card5,card8). -sameSuit(card5,card9). -nextRank(card5,card8). - -card(card6). -hasCard(hand1,card6). -hasSuit(card6,spades). -hasRank(card6,king). -sameSuit(card6,card7). -sameSuit(card6,card8). -sameSuit(card6,card9). -nextRank(card6,card9). - -card(card7). -hasCard(hand1,card7). -hasSuit(card7,spades). -hasRank(card7,ten). -sameSuit(card7,card8). -sameSuit(card7,card9). -nextRank(card7,card5). - -card(card8). -hasCard(hand1,card8). -hasSuit(card8,spades). -hasRank(card8,queen). -sameSuit(card8,card9). -nextRank(card8,card6). - -card(card9). -hasCard(hand1,card9). -hasSuit(card9,spades). -hasRank(card9,ace). - --pair(hand1). - -deck(hand2). -card(card10). -hasCard(hand2,card10). -hasSuit(card10,diamonds). -hasRank(card10,queen). -sameSuit(card10,card11). -sameSuit(card10,card12). -sameSuit(card10,card13). -sameSuit(card10,card14). -nextRank(card10,card12). - -card(card11). -hasCard(hand2,card11). -hasSuit(card11,diamonds). -hasRank(card11,jack). -sameSuit(card11,card12). -sameSuit(card11,card13). -sameSuit(card11,card14). -nextRank(card11,card10). - -card(card12). -hasCard(hand2,card12). -hasSuit(card12,diamonds). -hasRank(card12,king). -sameSuit(card12,card13). -sameSuit(card12,card14). -nextRank(card12,card14). - -card(card13). -hasCard(hand2,card13). -hasSuit(card13,diamonds). -hasRank(card13,ten). -sameSuit(card13,card14). -nextRank(card13,card11). - -card(card14). -hasCard(hand2,card14). -hasSuit(card14,diamonds). -hasRank(card14,ace). - --pair(hand2). - -deck(hand3). -card(card15). -hasCard(hand3,card15). -hasSuit(card15,clubs). -hasRank(card15,ten). -sameSuit(card15,card16). -sameSuit(card15,card17). -sameSuit(card15,card18). -sameSuit(card15,card19). -nextRank(card15,card16). - -card(card16). -hasCard(hand3,card16). -hasSuit(card16,clubs). -hasRank(card16,jack). -sameSuit(card16,card17). -sameSuit(card16,card18). -sameSuit(card16,card19). -nextRank(card16,card19). - -card(card17). -hasCard(hand3,card17). -hasSuit(card17,clubs). -hasRank(card17,ace). -sameSuit(card17,card18). -sameSuit(card17,card19). - -card(card18). -hasCard(hand3,card18). -hasSuit(card18,clubs). -hasRank(card18,king). -sameSuit(card18,card19). -nextRank(card18,card17). - -card(card19). -hasCard(hand3,card19). -hasSuit(card19,clubs). -hasRank(card19,queen). -nextRank(card19,card18). - --pair(hand3). - -deck(hand4). -card(card20). -hasCard(hand4,card20). -hasSuit(card20,hearts). -hasRank(card20,two). -sameSuit(card20,card21). -sameSuit(card20,card22). -sameSuit(card20,card23). -sameSuit(card20,card24). -nextRank(card20,card23). - -card(card21). -hasCard(hand4,card21). -hasSuit(card21,hearts). -hasRank(card21,four). -sameSuit(card21,card22). -sameSuit(card21,card23). -sameSuit(card21,card24). -nextRank(card21,card22). - -card(card22). -hasCard(hand4,card22). -hasSuit(card22,hearts). -hasRank(card22,five). -sameSuit(card22,card23). -sameSuit(card22,card24). -nextRank(card22,card24). - -card(card23). -hasCard(hand4,card23). -hasSuit(card23,hearts). -hasRank(card23,three). -sameSuit(card23,card24). -nextRank(card23,card21). - -card(card24). -hasCard(hand4,card24). -hasSuit(card24,hearts). -hasRank(card24,six). - --pair(hand4). - -deck(hand5). -card(card25). -hasCard(hand5,card25). -hasSuit(card25,hearts). -hasRank(card25,nine). -sameSuit(card25,card26). -sameSuit(card25,card27). -sameSuit(card25,card28). -sameSuit(card25,card29). -nextRank(card25,card27). - -card(card26). -hasCard(hand5,card26). -hasSuit(card26,hearts). -hasRank(card26,queen). -sameSuit(card26,card27). -sameSuit(card26,card28). -sameSuit(card26,card29). -nextRank(card26,card29). - -card(card27). -hasCard(hand5,card27). -hasSuit(card27,hearts). -hasRank(card27,ten). -sameSuit(card27,card28). -sameSuit(card27,card29). -nextRank(card27,card28). - -card(card28). -hasCard(hand5,card28). -hasSuit(card28,hearts). -hasRank(card28,jack). -sameSuit(card28,card29). -nextRank(card28,card26). - -card(card29). -hasCard(hand5,card29). -hasSuit(card29,hearts). -hasRank(card29,king). - --pair(hand5). - -deck(hand6). -card(card30). -hasCard(hand6,card30). -hasSuit(card30,spades). -hasRank(card30,ace). -sameSuit(card30,card31). -sameSuit(card30,card32). -sameSuit(card30,card33). -sameSuit(card30,card34). -nextRank(card30,card31). - -card(card31). -hasCard(hand6,card31). -hasSuit(card31,spades). -hasRank(card31,two). -sameSuit(card31,card32). -sameSuit(card31,card33). -sameSuit(card31,card34). -nextRank(card31,card32). - -card(card32). -hasCard(hand6,card32). -hasSuit(card32,spades). -hasRank(card32,three). -sameSuit(card32,card33). -sameSuit(card32,card34). -nextRank(card32,card33). - -card(card33). -hasCard(hand6,card33). -hasSuit(card33,spades). -hasRank(card33,four). -sameSuit(card33,card34). -nextRank(card33,card34). - -card(card34). -hasCard(hand6,card34). -hasSuit(card34,spades). -hasRank(card34,five). - --pair(hand6). - -deck(hand7). -card(card35). -hasCard(hand7,card35). -hasSuit(card35,diamonds). -hasRank(card35,five). -sameSuit(card35,card36). -sameSuit(card35,card37). -sameSuit(card35,card38). -sameSuit(card35,card39). -nextRank(card35,card36). - -card(card36). -hasCard(hand7,card36). -hasSuit(card36,diamonds). -hasRank(card36,six). -sameSuit(card36,card37). -sameSuit(card36,card38). -sameSuit(card36,card39). -nextRank(card36,card38). - -card(card37). -hasCard(hand7,card37). -hasSuit(card37,diamonds). -hasRank(card37,nine). -sameSuit(card37,card38). -sameSuit(card37,card39). - -card(card38). -hasCard(hand7,card38). -hasSuit(card38,diamonds). -hasRank(card38,seven). -sameSuit(card38,card39). -nextRank(card38,card39). - -card(card39). -hasCard(hand7,card39). -hasSuit(card39,diamonds). -hasRank(card39,eight). -nextRank(card39,card37). - --pair(hand7). - -deck(hand8). -card(card40). -hasCard(hand8,card40). -hasSuit(card40,clubs). -hasRank(card40,ace). -sameSuit(card40,card41). -sameSuit(card40,card42). -sameSuit(card40,card43). -sameSuit(card40,card44). -nextRank(card40,card42). - -card(card41). -hasCard(hand8,card41). -hasSuit(card41,clubs). -hasRank(card41,four). -sameSuit(card41,card42). -sameSuit(card41,card43). -sameSuit(card41,card44). -nextRank(card41,card44). - -card(card42). -hasCard(hand8,card42). -hasSuit(card42,clubs). -hasRank(card42,two). -sameSuit(card42,card43). -sameSuit(card42,card44). -nextRank(card42,card43). - -card(card43). -hasCard(hand8,card43). -hasSuit(card43,clubs). -hasRank(card43,three). -sameSuit(card43,card44). -nextRank(card43,card41). - -card(card44). -hasCard(hand8,card44). -hasSuit(card44,clubs). -hasRank(card44,five). - --pair(hand8). - -deck(hand9). -card(card45). -hasCard(hand9,card45). -hasSuit(card45,hearts). -hasRank(card45,ace). -sameRank(card45,card46). -sameSuit(card45,card48). - -card(card46). -hasCard(hand9,card46). -hasSuit(card46,spades). -hasRank(card46,ace). -sameSuit(card46,card49). - -card(card47). -hasCard(hand9,card47). -hasSuit(card47,diamonds). -hasRank(card47,nine). - -card(card48). -hasCard(hand9,card48). -hasSuit(card48,hearts). -hasRank(card48,five). - -card(card49). -hasCard(hand9,card49). -hasSuit(card49,spades). -hasRank(card49,three). - -+pair(hand9). - -deck(hand10). -card(card50). -hasCard(hand10,card50). -hasSuit(card50,spades). -hasRank(card50,six). -sameSuit(card50,card51). -sameSuit(card50,card53). - -card(card51). -hasCard(hand10,card51). -hasSuit(card51,spades). -hasRank(card51,ace). -sameSuit(card51,card53). - -card(card52). -hasCard(hand10,card52). -hasSuit(card52,clubs). -hasRank(card52,king). -sameSuit(card52,card54). -nextRank(card52,card51). - -card(card53). -hasCard(hand10,card53). -hasSuit(card53,spades). -hasRank(card53,four). - -card(card54). -hasCard(hand10,card54). -hasSuit(card54,clubs). -hasRank(card54,nine). - --pair(hand10). - -deck(hand11). -card(card55). -hasCard(hand11,card55). -hasSuit(card55,hearts). -hasRank(card55,ten). -sameSuit(card55,card57). -sameSuit(card55,card58). - -card(card56). -hasCard(hand11,card56). -hasSuit(card56,clubs). -hasRank(card56,six). - -card(card57). -hasCard(hand11,card57). -hasSuit(card57,hearts). -hasRank(card57,two). -sameSuit(card57,card58). - -card(card58). -hasCard(hand11,card58). -hasSuit(card58,hearts). -hasRank(card58,ace). -nextRank(card58,card57). - -card(card59). -hasCard(hand11,card59). -hasSuit(card59,diamonds). -hasRank(card59,eight). - --pair(hand11). - -deck(hand12). -card(card60). -hasCard(hand12,card60). -hasSuit(card60,spades). -hasRank(card60,king). -sameSuit(card60,card61). -sameSuit(card60,card64). -nextRank(card60,card61). - -card(card61). -hasCard(hand12,card61). -hasSuit(card61,spades). -hasRank(card61,ace). -sameSuit(card61,card64). - -card(card62). -hasCard(hand12,card62). -hasSuit(card62,clubs). -hasRank(card62,four). -nextRank(card62,card63). - -card(card63). -hasCard(hand12,card63). -hasSuit(card63,hearts). -hasRank(card63,five). - -card(card64). -hasCard(hand12,card64). -hasSuit(card64,spades). -hasRank(card64,jack). - --pair(hand12). - -deck(hand13). -card(card65). -hasCard(hand13,card65). -hasSuit(card65,diamonds). -hasRank(card65,eight). -sameSuit(card65,card67). -sameSuit(card65,card69). -nextRank(card65,card67). - -card(card66). -hasCard(hand13,card66). -hasSuit(card66,clubs). -hasRank(card66,queen). -sameSuit(card66,card68). - -card(card67). -hasCard(hand13,card67). -hasSuit(card67,diamonds). -hasRank(card67,nine). -sameSuit(card67,card69). - -card(card68). -hasCard(hand13,card68). -hasSuit(card68,clubs). -hasRank(card68,two). -sameRank(card68,card69). - -card(card69). -hasCard(hand13,card69). -hasSuit(card69,diamonds). -hasRank(card69,two). - -+pair(hand13). - -deck(hand14). -card(card70). -hasCard(hand14,card70). -hasSuit(card70,hearts). -hasRank(card70,three). -sameSuit(card70,card72). -nextRank(card70,card73). - -card(card71). -hasCard(hand14,card71). -hasSuit(card71,clubs). -hasRank(card71,seven). -sameSuit(card71,card74). - -card(card72). -hasCard(hand14,card72). -hasSuit(card72,hearts). -hasRank(card72,five). - -card(card73). -hasCard(hand14,card73). -hasSuit(card73,spades). -hasRank(card73,four). -nextRank(card73,card72). - -card(card74). -hasCard(hand14,card74). -hasSuit(card74,clubs). -hasRank(card74,king). - --pair(hand14). - -deck(hand15). -card(card75). -hasCard(hand15,card75). -hasSuit(card75,hearts). -hasRank(card75,four). -sameSuit(card75,card76). -sameSuit(card75,card77). -nextRank(card75,card78). - -card(card76). -hasCard(hand15,card76). -hasSuit(card76,hearts). -hasRank(card76,ace). -sameSuit(card76,card77). -nextRank(card76,card79). - -card(card77). -hasCard(hand15,card77). -hasSuit(card77,hearts). -hasRank(card77,three). -nextRank(card77,card75). - -card(card78). -hasCard(hand15,card78). -hasSuit(card78,diamonds). -hasRank(card78,five). -sameSuit(card78,card79). - -card(card79). -hasCard(hand15,card79). -hasSuit(card79,diamonds). -hasRank(card79,two). -nextRank(card79,card77). - --pair(hand15). - -deck(hand16). -card(card80). -hasCard(hand16,card80). -hasSuit(card80,diamonds). -hasRank(card80,eight). -sameSuit(card80,card81). - -card(card81). -hasCard(hand16,card81). -hasSuit(card81,diamonds). -hasRank(card81,queen). - -card(card82). -hasCard(hand16,card82). -hasSuit(card82,spades). -hasRank(card82,seven). -sameSuit(card82,card83). -nextRank(card82,card80). - -card(card83). -hasCard(hand16,card83). -hasSuit(card83,spades). -hasRank(card83,six). -nextRank(card83,card82). - -card(card84). -hasCard(hand16,card84). -hasSuit(card84,hearts). -hasRank(card84,two). - --pair(hand16). - -deck(hand17). -card(card85). -hasCard(hand17,card85). -hasSuit(card85,clubs). -hasRank(card85,eight). -sameSuit(card85,card87). -sameSuit(card85,card89). - -card(card86). -hasCard(hand17,card86). -hasSuit(card86,hearts). -hasRank(card86,jack). -nextRank(card86,card89). - -card(card87). -hasCard(hand17,card87). -hasSuit(card87,clubs). -hasRank(card87,six). -sameSuit(card87,card89). - -card(card88). -hasCard(hand17,card88). -hasSuit(card88,diamonds). -hasRank(card88,two). - -card(card89). -hasCard(hand17,card89). -hasSuit(card89,clubs). -hasRank(card89,queen). - --pair(hand17). - -deck(hand18). -card(card90). -hasCard(hand18,card90). -hasSuit(card90,diamonds). -hasRank(card90,seven). -sameRank(card90,card91). -sameSuit(card90,card94). - -card(card91). -hasCard(hand18,card91). -hasSuit(card91,spades). -hasRank(card91,seven). - -card(card92). -hasCard(hand18,card92). -hasSuit(card92,clubs). -hasRank(card92,jack). -nextRank(card92,card93). - -card(card93). -hasCard(hand18,card93). -hasSuit(card93,hearts). -hasRank(card93,queen). - -card(card94). -hasCard(hand18,card94). -hasSuit(card94,diamonds). -hasRank(card94,ace). - -+pair(hand18). - -deck(hand19). -card(card95). -hasCard(hand19,card95). -hasSuit(card95,hearts). -hasRank(card95,king). -sameRank(card95,card99). - -card(card96). -hasCard(hand19,card96). -hasSuit(card96,clubs). -hasRank(card96,eight). - -card(card97). -hasCard(hand19,card97). -hasSuit(card97,spades). -hasRank(card97,seven). -sameSuit(card97,card98). -nextRank(card97,card96). - -card(card98). -hasCard(hand19,card98). -hasSuit(card98,spades). -hasRank(card98,ten). - -card(card99). -hasCard(hand19,card99). -hasSuit(card99,diamonds). -hasRank(card99,king). - -+pair(hand19). - -deck(hand20). -card(card100). -hasCard(hand20,card100). -hasSuit(card100,spades). -hasRank(card100,six). -sameSuit(card100,card101). -nextRank(card100,card104). - -card(card101). -hasCard(hand20,card101). -hasSuit(card101,spades). -hasRank(card101,eight). - -card(card102). -hasCard(hand20,card102). -hasSuit(card102,hearts). -hasRank(card102,jack). -sameSuit(card102,card103). - -card(card103). -hasCard(hand20,card103). -hasSuit(card103,hearts). -hasRank(card103,four). - -card(card104). -hasCard(hand20,card104). -hasSuit(card104,diamonds). -hasRank(card104,seven). -nextRank(card104,card101). - --pair(hand20). - -deck(hand21). -card(card105). -hasCard(hand21,card105). -hasSuit(card105,diamonds). -hasRank(card105,ten). -sameRank(card105,card106). -sameSuit(card105,card109). - -card(card106). -hasCard(hand21,card106). -hasSuit(card106,spades). -hasRank(card106,ten). - -card(card107). -hasCard(hand21,card107). -hasSuit(card107,clubs). -hasRank(card107,five). - -card(card108). -hasCard(hand21,card108). -hasSuit(card108,hearts). -hasRank(card108,two). - -card(card109). -hasCard(hand21,card109). -hasSuit(card109,diamonds). -hasRank(card109,eight). - -+pair(hand21). - -deck(hand22). -card(card110). -hasCard(hand22,card110). -hasSuit(card110,spades). -hasRank(card110,ace). -sameRank(card110,card114). - -card(card111). -hasCard(hand22,card111). -hasSuit(card111,diamonds). -hasRank(card111,king). -nextRank(card111,card110). -nextRank(card111,card114). - -card(card112). -hasCard(hand22,card112). -hasSuit(card112,clubs). -hasRank(card112,six). -sameSuit(card112,card114). - -card(card113). -hasCard(hand22,card113). -hasSuit(card113,hearts). -hasRank(card113,nine). - -card(card114). -hasCard(hand22,card114). -hasSuit(card114,clubs). -hasRank(card114,ace). - -+pair(hand22). - -deck(hand23). -card(card115). -hasCard(hand23,card115). -hasSuit(card115,spades). -hasRank(card115,ten). -sameSuit(card115,card116). -sameSuit(card115,card119). - -card(card116). -hasCard(hand23,card116). -hasSuit(card116,spades). -hasRank(card116,eight). -sameRank(card116,card117). -sameSuit(card116,card119). - -card(card117). -hasCard(hand23,card117). -hasSuit(card117,hearts). -hasRank(card117,eight). - -card(card118). -hasCard(hand23,card118). -hasSuit(card118,diamonds). -hasRank(card118,two). - -card(card119). -hasCard(hand23,card119). -hasSuit(card119,spades). -hasRank(card119,king). - -+pair(hand23). - -deck(hand24). -card(card120). -hasCard(hand24,card120). -hasSuit(card120,spades). -hasRank(card120,king). - -card(card121). -hasCard(hand24,card121). -hasSuit(card121,hearts). -hasRank(card121,five). -sameRank(card121,card122). - -card(card122). -hasCard(hand24,card122). -hasSuit(card122,clubs). -hasRank(card122,five). -sameSuit(card122,card123). - -card(card123). -hasCard(hand24,card123). -hasSuit(card123,clubs). -hasRank(card123,eight). - -card(card124). -hasCard(hand24,card124). -hasSuit(card124,diamonds). -hasRank(card124,three). - -+pair(hand24). - -deck(hand25). -card(card125). -hasCard(hand25,card125). -hasSuit(card125,diamonds). -hasRank(card125,ace). -sameSuit(card125,card128). -sameRank(card125,card129). - -card(card126). -hasCard(hand25,card126). -hasSuit(card126,hearts). -hasRank(card126,five). -sameSuit(card126,card129). - -card(card127). -hasCard(hand25,card127). -hasSuit(card127,spades). -hasRank(card127,seven). - -card(card128). -hasCard(hand25,card128). -hasSuit(card128,diamonds). -hasRank(card128,king). -nextRank(card128,card125). -nextRank(card128,card129). - -card(card129). -hasCard(hand25,card129). -hasSuit(card129,hearts). -hasRank(card129,ace). - -+pair(hand25). - -deck(hand26). -card(card130). -hasCard(hand26,card130). -hasSuit(card130,hearts). -hasRank(card130,seven). -sameSuit(card130,card131). -sameSuit(card130,card133). -nextRank(card130,card132). - -card(card131). -hasCard(hand26,card131). -hasSuit(card131,hearts). -hasRank(card131,five). -sameSuit(card131,card133). -nextRank(card131,card133). -nextRank(card131,card134). - -card(card132). -hasCard(hand26,card132). -hasSuit(card132,clubs). -hasRank(card132,eight). - -card(card133). -hasCard(hand26,card133). -hasSuit(card133,hearts). -hasRank(card133,six). -sameRank(card133,card134). -nextRank(card133,card130). - -card(card134). -hasCard(hand26,card134). -hasSuit(card134,spades). -hasRank(card134,six). -nextRank(card134,card130). - -+pair(hand26). - -deck(hand27). -card(card135). -hasCard(hand27,card135). -hasSuit(card135,diamonds). -hasRank(card135,seven). -sameSuit(card135,card136). - -card(card136). -hasCard(hand27,card136). -hasSuit(card136,diamonds). -hasRank(card136,nine). - -card(card137). -hasCard(hand27,card137). -hasSuit(card137,spades). -hasRank(card137,queen). -sameSuit(card137,card138). - -card(card138). -hasCard(hand27,card138). -hasSuit(card138,spades). -hasRank(card138,five). - -card(card139). -hasCard(hand27,card139). -hasSuit(card139,clubs). -hasRank(card139,four). -nextRank(card139,card138). - --pair(hand27). - -deck(hand28). -card(card140). -hasCard(hand28,card140). -hasSuit(card140,spades). -hasRank(card140,ten). -sameSuit(card140,card144). - -card(card141). -hasCard(hand28,card141). -hasSuit(card141,hearts). -hasRank(card141,ace). -sameSuit(card141,card142). - -card(card142). -hasCard(hand28,card142). -hasSuit(card142,hearts). -hasRank(card142,queen). - -card(card143). -hasCard(hand28,card143). -hasSuit(card143,clubs). -hasRank(card143,six). - -card(card144). -hasCard(hand28,card144). -hasSuit(card144,spades). -hasRank(card144,eight). - --pair(hand28). - -deck(hand29). -card(card145). -hasCard(hand29,card145). -hasSuit(card145,diamonds). -hasRank(card145,king). -sameSuit(card145,card148). - -card(card146). -hasCard(hand29,card146). -hasSuit(card146,spades). -hasRank(card146,seven). -sameSuit(card146,card149). - -card(card147). -hasCard(hand29,card147). -hasSuit(card147,clubs). -hasRank(card147,jack). -sameRank(card147,card148). -sameRank(card147,card149). - -card(card148). -hasCard(hand29,card148). -hasSuit(card148,diamonds). -hasRank(card148,jack). -sameRank(card148,card149). - -card(card149). -hasCard(hand29,card149). -hasSuit(card149,spades). -hasRank(card149,jack). - -+pair(hand29). - -deck(hand30). -card(card150). -hasCard(hand30,card150). -hasSuit(card150,clubs). -hasRank(card150,two). - -card(card151). -hasCard(hand30,card151). -hasSuit(card151,spades). -hasRank(card151,seven). -sameSuit(card151,card153). - -card(card152). -hasCard(hand30,card152). -hasSuit(card152,diamonds). -hasRank(card152,king). -sameSuit(card152,card154). - -card(card153). -hasCard(hand30,card153). -hasSuit(card153,spades). -hasRank(card153,jack). - -card(card154). -hasCard(hand30,card154). -hasSuit(card154,diamonds). -hasRank(card154,ten). -nextRank(card154,card153). - --pair(hand30). - -deck(hand31). -card(card155). -hasCard(hand31,card155). -hasSuit(card155,hearts). -hasRank(card155,jack). -sameSuit(card155,card157). -sameSuit(card155,card159). - -card(card156). -hasCard(hand31,card156). -hasSuit(card156,spades). -hasRank(card156,seven). - -card(card157). -hasCard(hand31,card157). -hasSuit(card157,hearts). -hasRank(card157,six). -sameSuit(card157,card159). -nextRank(card157,card156). - -card(card158). -hasCard(hand31,card158). -hasSuit(card158,clubs). -hasRank(card158,two). - -card(card159). -hasCard(hand31,card159). -hasSuit(card159,hearts). -hasRank(card159,ace). -nextRank(card159,card158). - --pair(hand31). - -deck(hand32). -card(card160). -hasCard(hand32,card160). -hasSuit(card160,diamonds). -hasRank(card160,four). -sameSuit(card160,card162). -nextRank(card160,card162). - -card(card161). -hasCard(hand32,card161). -hasSuit(card161,clubs). -hasRank(card161,three). -nextRank(card161,card160). - -card(card162). -hasCard(hand32,card162). -hasSuit(card162,diamonds). -hasRank(card162,five). - -card(card163). -hasCard(hand32,card163). -hasSuit(card163,spades). -hasRank(card163,queen). - -card(card164). -hasCard(hand32,card164). -hasSuit(card164,hearts). -hasRank(card164,nine). - --pair(hand32). - -deck(hand33). -card(card165). -hasCard(hand33,card165). -hasSuit(card165,diamonds). -hasRank(card165,two). -nextRank(card165,card168). - -card(card166). -hasCard(hand33,card166). -hasSuit(card166,hearts). -hasRank(card166,six). - -card(card167). -hasCard(hand33,card167). -hasSuit(card167,spades). -hasRank(card167,jack). -sameSuit(card167,card169). - -card(card168). -hasCard(hand33,card168). -hasSuit(card168,clubs). -hasRank(card168,three). - -card(card169). -hasCard(hand33,card169). -hasSuit(card169,spades). -hasRank(card169,ten). -nextRank(card169,card167). - --pair(hand33). - -deck(hand34). -card(card170). -hasCard(hand34,card170). -hasSuit(card170,clubs). -hasRank(card170,eight). -sameSuit(card170,card171). -sameSuit(card170,card172). -sameSuit(card170,card173). - -card(card171). -hasCard(hand34,card171). -hasSuit(card171,clubs). -hasRank(card171,three). -sameSuit(card171,card172). -sameSuit(card171,card173). - -card(card172). -hasCard(hand34,card172). -hasSuit(card172,clubs). -hasRank(card172,king). -sameSuit(card172,card173). -nextRank(card172,card174). - -card(card173). -hasCard(hand34,card173). -hasSuit(card173,clubs). -hasRank(card173,queen). -nextRank(card173,card172). - -card(card174). -hasCard(hand34,card174). -hasSuit(card174,hearts). -hasRank(card174,ace). - --pair(hand34). - -deck(hand35). -card(card175). -hasCard(hand35,card175). -hasSuit(card175,spades). -hasRank(card175,six). -sameSuit(card175,card178). - -card(card176). -hasCard(hand35,card176). -hasSuit(card176,clubs). -hasRank(card176,eight). -sameSuit(card176,card177). - -card(card177). -hasCard(hand35,card177). -hasSuit(card177,clubs). -hasRank(card177,three). - -card(card178). -hasCard(hand35,card178). -hasSuit(card178,spades). -hasRank(card178,two). -sameRank(card178,card179). -nextRank(card178,card177). - -card(card179). -hasCard(hand35,card179). -hasSuit(card179,hearts). -hasRank(card179,two). -nextRank(card179,card177). - -+pair(hand35). - -deck(hand36). -card(card180). -hasCard(hand36,card180). -hasSuit(card180,clubs). -hasRank(card180,king). - -card(card181). -hasCard(hand36,card181). -hasSuit(card181,hearts). -hasRank(card181,six). -sameSuit(card181,card183). - -card(card182). -hasCard(hand36,card182). -hasSuit(card182,diamonds). -hasRank(card182,eight). - -card(card183). -hasCard(hand36,card183). -hasSuit(card183,hearts). -hasRank(card183,three). -sameRank(card183,card184). - -card(card184). -hasCard(hand36,card184). -hasSuit(card184,spades). -hasRank(card184,three). - -+pair(hand36). - -deck(hand37). -card(card185). -hasCard(hand37,card185). -hasSuit(card185,spades). -hasRank(card185,nine). -sameSuit(card185,card186). -nextRank(card185,card186). - -card(card186). -hasCard(hand37,card186). -hasSuit(card186,spades). -hasRank(card186,ten). -nextRank(card186,card187). - -card(card187). -hasCard(hand37,card187). -hasSuit(card187,clubs). -hasRank(card187,jack). -sameSuit(card187,card188). -sameSuit(card187,card189). - -card(card188). -hasCard(hand37,card188). -hasSuit(card188,clubs). -hasRank(card188,seven). -sameSuit(card188,card189). - -card(card189). -hasCard(hand37,card189). -hasSuit(card189,clubs). -hasRank(card189,three). - --pair(hand37). - -deck(hand38). -card(card190). -hasCard(hand38,card190). -hasSuit(card190,spades). -hasRank(card190,ten). -sameSuit(card190,card193). -sameSuit(card190,card194). - -card(card191). -hasCard(hand38,card191). -hasSuit(card191,diamonds). -hasRank(card191,queen). -nextRank(card191,card194). - -card(card192). -hasCard(hand38,card192). -hasSuit(card192,hearts). -hasRank(card192,two). -sameRank(card192,card193). - -card(card193). -hasCard(hand38,card193). -hasSuit(card193,spades). -hasRank(card193,two). -sameSuit(card193,card194). - -card(card194). -hasCard(hand38,card194). -hasSuit(card194,spades). -hasRank(card194,king). - -+pair(hand38). - -deck(hand39). -card(card195). -hasCard(hand39,card195). -hasSuit(card195,spades). -hasRank(card195,five). -sameSuit(card195,card196). -sameSuit(card195,card197). - -card(card196). -hasCard(hand39,card196). -hasSuit(card196,spades). -hasRank(card196,queen). -sameSuit(card196,card197). - -card(card197). -hasCard(hand39,card197). -hasSuit(card197,spades). -hasRank(card197,three). -sameRank(card197,card199). - -card(card198). -hasCard(hand39,card198). -hasSuit(card198,hearts). -hasRank(card198,two). -nextRank(card198,card197). -nextRank(card198,card199). - -card(card199). -hasCard(hand39,card199). -hasSuit(card199,diamonds). -hasRank(card199,three). - -+pair(hand39). - -deck(hand40). -card(card200). -hasCard(hand40,card200). -hasSuit(card200,spades). -hasRank(card200,eight). -sameSuit(card200,card202). -sameRank(card200,card204). - -card(card201). -hasCard(hand40,card201). -hasSuit(card201,diamonds). -hasRank(card201,two). - -card(card202). -hasCard(hand40,card202). -hasSuit(card202,spades). -hasRank(card202,five). - -card(card203). -hasCard(hand40,card203). -hasSuit(card203,hearts). -hasRank(card203,queen). - -card(card204). -hasCard(hand40,card204). -hasSuit(card204,clubs). -hasRank(card204,eight). - -+pair(hand40). - -deck(hand41). -card(card205). -hasCard(hand41,card205). -hasSuit(card205,spades). -hasRank(card205,ace). - -card(card206). -hasCard(hand41,card206). -hasSuit(card206,clubs). -hasRank(card206,seven). -sameSuit(card206,card207). -sameSuit(card206,card208). - -card(card207). -hasCard(hand41,card207). -hasSuit(card207,clubs). -hasRank(card207,six). -sameSuit(card207,card208). -nextRank(card207,card206). - -card(card208). -hasCard(hand41,card208). -hasSuit(card208,clubs). -hasRank(card208,five). -sameRank(card208,card209). -nextRank(card208,card207). - -card(card209). -hasCard(hand41,card209). -hasSuit(card209,hearts). -hasRank(card209,five). -nextRank(card209,card207). - -+pair(hand41). - -deck(hand42). -card(card210). -hasCard(hand42,card210). -hasSuit(card210,diamonds). -hasRank(card210,king). -sameSuit(card210,card212). -nextRank(card210,card211). - -card(card211). -hasCard(hand42,card211). -hasSuit(card211,spades). -hasRank(card211,ace). -sameSuit(card211,card214). - -card(card212). -hasCard(hand42,card212). -hasSuit(card212,diamonds). -hasRank(card212,seven). - -card(card213). -hasCard(hand42,card213). -hasSuit(card213,hearts). -hasRank(card213,three). - -card(card214). -hasCard(hand42,card214). -hasSuit(card214,spades). -hasRank(card214,six). -nextRank(card214,card212). - --pair(hand42). - -deck(hand43). -card(card215). -hasCard(hand43,card215). -hasSuit(card215,clubs). -hasRank(card215,ten). -sameSuit(card215,card216). -sameRank(card215,card219). - -card(card216). -hasCard(hand43,card216). -hasSuit(card216,clubs). -hasRank(card216,king). - -card(card217). -hasCard(hand43,card217). -hasSuit(card217,diamonds). -hasRank(card217,five). - -card(card218). -hasCard(hand43,card218). -hasSuit(card218,spades). -hasRank(card218,eight). - -card(card219). -hasCard(hand43,card219). -hasSuit(card219,hearts). -hasRank(card219,ten). - -+pair(hand43). - -deck(hand44). -card(card220). -hasCard(hand44,card220). -hasSuit(card220,hearts). -hasRank(card220,two). -sameSuit(card220,card221). -sameSuit(card220,card223). - -card(card221). -hasCard(hand44,card221). -hasSuit(card221,hearts). -hasRank(card221,jack). -sameSuit(card221,card223). - -card(card222). -hasCard(hand44,card222). -hasSuit(card222,diamonds). -hasRank(card222,nine). -sameSuit(card222,card224). - -card(card223). -hasCard(hand44,card223). -hasSuit(card223,hearts). -hasRank(card223,seven). - -card(card224). -hasCard(hand44,card224). -hasSuit(card224,diamonds). -hasRank(card224,five). - --pair(hand44). - -deck(hand45). -card(card225). -hasCard(hand45,card225). -hasSuit(card225,spades). -hasRank(card225,two). -sameSuit(card225,card227). -sameSuit(card225,card228). - -card(card226). -hasCard(hand45,card226). -hasSuit(card226,diamonds). -hasRank(card226,ace). -nextRank(card226,card225). - -card(card227). -hasCard(hand45,card227). -hasSuit(card227,spades). -hasRank(card227,jack). -sameSuit(card227,card228). - -card(card228). -hasCard(hand45,card228). -hasSuit(card228,spades). -hasRank(card228,six). - -card(card229). -hasCard(hand45,card229). -hasSuit(card229,clubs). -hasRank(card229,four). - --pair(hand45). - -deck(hand46). -card(card230). -hasCard(hand46,card230). -hasSuit(card230,hearts). -hasRank(card230,ten). -sameSuit(card230,card234). - -card(card231). -hasCard(hand46,card231). -hasSuit(card231,clubs). -hasRank(card231,ace). -sameSuit(card231,card232). -sameSuit(card231,card233). - -card(card232). -hasCard(hand46,card232). -hasSuit(card232,clubs). -hasRank(card232,four). -sameSuit(card232,card233). - -card(card233). -hasCard(hand46,card233). -hasSuit(card233,clubs). -hasRank(card233,queen). - -card(card234). -hasCard(hand46,card234). -hasSuit(card234,hearts). -hasRank(card234,nine). -nextRank(card234,card230). - --pair(hand46). - -deck(hand47). -card(card235). -hasCard(hand47,card235). -hasSuit(card235,clubs). -hasRank(card235,nine). -sameRank(card235,card238). -sameSuit(card235,card239). - -card(card236). -hasCard(hand47,card236). -hasSuit(card236,diamonds). -hasRank(card236,king). -sameSuit(card236,card238). -nextRank(card236,card237). - -card(card237). -hasCard(hand47,card237). -hasSuit(card237,spades). -hasRank(card237,ace). - -card(card238). -hasCard(hand47,card238). -hasSuit(card238,diamonds). -hasRank(card238,nine). - -card(card239). -hasCard(hand47,card239). -hasSuit(card239,clubs). -hasRank(card239,queen). -nextRank(card239,card236). - -+pair(hand47). - -deck(hand48). -card(card240). -hasCard(hand48,card240). -hasSuit(card240,clubs). -hasRank(card240,ace). -sameRank(card240,card241). -sameSuit(card240,card243). - -card(card241). -hasCard(hand48,card241). -hasSuit(card241,diamonds). -hasRank(card241,ace). - -card(card242). -hasCard(hand48,card242). -hasSuit(card242,hearts). -hasRank(card242,three). -nextRank(card242,card243). - -card(card243). -hasCard(hand48,card243). -hasSuit(card243,clubs). -hasRank(card243,four). - -card(card244). -hasCard(hand48,card244). -hasSuit(card244,spades). -hasRank(card244,jack). - -+pair(hand48). - +/*Examples*/ +-"http://localhost/foo#hand0" +-"http://localhost/foo#hand1" +-"http://localhost/foo#hand2" +-"http://localhost/foo#hand3" +-"http://localhost/foo#hand4" +-"http://localhost/foo#hand5" +-"http://localhost/foo#hand6" +-"http://localhost/foo#hand7" +-"http://localhost/foo#hand8" ++"http://localhost/foo#hand9" +-"http://localhost/foo#hand10" +-"http://localhost/foo#hand11" +-"http://localhost/foo#hand12" ++"http://localhost/foo#hand13" +-"http://localhost/foo#hand14" +-"http://localhost/foo#hand15" +-"http://localhost/foo#hand16" +-"http://localhost/foo#hand17" ++"http://localhost/foo#hand18" ++"http://localhost/foo#hand19" +-"http://localhost/foo#hand20" ++"http://localhost/foo#hand21" ++"http://localhost/foo#hand22" ++"http://localhost/foo#hand23" ++"http://localhost/foo#hand24" ++"http://localhost/foo#hand25" ++"http://localhost/foo#hand26" +-"http://localhost/foo#hand27" +-"http://localhost/foo#hand28" ++"http://localhost/foo#hand29" +-"http://localhost/foo#hand30" +-"http://localhost/foo#hand31" +-"http://localhost/foo#hand32" +-"http://localhost/foo#hand33" +-"http://localhost/foo#hand34" ++"http://localhost/foo#hand35" ++"http://localhost/foo#hand36" +-"http://localhost/foo#hand37" ++"http://localhost/foo#hand38" ++"http://localhost/foo#hand39" ++"http://localhost/foo#hand40" ++"http://localhost/foo#hand41" +-"http://localhost/foo#hand42" ++"http://localhost/foo#hand43" +-"http://localhost/foo#hand44" +-"http://localhost/foo#hand45" +-"http://localhost/foo#hand46" ++"http://localhost/foo#hand47" ++"http://localhost/foo#hand48" Added: trunk/examples/poker/pair.kb =================================================================== --- trunk/examples/poker/pair.kb (rev 0) +++ trunk/examples/poker/pair.kb 2008-02-13 11:35:36 UTC (rev 559) @@ -0,0 +1,1680 @@ +/** + * Automatically created random poker decks (the UCI-ML-Repository Poker example + * was transformed to a conf file). The goal is to learn the concept of a pair + * (two cards with equal rank). + * + * possible solution: + * EXISTS hasCard.EXISTS sameRank.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +deck(hand0). +card(card0). +hasCard(hand0,card0). +hasSuit(card0,hearts). +hasRank(card0,ten). +sameSuit(card0,card1). +sameSuit(card0,card2). +sameSuit(card0,card3). +sameSuit(card0,card4). +nextRank(card0,card1). + +card(card1). +hasCard(hand0,card1). +hasSuit(card1,hearts). +hasRank(card1,jack). +sameSuit(card1,card2). +sameSuit(card1,card3). +sameSuit(card1,card4). +nextRank(card1,card3). + +card(card2). +hasCard(hand0,card2). +hasSuit(card2,hearts). +hasRank(card2,king). +sameSuit(card2,card3). +sameSuit(card2,card4). +nextRank(card2,card4). + +card(card3). +hasCard(hand0,card3). +hasSuit(card3,hearts). +hasRank(card3,queen). +sameSuit(card3,card4). +nextRank(card3,card2). + +card(card4). +hasCard(hand0,card4). +hasSuit(card4,hearts). +hasRank(card4,ace). + + + +deck(hand1). +card(card5). +hasCard(hand1,card5). +hasSuit(card5,spades). +hasRank(card5,jack). +sameSuit(card5,card6). +sameSuit(card5,card7). +sameSuit(card5,card8). +sameSuit(card5,card9). +nextRank(card5,card8). + +card(card6). +hasCard(hand1,card6). +hasSuit(card6,spades). +hasRank(card6,king). +sameSuit(card6,card7). +sameSuit(card6,card8). +sameSuit(card6,card9). +nextRank(card6,card9). + +card(card7). +hasCard(hand1,card7). +hasSuit(card7,spades). +hasRank(card7,ten). +sameSuit(card7,card8). +sameSuit(card7,card9). +nextRank(card7,card5). + +card(card8). +hasCard(hand1,card8). +hasSuit(card8,spades). +hasRank(card8,queen). +sameSuit(card8,card9). +nextRank(card8,card6). + +card(card9). +hasCard(hand1,card9). +hasSuit(card9,spades). +hasRank(card9,ace). + + + +deck(hand2). +card(card10). +hasCard(hand2,card10). +hasSuit(card10,diamonds). +hasRank(card10,queen). +sameSuit(card10,card11). +sameSuit(card10,card12). +sameSuit(card10,card13). +sameSuit(card10,card14). +nextRank(card10,card12). + +card(card11). +hasCard(hand2,card11). +hasSuit(card11,diamonds). +hasRank(card11,jack). +sameSuit(card11,card12). +sameSuit(card11,card13). +sameSuit(card11,card14). +nextRank(card11,card10). + +card(card12). +hasCard(hand2,card12). +hasSuit(card12,diamonds). +hasRank(card12,king). +sameSuit(card12,card13). +sameSuit(card12,card14). +nextRank(card12,card14). + +card(card13). +hasCard(hand2,card13). +hasSuit(card13,diamonds). +hasRank(card13,ten). +sameSuit(card13,card14). +nextRank(card13,card11). + +card(card14). +hasCard(hand2,card14). +hasSuit(card14,diamonds). +hasRank(card14,ace). + + + +deck(hand3). +card(card15). +hasCard(hand3,card15). +hasSuit(card15,clubs). +hasRank(card15,ten). +sameSuit(card15,card16). +sameSuit(card15,card17). +sameSuit(card15,card18). +sameSuit(card15,card19). +nextRank(card15,card16). + +card(card16). +hasCard(hand3,card16). +hasSuit(card16,clubs). +hasRank(card16,jack). +sameSuit(card16,card17). +sameSuit(card16,card18). +sameSuit(card16,card19). +nextRank(card16,card19). + +card(card17). +hasCard(hand3,card17). +hasSuit(card17,clubs). +hasRank(card17,ace). +sameSuit(card17,card18). +sameSuit(card17,card19). + +card(card18). +hasCard(hand3,card18). +hasSuit(card18,clubs). +hasRank(card18,king). +sameSuit(card18,card19). +nextRank(card18,card17). + +card(card19). +hasCard(hand3,card19). +hasSuit(card19,clubs). +hasRank(card19,queen). +nextRank(card19,card18). + + + +deck(hand4). +card(card20). +hasCard(hand4,card20). +hasSuit(card20,hearts). +hasRank(card20,two). +sameSuit(card20,card21). +sameSuit(card20,card22). +sameSuit(card20,card23). +sameSuit(card20,card24). +nextRank(card20,card23). + +card(card21). +hasCard(hand4,card21). +hasSuit(card21,hearts). +hasRank(card21,four). +sameSuit(card21,card22). +sameSuit(card21,card23). +sameSuit(card21,card24). +nextRank(card21,card22). + +card(card22). +hasCard(hand4,card22). +hasSuit(card22,hearts). +hasRank(card22,five). +sameSuit(card22,card23). +sameSuit(card22,card24). +nextRank(card22,card24). + +card(card23). +hasCard(hand4,card23). +hasSuit(card23,hearts). +hasRank(card23,three). +sameSuit(card23,card24). +nextRank(card23,card21). + +card(card24). +hasCard(hand4,card24). +hasSuit(card24,hearts). +hasRank(card24,six). + + + +deck(hand5). +card(card25). +hasCard(hand5,card25). +hasSuit(card25,hearts). +hasRank(card25,nine). +sameSuit(card25,card26). +sameSuit(card25,card27). +sameSuit(card25,card28). +sameSuit(card25,card29). +nextRank(card25,card27). + +card(card26). +hasCard(hand5,card26). +hasSuit(card26,hearts). +hasRank(card26,queen). +sameSuit(card26,card27). +sameSuit(card26,card28). +sameSuit(card26,card29). +nextRank(card26,card29). + +card(card27). +hasCard(hand5,card27). +hasSuit(card27,hearts). +hasRank(card27,ten). +sameSuit(card27,card28). +sameSuit(card27,card29). +nextRank(card27,card28). + +card(card28). +hasCard(hand5,card28). +hasSuit(card28,hearts). +hasRank(card28,jack). +sameSuit(card28,card29). +nextRank(card28,card26). + +card(card29). +hasCard(hand5,card29). +hasSuit(card29,hearts). +hasRank(card29,king). + + + +deck(hand6). +card(card30). +hasCard(hand6,card30). +hasSuit(card30,spades). +hasRank(card30,ace). +sameSuit(card30,card31). +sameSuit(card30,card32). +sameSuit(card30,card33). +sameSuit(card30,card34). +nextRank(card30,card31). + +card(card31). +hasCard(hand6,card31). +hasSuit(card31,spades). +hasRank(card31,two). +sameSuit(card31,card32). +sameSuit(card31,card33). +sameSuit(card31,card34). +nextRank(card31,card32). + +card(card32). +hasCard(hand6,card32). +hasSuit(card32,spades). +hasRank(card32,three). +sameSuit(card32,card33). +sameSuit(card32,card34). +nextRank(card32,card33). + +card(card33). +hasCard(hand6,card33). +hasSuit(card33,spades). +hasRank(card33,four). +sameSuit(card33,card34). +nextRank(card33,card34). + +card(card34). +hasCard(hand6,card34). +hasSuit(card34,spades). +hasRank(card34,five). + + + +deck(hand7). +card(card35). +hasCard(hand7,card35). +hasSuit(card35,diamonds). +hasRank(card35,five). +sameSuit(card35,card36). +sameSuit(card35,card37). +sameSuit(card35,card38). +sameSuit(card35,card39). +nextRank(card35,card36). + +card(card36). +hasCard(hand7,card36). +hasSuit(card36,diamonds). +hasRank(card36,six). +sameSuit(card36,card37). +sameSuit(card36,card38). +sameSuit(card36,card39). +nextRank(card36,card38). + +card(card37). +hasCard(hand7,card37). +hasSuit(card37,diamonds). +hasRank(card37,nine). +sameSuit(card37,card38). +sameSuit(card37,card39). + +card(card38). +hasCard(hand7,card38). +hasSuit(card38,diamonds). +hasRank(card38,seven). +sameSuit(card38,card39). +nextRank(card38,card39). + +card(card39). +hasCard(hand7,card39). +hasSuit(card39,diamonds). +hasRank(card39,eight). +nextRank(card39,card37). + + + +deck(hand8). +card(card40). +hasCard(hand8,card40). +hasSuit(card40,clubs). +hasRank(card40,ace). +sameSuit(card40,card41). +sameSuit(card40,card42). +sameSuit(card40,card43). +sameSuit(card40,card44). +nextRank(card40,card42). + +card(card41). +hasCard(hand8,card41). +hasSuit(card41,clubs). +hasRank(card41,four). +sameSuit(card41,card42). +sameSuit(card41,card43). +sameSuit(card41,card44). +nextRank(card41,card44). + +card(card42). +hasCard(hand8,card42). +hasSuit(card42,clubs). +hasRank(card42,two). +sameSuit(card42,card43). +sameSuit(card42,card44). +nextRank(card42,card43). + +card(card43). +hasCard(hand8,card43). +hasSuit(card43,clubs). +hasRank(card43,three). +sameSuit(card43,card44). +nextRank(card43,card41). + +card(card44). +hasCard(hand8,card44). +hasSuit(card44,clubs). +hasRank(card44,five). + + + +deck(hand9). +card(card45). +hasCard(hand9,card45). +hasSuit(card45,hearts). +hasRank(card45,ace). +sameRank(card45,card46). +sameSuit(card45,card48). + +card(card46). +hasCard(hand9,card46). +hasSuit(card46,spades). +hasRank(card46,ace). +sameSuit(card46,card49). + +card(card47). +hasCard(hand9,card47). +hasSuit(card47,diamonds). +hasRank(card47,nine). + +card(card48). +hasCard(hand9,card48). +hasSuit(card48,hearts). +hasRank(card48,five). + +card(card49). +hasCard(hand9,card49). +hasSuit(card49,spades). +hasRank(card49,three). + + + +deck(hand10). +card(card50). +hasCard(hand10,card50). +hasSuit(card50,spades). +hasRank(card50,six). +sameSuit(card50,card51). +sameSuit(card50,card53). + +card(card51). +hasCard(hand10,card51). +hasSuit(card51,spades). +hasRank(card51,ace). +sameSuit(card51,card53). + +card(card52). +hasCard(hand10,card52). +hasSuit(card52,clubs). +hasRank(card52,king). +sameSuit(card52,card54). +nextRank(card52,card51). + +card(card53). +hasCard(hand10,card53). +hasSuit(card53,spades). +hasRank(card53,four). + +card(card54). +hasCard(hand10,card54). +hasSuit(card54,clubs). +hasRank(card54,nine). + + + +deck(hand11). +card(card55). +hasCard(hand11,card55). +hasSuit(card55,hearts). +hasRank(card55,ten). +sameSuit(card55,card57). +sameSuit(card55,card58). + +card(card56). +hasCard(hand11,card56). +hasSuit(card56,clubs). +hasRank(card56,six). + +card(card57). +hasCard(hand11,card57). +hasSuit(card57,hearts). +hasRank(card57,two). +sameSuit(card57,card58). + +card(card58). +hasCard(hand11,card58). +hasSuit(card58,hearts). +hasRank(card58,ace). +nextRank(card58,card57). + +card(card59). +hasCard(hand11,card59). +hasSuit(card59,diamonds). +hasRank(card59,eight). + + + +deck(hand12). +card(card60). +hasCard(hand12,card60). +hasSuit(card60,spades). +hasRank(card60,king). +sameSuit(card60,card61). +sameSuit(card60,card64). +nextRank(card60,card61). + +card(card61). +hasCard(hand12,card61). +hasSuit(card61,spades). +hasRank(card61,ace). +sameSuit(card61,card64). + +card(card62). +hasCard(hand12,card62). +hasSuit(card62,clubs). +hasRank(card62,four). +nextRank(card62,card63). + +card(card63). +hasCard(hand12,card63). +hasSuit(card63,hearts). +hasRank(card63,five). + +card(card64). +hasCard(hand12,card64). +hasSuit(card64,spades). +hasRank(card64,jack). + + + +deck(hand13). +card(card65). +hasCard(hand13,card65). +hasSuit(card65,diamonds). +hasRank(card65,eight). +sameSuit(card65,card67). +sameSuit(card65,card69). +nextRank(card65,card67). + +card(card66). +hasCard(hand13,card66). +hasSuit(card66,clubs). +hasRank(card66,queen). +sameSuit(card66,card68). + +card(card67). +hasCard(hand13,card67). +hasSuit(card67,diamonds). +hasRank(card67,nine). +sameSuit(card67,card69). + +card(card68). +hasCard(hand13,card68). +hasSuit(card68,clubs). +hasRank(card68,two). +sameRank(card68,card69). + +card(card69). +hasCard(hand13,card69). +hasSuit(card69,diamonds). +hasRank(card69,two). + + + +deck(hand14). +card(card70). +hasCard(hand14,card70). +hasSuit(card70,hearts). +hasRank(card70,three). +sameSuit(card70,card72). +nextRank(card70,card73). + +card(card71). +hasCard(hand14,card71). +hasSuit(card71,clubs). +hasRank(card71,seven). +sameSuit(card71,card74). + +card(card72). +hasCard(hand14,card72). +hasSuit(card72,hearts). +hasRank(card72,five). + +card(card73). +hasCard(hand14,card73). +hasSuit(card73,spades). +hasRank(card73,four). +nextRank(card73,card72). + +card(card74). +hasCard(hand14,card74). +hasSuit(card74,clubs). +hasRank(card74,king). + + + +deck(hand15). +card(card75). +hasCard(hand15,card75). +hasSuit(card75,hearts). +hasRank(card75,four). +sameSuit(card75,card76). +sameSuit(card75,card77). +nextRank(card75,card78). + +card(card76). +hasCard(hand15,card76). +hasSuit(card76,hearts). +hasRank(card76,ace). +sameSuit(card76,card77). +nextRank(card76,card79). + +card(card77). +hasCard(hand15,card77). +hasSuit(card77,hearts). +hasRank(card77,three). +nextRank(card77,card75). + +card(card78). +hasCard(hand15,card78). +hasSuit(card78,diamonds). +hasRank(card78,five). +sameSuit(card78,card79). + +card(card79). +hasCard(hand15,card79). +hasSuit(card79,diamonds). +hasRank(card79,two). +nextRank(card79,card77). + + + +deck(hand16). +card(card80). +hasCard(hand16,card80). +hasSuit(card80,diamonds). +hasRank(card80,eight). +sameSuit(card80,card81). + +card(card81). +hasCard(hand16,card81). +hasSuit(card81,diamonds). +hasRank(card81,queen). + +card(card82). +hasCard(hand16,card82). +hasSuit(card82,spades). +hasRank(card82,seven). +sameSuit(card82,card83). +nextRank(card82,card80). + +card(card83). +hasCard(hand16,card83). +hasSuit(card83,spades). +hasRank(card83,six). +nextRank(card83,card82). + +card(card84). +hasCard(hand16,card84). +hasSuit(card84,hearts). +hasRank(card84,two). + + + +deck(hand17). +card(card85). +hasCard(hand17,card85). +hasSuit(card85,clubs). +hasRank(card85,eight). +sameSuit(card85,card87). +sameSuit(card85,card89). + +card(card86). +hasCard(hand17,card86). +hasSuit(card86,hearts). +hasRank(card86,jack). +nextRank(card86,card89). + +card(card87). +hasCard(hand17,card87). +hasSuit(card87,clubs). +hasRank(card87,six). +sameSuit(card87,card89). + +card(card88). +hasCard(hand17,card88). +hasSuit(card88,diamonds). +hasRank(card88,two). + +card(card89). +hasCard(hand17,card89). +hasSuit(card89,clubs). +hasRank(card89,queen). + + + +deck(hand18). +card(card90). +hasCard(hand18,card90). +hasSuit(card90,diamonds). +hasRank(card90,seven). +sameRank(card90,card91). +sameSuit(card90,card94). + +card(card91). +hasCard(hand18,card91). +hasSuit(card91,spades). +hasRank(card91,seven). + +card(card92). +hasCard(hand18,card92). +hasSuit(card92,clubs). +hasRank(card92,jack). +nextRank(card92,card93). + +card(card93). +hasCard(hand18,card93). +hasSuit(card93,hearts). +hasRank(card93,queen). + +card(card94). +hasCard(hand18,card94). +hasSuit(card94,diamonds). +hasRank(card94,ace). + + + +deck(hand19). +card(card95). +hasCard(hand19,card95). +hasSuit(card95,hearts). +hasRank(card95,king). +sameRank(card95,card99). + +card(card96). +hasCard(hand19,card96). +hasSuit(card96,clubs). +hasRank(card96,eight). + +card(card97). +hasCard(hand19,card97). +hasSuit(card97,spades). +hasRank(card97,seven). +sameSuit(card97,card98). +nextRank(card97,card96). + +card(card98). +hasCard(hand19,card98). +hasSuit(card98,spades). +hasRank(card98,ten). + +card(card99). +hasCard(hand19,card99). +hasSuit(card99,diamonds). +hasRank(card99,king). + + + +deck(hand20). +card(card100). +hasCard(hand20,card100). +hasSuit(card100,spades). +hasRank(card100,six). +sameSuit(card100,card101). +nextRank(card100,card104). + +card(card101). +hasCard(hand20,card101). +hasSuit(card101,spades). +hasRank(card101,eight). + +card(card102). +hasCard(hand20,card102). +hasSuit(card102,hearts). +hasRank(card102,jack). +sameSuit(card102,card103). + +card(card103). +hasCard(hand20,card103). +hasSuit(card103,hearts). +hasRank(card103,four). + +card(card104). +hasCard(hand20,card104). +hasSuit(card104,diamonds). +hasRank(card104,seven). +nextRank(card104,card101). + + + +deck(hand21). +card(card105). +hasCard(hand21,card105). +hasSuit(card105,diamonds). +hasRank(card105,ten). +sameRank(card105,card106). +sameSuit(card105,card109). + +card(card106). +hasCard(hand21,card106). +hasSuit(card106,spades). +hasRank(card106,ten). + +card(card107). +hasCard(hand21,card107). +hasSuit(card107,clubs). +hasRank(card107,five). + +card(card108). +hasCard(hand21,card108). +hasSuit(card108,hearts). +hasRank(card108,two). + +card(card109). +hasCard(hand21,card109). +hasSuit(card109,diamonds). +hasRank(card109,eight). + + + +deck(hand22). +card(card110). +hasCard(hand22,card110). +hasSuit(card110,spades). +hasRank(card110,ace). +sameRank(card110,card114). + +card(card111). +hasCard(hand22,card111). +hasSuit(card111,diamonds). +hasRank(card111,king). +nextRank(card111,card110). +nextRank(card111,card114). + +card(card112). +hasCard(hand22,card112). +hasSuit(card112,clubs). +hasRank(card112,six). +sameSuit(card112,card114). + +card(card113). +hasCard(hand22,card113). +hasSuit(card113,hearts). +hasRank(card113,nine). + +card(card114). +hasCard(hand22,card114). +hasSuit(card114,clubs). +hasRank(card114,ace). + + + +deck(hand23). +card(card115). +hasCard(hand23,card115). +hasSuit(card115,spades). +hasRank(card115,ten). +sameSuit(card115,card116). +sameSuit(card115,card119). + +card(card116). +hasCard(hand23,card116). +hasSuit(card116,spades). +hasRank(card116,eight). +sameRank(card116,card117). +sameSuit(card116,card119). + +card(card117). +hasCard(hand23,card117). +hasSuit(card117,hearts). +hasRank(card117,eight). + +card(card118). +hasCard(hand23,card118). +hasSuit(card118,diamonds). +hasRank(card118,two). + +card(card119). +hasCard(hand23,card119). +hasSuit(card119,spades). +hasRank(card119,king). + + + +deck(hand24). +card(card120). +hasCard(hand24,card120). +hasSuit(card120,spades). +hasRank(card120,king). + +card(card121). +hasCard(hand24,card121). +hasSuit(card121,hearts). +hasRank(card121,five). +sameRank(card121,card122). + +card(card122). +hasCard(hand24,card122). +hasSuit(card122,clubs). +hasRank(card122,five). +sameSuit(card122,card123). + +card(card123). +hasCard(hand24,card123). +hasSuit(card123,clubs). +hasRank(card123,eight). + +card(card124). +hasCard(hand24,card124). +hasSuit(card124,diamonds). +hasRank(card124,three). + + + +deck(hand25). +card(card125). +hasCard(hand25,card125). +hasSuit(card125,diamonds). +hasRank(card125,ace). +sameSuit(card125,card128). +sameRank(card125,card129). + +card(card126). +hasCard(hand25,card126). +hasSuit(card126,hearts). +hasRank(card126,five). +sameSuit(card126,card129). + +card(card127). +hasCard(hand25,card127). +hasSuit(card127,spades). +hasRank(card127,seven). + +card(card128). +hasCard(hand25,card128). +hasSuit(card128,diamonds). +hasRank(card128,king). +nextRank(card128,card125). +nextRank(card128,card129). + +card(card129). +hasCard(hand25,card129). +hasSuit(card129,hearts). +hasRank(card129,ace). + + + +deck(hand26). +card(card130). +hasCard(hand26,card130). +hasSuit(card130,hearts). +hasRank(card130,seven). +sameSuit(card130,card131). +sameSuit(card130,card133). +nextRank(card130,card132). + +card(card131). +hasCard(hand26,card131). +hasSuit(card131,hearts). +hasRank(card131,five). +sameSuit(card131,card133). +nextRank(card131,card133). +nextRank(card131,card134). + +card(card132). +hasCard(hand26,card132). +hasSuit(card132,clubs). +hasRank(card132,eight). + +card(card133). +hasCard(hand26,card133). +hasSuit(card133,hearts). +hasRank(card133,six). +sameRank(card133,card134). +nextRank(card133,card130). + +card(card134). +hasCard(hand26,card134). +hasSuit(card134,spades). +hasRank(card134,six). +nextRank(card134,card130). + + + +deck(hand27). +card(card135). +hasCard(hand27,card135). +hasSuit(card135,diamonds). +hasRank(card135,seven). +sameSuit(card135,card136). + +card(card136). +hasCard(hand27,card136). +hasSuit(card136,diamonds). +hasRank(card136,nine). + +card(card137). +hasCard(hand27,card137). +hasSuit(card137,spades). +hasRank(card137,queen). +sameSuit(card137,card138). + +card(card138). +hasCard(hand27,card138). +hasSuit(card138,spades). +hasRank(card138,five). + +card(card139). +hasCard(hand27,card139). +hasSuit(card139,clubs). +hasRank(card139,four). +nextRank(card139,card138). + + + +deck(hand28). +card(card140). +hasCard(hand28,card140). +hasSuit(card140,spades). +hasRank(card140,ten). +sameSuit(card140,card144). + +card(card141). +hasCard(hand28,card141). +hasSuit(card141,hearts). +hasRank(card141,ace). +sameSuit(card141,card142). + +card(card142). +hasCard(hand28,card142). +hasSuit(card142,hearts). +hasRank(card142,queen). + +card(card143). +hasCard(hand28,card143). +hasSuit(card143,clubs). +hasRank(card143,six). + +card(card144). +hasCard(hand28,card144). +hasSuit(card144,spades). +hasRank(card144,eight). + + + +deck(hand29). +card(card145). +hasCard(hand29,card145). +hasSuit(card145,diamonds). +hasRank(card145,king). +sameSuit(card145,card148). + +card(card146). +hasCard(hand29,card146). +hasSuit(card146,spades). +hasRank(card146,seven). +sameSuit(card146,card149). + +card(card147). +hasCard(hand29,card147). +hasSuit(card147,clubs). +hasRank(card147,jack). +sameRank(card147,card148). +sameRank(card147,card149). + +card(card148). +hasCard(hand29,card148). +hasSuit(card148,diamonds). +hasRank(card148,jack). +sameRank(card148,card149). + +card(card149). +hasCard(hand29,card149). +hasSuit(card149,spades). +hasRank(card149,jack). + + + +deck(hand30). +card(card150). +hasCard(hand30,card150). +hasSuit(card150,clubs). +hasRank(card150,two). + +card(card151). +hasCard(hand30,card151). +hasSuit(card151,spades). +hasRank(card151,seven). +sameSuit(card151,card153). + +card(card152). +hasCard(hand30,card152). +hasSuit(card152,diamonds). +hasRank(card152,king). +sameSuit(card152,card154). + +card(card153). +hasCard(hand30,card153). +hasSuit(card153,spades). +hasRank(card153,jack). + +card(card154). +hasCard(hand30,card154). +hasSuit(card154,diamonds). +hasRank(card154,ten). +nextRank(card154,card153). + + + +deck(hand31). +card(card155). +hasCard(hand31,card155). +hasSuit(card155,hearts). +hasRank(card155,jack). +sameSuit(card155,card157). +sameSuit(card155,card159). + +card(card156). +hasCard(hand31,card156). +hasSuit(card156,spades). +hasRank(card156,seven). + +card(card157). +hasCard(hand31,card157). +hasSuit(card157,hearts). +hasRank(card157,six). +sameSuit(card157,card159). +nextRank(card157,card156). + +card(card158). +hasCard(hand31,card158). +hasSuit(card158,clubs). +hasRank(card158,two). + +card(card159). +hasCard(hand31,card159). +hasSuit(card159,hearts). +hasRank(card159,ace). +nextRank(card159,card158). + + + +deck(hand32). +card(card160). +hasCard(hand32,card160). +hasSuit(card160,diamonds). +hasRank(card160,four). +sameSuit(card160,card162). +nextRank(card160,card162). + +card(card161). +hasCard(hand32,card161). +hasSuit(card161,clubs). +hasRank(card161,three). +nextRank(card161,card160). + +card(card162). +hasCard(hand32,card162). +hasSuit(card162,diamonds). +hasRank(card162,five). + +card(card163). +hasCard(hand32,card163). +hasSuit(card163,spades). +hasRank(card163,queen). + +card(card164). +hasCard(hand32,card164). +hasSuit(card164,hearts). +hasRank(card164,nine). + + + +deck(hand33). +card(card165). +hasCard(hand33,card165). +hasSuit(card165,diamonds). +hasRank(card165,two). +nextRank(card165,card168). + +card(card166). +hasCard(hand33,card166). +hasSuit(card166,hearts). +hasRank(card166,six). + +card(card167). +hasCard(hand33,card167). +hasSuit(card167,spades). +hasRank(card167,jack). +sameSuit(card167,card169). + +card(card168). +hasCard(hand33,card168). +hasSuit(card168,clubs). +hasRank(card168,three). + +card(card169). +hasCard(hand33,card169). +hasSuit(card169,spades). +hasRank(card169,ten). +nextRank(card169,card167). + + + +deck(hand34). +card(card170). +hasCard(hand34,card170). +hasSuit(card170,clubs). +hasRank(card170,eight). +sameSuit(card170,card171). +sameSuit(card170,card172). +sameSuit(card170,card173). + +card(card171). +hasCard(hand34,card171). +hasSuit(card171,clubs). +hasRank(card171,three). +sameSuit(card171,card172). +sameSuit(card171,card173). + +card(card172). +hasCard(hand34,card172). +hasSuit(card172,clubs). +hasRank(card172,king). +sameSuit(card172,card173). +nextRank(card172,card174). + +card(card173). +hasCard(hand34,card173). +hasSuit(card173,clubs). +hasRank(card173,queen). +nextRank(card173,card172). + +card(card174). +hasCard(hand34,card174). +hasSuit(card174,hearts). +hasRank(card174,ace). + + + +deck(hand35). +card(card175). +hasCard(hand35,card175). +hasSuit(card175,spades). +hasRank(card175,six). +sameSuit(card175,card178). + +card(card176). +hasCard(hand35,card176). +hasSuit(card176,clubs). +hasRank(card176,eight). +sameSuit(card176,card177). + +card(card177). +hasCard(hand35,card177). +hasSuit(card177,clubs). +hasRank(card177,three). + +card(card178). +hasCard(hand35,card178). +hasSuit(card178,spades). +hasRank(card178,two). +sameRank(card178,card179). +nextRank(card178,card177). + +card(card179). +hasCard(hand35,card179). +hasSuit(card179,hearts). +hasRank(card179,two). +nextRank(card179,card177). + + + +deck(hand36). +card(card180). +hasCard(hand36,card180). +hasSuit(card180,clubs). +hasRank(card180,king). + +card(card181). +hasCard(hand36,card181). +hasSuit(card181,hearts). +hasRank(card181,six). +sameSuit(card181,card183). + +card(card182). +hasCard(hand36,card182). +hasSuit(card182,diamonds). +hasRank(card182,eight). + +card(card183). +hasCard(hand36,card183). +hasSuit(card183,hearts). +hasRank(card183,three). +sameRank(card183,card184). + +card(card184). +hasCard(hand36,card184). +hasSuit(card184,spades). +hasRank(card184,three). + + + +deck(hand37). +card(card185). +hasCard(hand37,card185). +hasSuit(card185,spades). +hasRank(card185,nine). +sameSuit(card185,card186). +nextRank(card185,card186). + +card(card186). +hasCard(hand37,card186). +hasSuit(card186,spades). +hasRank(card186,ten). +nextRank(card186,card187). + +card(card187). +hasCard(hand37,card187). +hasSuit(card187,clubs). +hasRank(card187,jack). +sameSuit(card187,card188). +sameSuit(card187,card189). + +card(card188). +hasCard(hand37,card188). +hasSuit(card188,clubs). +hasRank(card188,seven). +sameSuit(card188,card189). + +card(card189). +hasCard(hand37,card189). +hasSuit(card189,clubs). +hasRank(card189,three). + + + +deck(hand38). +card(card190). +hasCard(hand38,card190). +hasSuit(card190,spades). +hasRank(card190,ten). +sameSuit(card190,card193). +sameSuit(card190,card194). + +card(card191). +hasCard(hand38,card191). +hasSuit(card191,diamonds). +hasRank(card191,queen). +nextRank(card191,card194). + +card(card192). +hasCard(hand38,card192). +hasSuit(card192,hearts). +hasRank(card192,two). +sameRank(card192,card193). + +card(card193). +hasCard(hand38,card193). +hasSuit(card193,spades). +hasRank(card193,two). +sameSuit(card193,card194). + +card(card194). +hasCard(hand38,card194). +hasSuit(card194,spades). +hasRank(card194,king). + + + +deck(hand39). +card(card195). +hasCard(hand39,card195). +hasSuit(card195,spades). +hasRank(card195,five). +sameSuit(card195,card196). +sameSuit(card195,card197). + +card(card196). +hasCard(hand39,card196). +hasSuit(card196,spades). +hasRank(card196,queen). +sameSuit(card196,card197). + +card(card197). +hasCard(hand39,ca... [truncated message content] |
From: <ton...@us...> - 2008-02-13 11:15:55
|
Revision: 558 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=558&view=rev Author: tonytacker Date: 2008-02-13 03:15:53 -0800 (Wed, 13 Feb 2008) Log Message: ----------- include StringTupleList Modified Paths: -------------- trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java trunk/src/dl-learner/org/dllearner/gui/package.html Added Paths: ----------- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java Modified: trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-13 11:02:08 UTC (rev 557) +++ trunk/src/dl-learner/org/dllearner/gui/OptionPanel.java 2008-02-13 11:15:53 UTC (rev 558) @@ -35,7 +35,8 @@ import org.dllearner.core.config.*; /** - * OptionPanel reads all possible options and use all widgets. Definition map is here. + * OptionPanel reads all possible options and use all widgets. Definition map is + * here. * * @author Tilo Hielscher * @@ -113,6 +114,10 @@ "StringSetConfigOption")) { widgetPanel = new WidgetPanelStringSet(config, component, componentOption, optionList.get(i)); + } else if (optionList.get(i).getClass().toString().contains( + "StringTupleListConfigOption")) { + widgetPanel = new WidgetPanelStringTupleList(config, component, + componentOption, optionList.get(i)); } else { widgetPanel = new WidgetPanelDefault(config, component, componentOption, optionList.get(i)); Added: trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java (rev 0) +++ trunk/src/dl-learner/org/dllearner/gui/WidgetPanelStringTupleList.java 2008-02-13 11:15:53 UTC (rev 558) @@ -0,0 +1,256 @@ +package org.dllearner.gui; + +/** + * Copyright (C) 2007-2008, Jens Lehmann + * + * This file is part of DL-Learner. + * + * DL-Learner is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 3 of the License, or + * (at your option) any later version. + * + * DL-Learner 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 General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + * + */ + +import java.awt.BorderLayout; +import java.awt.Dimension; +import java.awt.GridBagConstraints; +import java.awt.GridBagLayout; +import java.awt.event.ActionEvent; +import java.awt.event.ActionListener; +import java.awt.Color; + +import java.util.List; +import java.util.LinkedList; +import java.util.Iterator; + +import javax.swing.DefaultListModel; +import javax.swing.JLabel; +import javax.swing.JList; +import javax.swing.JPanel; +import javax.swing.JButton; +import javax.swing.JScrollPane; +import javax.swing.JTextField; + +import org.dllearner.core.Component; +import org.dllearner.core.config.ConfigEntry; +import org.dllearner.core.config.ConfigOption; +import org.dllearner.core.config.StringTupleListConfigOption; +import org.dllearner.core.config.InvalidConfigOptionValueException; +import org.dllearner.utilities.StringTuple; + +/** + * Panel for option StringTupleList, defined in + * org.dllearner.core.config.StringTupleListConfigOption. + * + * @author Tilo Hielscher + */ +public class WidgetPanelStringTupleList extends WidgetPanelAbstract implements + ActionListener { + + private static final long serialVersionUID = 7832726987046601916L; + private Config config; + private ConfigOption<?> configOption; + private GridBagLayout gridbag = new GridBagLayout(); + private GridBagConstraints constraints = new GridBagConstraints(); + + private JLabel nameLabel; + private JPanel widgetPanel = new JPanel(); + private JButton addButton = new JButton("add"); + private JButton removeButton = new JButton("remove"); + private JButton clearButton = new JButton("clear"); + private JTextField stringFieldA = new JTextField(10); + private JTextField stringFieldB = new JTextField(10); + private List<StringTuple> exampleList = new LinkedList<StringTuple>(); + + private Component component; + private Class<? extends Component> componentOption; + + private List<StringTuple> value = new LinkedList<StringTuple>(); + private JList stringList = new JList(); + private DefaultListModel listModel = new DefaultListModel(); + + private JButton setButton = new JButton("set"); + + public WidgetPanelStringTupleList(Config config, Component component, + Class<? extends Component> componentOption, + ConfigOption<?> configOption) { + + this.config = config; + this.configOption = configOption; + this.component = component; + this.componentOption = componentOption; + + widgetPanel.setLayout(gridbag); + add(widgetPanel, BorderLayout.CENTER); + showLabel(); // name of option and tooltip + showThingToChange(); // textfield, setbutton + stringList.setModel(listModel); + // ActionListeners + addButton.addActionListener(this); + removeButton.addActionListener(this); + clearButton.addActionListener(this); + setButton.addActionListener(this); + } + + public void actionPerformed(ActionEvent e) { + // add to list + if (e.getSource() == addButton + && !listModel.contains(stringFieldA.getText() + " --> " + + stringFieldB.getText()) + && !stringFieldA.getText().equalsIgnoreCase("") + && !stringFieldB.getText().equalsIgnoreCase("")) { + listModel.addElement(stringFieldA.getText() + " --> " + + stringFieldB.getText()); + exampleList.add(new StringTuple(stringFieldA.getText(), + stringFieldB.getText())); + } + // remove selection + if (e.getSource() == removeButton) { + int[] selectedIndices = stringList.getSelectedIndices(); + int count = 0; + // remove i.e. 2 and 4: after delete 2: 4 is now 3 + for (int i : selectedIndices) { + listModel.remove(i - count); + exampleList.remove(i - count++); + } + } + // clear list + if (e.getSource() == clearButton) { + listModel.clear(); + exampleList.clear(); + } + // set entry + value = exampleList; + setEntry(); + } + + @Override + public void showLabel() { + nameLabel = new JLabel(configOption.getName()); + nameLabel.setToolTipText(configOption.getDescription()); + buildConstraints(constraints, 0, 0, 1, 1, 100, 100); + constraints.anchor = GridBagConstraints.WEST; + gridbag.setConstraints(nameLabel, constraints); + widgetPanel.add(nameLabel, constraints); + } + + @SuppressWarnings("unchecked") + @Override + public void showThingToChange() { + if (component != null) { + // StringTupleListConfigOption + if (configOption.getClass().toString().contains( + "StringTupleListConfigOption")) { + // previous set value + if (configOption != null) { + // take list + value = (List<StringTuple>) config.getComponentManager() + .getConfigOptionValue(component, + configOption.getName()); + + // fill list + if (value != null) { + for (Iterator<StringTuple> iterator = value.iterator(); iterator + .hasNext();) { + StringTuple item = iterator.next(); + listModel.addElement(item); + } + } + } + // stringFieldA + buildConstraints(constraints, 0, 1, 1, 1, 100, 100); + gridbag.setConstraints(stringFieldA, constraints); + widgetPanel.add(stringFieldA, constraints); + // arrow + JLabel arrowLabel = new JLabel(" --> "); + buildConstraints(constraints, 1, 1, 1, 1, 100, 100); + constraints.anchor = GridBagConstraints.WEST; + gridbag.setConstraints(arrowLabel, constraints); + widgetPanel.add(arrowLabel, constraints); + // stringFieldB + buildConstraints(constraints, 2, 1, 1, 1, 100, 100); + gridbag.setConstraints(stringFieldB, constraints); + widgetPanel.add(stringFieldB, constraints); + // addButton + buildConstraints(constraints, 3, 1, 1, 1, 100, 100); + gridbag.setConstraints(addButton, constraints); + widgetPanel.add(addButton, constraints); + // list + stringList.setModel(listModel); + stringList.setLayoutOrientation(JList.VERTICAL); + stringList.setVisibleRowCount(-1); + JScrollPane stringListScroller = new JScrollPane(stringList); + stringListScroller.setPreferredSize(new Dimension(280, 100)); + buildConstraints(constraints, 0, 2, 3, 2, 100, 100); + gridbag.setConstraints(stringListScroller, constraints); + widgetPanel.add(stringListScroller, constraints); + // removeButton + buildConstraints(constraints, 3, 2, 1, 1, 100, 100); + gridbag.setConstraints(removeButton, constraints); + widgetPanel.add(removeButton, constraints); + // clearButton + buildConstraints(constraints, 3, 3, 1, 1, 100, 100); + gridbag.setConstraints(clearButton, constraints); + widgetPanel.add(clearButton, constraints); + } + // UNKNOWN + else { + JLabel notImplementedLabel = new JLabel( + " not a StringTupleList"); + notImplementedLabel.setForeground(Color.RED); + buildConstraints(constraints, 1, 0, 1, 1, 100, 100); + gridbag.setConstraints(notImplementedLabel, constraints); + widgetPanel.add(notImplementedLabel); + } + } else { // configOption == NULL + JLabel noConfigOptionLabel = new JLabel( + " no init (StringTupleList)"); + noConfigOptionLabel.setForeground(Color.MAGENTA); + buildConstraints(constraints, 1, 0, 1, 1, 100, 100); + gridbag.setConstraints(noConfigOptionLabel, constraints); + widgetPanel.add(noConfigOptionLabel, constraints); + } + } + + @Override + public void setEntry() { + StringTupleListConfigOption specialOption; + specialOption = (StringTupleListConfigOption) config + .getComponentManager().getConfigOption(componentOption, + configOption.getName()); + + try { + ConfigEntry<List<StringTuple>> specialEntry = new ConfigEntry<List<StringTuple>>( + specialOption, value); + config.getComponentManager().applyConfigEntry(component, + specialEntry); + System.out.println("set StringTupleList: " + configOption.getName() + + " = " + value); + } catch (InvalidConfigOptionValueException s) { + s.printStackTrace(); + } + } + + /** + * Define GridBagConstraints + */ + private void buildConstraints(GridBagConstraints gbc, int gx, int gy, + int gw, int gh, int wx, int wy) { + gbc.gridx = gx; + gbc.gridy = gy; + gbc.gridwidth = gw; + gbc.gridheight = gh; + gbc.weightx = wx; + gbc.weighty = wy; + } + +} Modified: trunk/src/dl-learner/org/dllearner/gui/package.html =================================================================== --- trunk/src/dl-learner/org/dllearner/gui/package.html 2008-02-13 11:02:08 UTC (rev 557) +++ trunk/src/dl-learner/org/dllearner/gui/package.html 2008-02-13 11:15:53 UTC (rev 558) @@ -2,6 +2,6 @@ <html> <head></head> <body bgcolor="white"> -<p>Classes for generating a Graphical User Interface for DL-Learner.</p> +<p>Classes to generate a Graphical User Interface for DL-Learner.</p> </body> </html> \ No newline at end of file This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 11:02:10
|
Revision: 557 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=557&view=rev Author: kurzum Date: 2008-02-13 03:02:08 -0800 (Wed, 13 Feb 2008) Log Message: ----------- changed filenames Added Paths: ----------- trunk/examples/poker/pair.conf trunk/examples/poker/straight.conf Removed Paths: ------------- trunk/examples/poker/poker_pair.conf trunk/examples/poker/poker_straight.conf Copied: trunk/examples/poker/pair.conf (from rev 551, trunk/examples/poker/poker_pair.conf) =================================================================== --- trunk/examples/poker/pair.conf (rev 0) +++ trunk/examples/poker/pair.conf 2008-02-13 11:02:08 UTC (rev 557) @@ -0,0 +1,1680 @@ +/** + * Automatically created random poker decks (the UCI-ML-Repository Poker example + * was transformed to a conf file). The goal is to learn the concept of a pair + * (two cards with equal rank). + * + * possible solution: + * EXISTS hasCard.EXISTS sameRank.TOP + * + * Copyright (C) 2007, Jens Lehmann + */ + +deck(hand0). +card(card0). +hasCard(hand0,card0). +hasSuit(card0,hearts). +hasRank(card0,ten). +sameSuit(card0,card1). +sameSuit(card0,card2). +sameSuit(card0,card3). +sameSuit(card0,card4). +nextRank(card0,card1). + +card(card1). +hasCard(hand0,card1). +hasSuit(card1,hearts). +hasRank(card1,jack). +sameSuit(card1,card2). +sameSuit(card1,card3). +sameSuit(card1,card4). +nextRank(card1,card3). + +card(card2). +hasCard(hand0,card2). +hasSuit(card2,hearts). +hasRank(card2,king). +sameSuit(card2,card3). +sameSuit(card2,card4). +nextRank(card2,card4). + +card(card3). +hasCard(hand0,card3). +hasSuit(card3,hearts). +hasRank(card3,queen). +sameSuit(card3,card4). +nextRank(card3,card2). + +card(card4). +hasCard(hand0,card4). +hasSuit(card4,hearts). +hasRank(card4,ace). + +-pair(hand0). + +deck(hand1). +card(card5). +hasCard(hand1,card5). +hasSuit(card5,spades). +hasRank(card5,jack). +sameSuit(card5,card6). +sameSuit(card5,card7). +sameSuit(card5,card8). +sameSuit(card5,card9). +nextRank(card5,card8). + +card(card6). +hasCard(hand1,card6). +hasSuit(card6,spades). +hasRank(card6,king). +sameSuit(card6,card7). +sameSuit(card6,card8). +sameSuit(card6,card9). +nextRank(card6,card9). + +card(card7). +hasCard(hand1,card7). +hasSuit(card7,spades). +hasRank(card7,ten). +sameSuit(card7,card8). +sameSuit(card7,card9). +nextRank(card7,card5). + +card(card8). +hasCard(hand1,card8). +hasSuit(card8,spades). +hasRank(card8,queen). +sameSuit(card8,card9). +nextRank(card8,card6). + +card(card9). +hasCard(hand1,card9). +hasSuit(card9,spades). +hasRank(card9,ace). + +-pair(hand1). + +deck(hand2). +card(card10). +hasCard(hand2,card10). +hasSuit(card10,diamonds). +hasRank(card10,queen). +sameSuit(card10,card11). +sameSuit(card10,card12). +sameSuit(card10,card13). +sameSuit(card10,card14). +nextRank(card10,card12). + +card(card11). +hasCard(hand2,card11). +hasSuit(card11,diamonds). +hasRank(card11,jack). +sameSuit(card11,card12). +sameSuit(card11,card13). +sameSuit(card11,card14). +nextRank(card11,card10). + +card(card12). +hasCard(hand2,card12). +hasSuit(card12,diamonds). +hasRank(card12,king). +sameSuit(card12,card13). +sameSuit(card12,card14). +nextRank(card12,card14). + +card(card13). +hasCard(hand2,card13). +hasSuit(card13,diamonds). +hasRank(card13,ten). +sameSuit(card13,card14). +nextRank(card13,card11). + +card(card14). +hasCard(hand2,card14). +hasSuit(card14,diamonds). +hasRank(card14,ace). + +-pair(hand2). + +deck(hand3). +card(card15). +hasCard(hand3,card15). +hasSuit(card15,clubs). +hasRank(card15,ten). +sameSuit(card15,card16). +sameSuit(card15,card17). +sameSuit(card15,card18). +sameSuit(card15,card19). +nextRank(card15,card16). + +card(card16). +hasCard(hand3,card16). +hasSuit(card16,clubs). +hasRank(card16,jack). +sameSuit(card16,card17). +sameSuit(card16,card18). +sameSuit(card16,card19). +nextRank(card16,card19). + +card(card17). +hasCard(hand3,card17). +hasSuit(card17,clubs). +hasRank(card17,ace). +sameSuit(card17,card18). +sameSuit(card17,card19). + +card(card18). +hasCard(hand3,card18). +hasSuit(card18,clubs). +hasRank(card18,king). +sameSuit(card18,card19). +nextRank(card18,card17). + +card(card19). +hasCard(hand3,card19). +hasSuit(card19,clubs). +hasRank(card19,queen). +nextRank(card19,card18). + +-pair(hand3). + +deck(hand4). +card(card20). +hasCard(hand4,card20). +hasSuit(card20,hearts). +hasRank(card20,two). +sameSuit(card20,card21). +sameSuit(card20,card22). +sameSuit(card20,card23). +sameSuit(card20,card24). +nextRank(card20,card23). + +card(card21). +hasCard(hand4,card21). +hasSuit(card21,hearts). +hasRank(card21,four). +sameSuit(card21,card22). +sameSuit(card21,card23). +sameSuit(card21,card24). +nextRank(card21,card22). + +card(card22). +hasCard(hand4,card22). +hasSuit(card22,hearts). +hasRank(card22,five). +sameSuit(card22,card23). +sameSuit(card22,card24). +nextRank(card22,card24). + +card(card23). +hasCard(hand4,card23). +hasSuit(card23,hearts). +hasRank(card23,three). +sameSuit(card23,card24). +nextRank(card23,card21). + +card(card24). +hasCard(hand4,card24). +hasSuit(card24,hearts). +hasRank(card24,six). + +-pair(hand4). + +deck(hand5). +card(card25). +hasCard(hand5,card25). +hasSuit(card25,hearts). +hasRank(card25,nine). +sameSuit(card25,card26). +sameSuit(card25,card27). +sameSuit(card25,card28). +sameSuit(card25,card29). +nextRank(card25,card27). + +card(card26). +hasCard(hand5,card26). +hasSuit(card26,hearts). +hasRank(card26,queen). +sameSuit(card26,card27). +sameSuit(card26,card28). +sameSuit(card26,card29). +nextRank(card26,card29). + +card(card27). +hasCard(hand5,card27). +hasSuit(card27,hearts). +hasRank(card27,ten). +sameSuit(card27,card28). +sameSuit(card27,card29). +nextRank(card27,card28). + +card(card28). +hasCard(hand5,card28). +hasSuit(card28,hearts). +hasRank(card28,jack). +sameSuit(card28,card29). +nextRank(card28,card26). + +card(card29). +hasCard(hand5,card29). +hasSuit(card29,hearts). +hasRank(card29,king). + +-pair(hand5). + +deck(hand6). +card(card30). +hasCard(hand6,card30). +hasSuit(card30,spades). +hasRank(card30,ace). +sameSuit(card30,card31). +sameSuit(card30,card32). +sameSuit(card30,card33). +sameSuit(card30,card34). +nextRank(card30,card31). + +card(card31). +hasCard(hand6,card31). +hasSuit(card31,spades). +hasRank(card31,two). +sameSuit(card31,card32). +sameSuit(card31,card33). +sameSuit(card31,card34). +nextRank(card31,card32). + +card(card32). +hasCard(hand6,card32). +hasSuit(card32,spades). +hasRank(card32,three). +sameSuit(card32,card33). +sameSuit(card32,card34). +nextRank(card32,card33). + +card(card33). +hasCard(hand6,card33). +hasSuit(card33,spades). +hasRank(card33,four). +sameSuit(card33,card34). +nextRank(card33,card34). + +card(card34). +hasCard(hand6,card34). +hasSuit(card34,spades). +hasRank(card34,five). + +-pair(hand6). + +deck(hand7). +card(card35). +hasCard(hand7,card35). +hasSuit(card35,diamonds). +hasRank(card35,five). +sameSuit(card35,card36). +sameSuit(card35,card37). +sameSuit(card35,card38). +sameSuit(card35,card39). +nextRank(card35,card36). + +card(card36). +hasCard(hand7,card36). +hasSuit(card36,diamonds). +hasRank(card36,six). +sameSuit(card36,card37). +sameSuit(card36,card38). +sameSuit(card36,card39). +nextRank(card36,card38). + +card(card37). +hasCard(hand7,card37). +hasSuit(card37,diamonds). +hasRank(card37,nine). +sameSuit(card37,card38). +sameSuit(card37,card39). + +card(card38). +hasCard(hand7,card38). +hasSuit(card38,diamonds). +hasRank(card38,seven). +sameSuit(card38,card39). +nextRank(card38,card39). + +card(card39). +hasCard(hand7,card39). +hasSuit(card39,diamonds). +hasRank(card39,eight). +nextRank(card39,card37). + +-pair(hand7). + +deck(hand8). +card(card40). +hasCard(hand8,card40). +hasSuit(card40,clubs). +hasRank(card40,ace). +sameSuit(card40,card41). +sameSuit(card40,card42). +sameSuit(card40,card43). +sameSuit(card40,card44). +nextRank(card40,card42). + +card(card41). +hasCard(hand8,card41). +hasSuit(card41,clubs). +hasRank(card41,four). +sameSuit(card41,card42). +sameSuit(card41,card43). +sameSuit(card41,card44). +nextRank(card41,card44). + +card(card42). +hasCard(hand8,card42). +hasSuit(card42,clubs). +hasRank(card42,two). +sameSuit(card42,card43). +sameSuit(card42,card44). +nextRank(card42,card43). + +card(card43). +hasCard(hand8,card43). +hasSuit(card43,clubs). +hasRank(card43,three). +sameSuit(card43,card44). +nextRank(card43,card41). + +card(card44). +hasCard(hand8,card44). +hasSuit(card44,clubs). +hasRank(card44,five). + +-pair(hand8). + +deck(hand9). +card(card45). +hasCard(hand9,card45). +hasSuit(card45,hearts). +hasRank(card45,ace). +sameRank(card45,card46). +sameSuit(card45,card48). + +card(card46). +hasCard(hand9,card46). +hasSuit(card46,spades). +hasRank(card46,ace). +sameSuit(card46,card49). + +card(card47). +hasCard(hand9,card47). +hasSuit(card47,diamonds). +hasRank(card47,nine). + +card(card48). +hasCard(hand9,card48). +hasSuit(card48,hearts). +hasRank(card48,five). + +card(card49). +hasCard(hand9,card49). +hasSuit(card49,spades). +hasRank(card49,three). + ++pair(hand9). + +deck(hand10). +card(card50). +hasCard(hand10,card50). +hasSuit(card50,spades). +hasRank(card50,six). +sameSuit(card50,card51). +sameSuit(card50,card53). + +card(card51). +hasCard(hand10,card51). +hasSuit(card51,spades). +hasRank(card51,ace). +sameSuit(card51,card53). + +card(card52). +hasCard(hand10,card52). +hasSuit(card52,clubs). +hasRank(card52,king). +sameSuit(card52,card54). +nextRank(card52,card51). + +card(card53). +hasCard(hand10,card53). +hasSuit(card53,spades). +hasRank(card53,four). + +card(card54). +hasCard(hand10,card54). +hasSuit(card54,clubs). +hasRank(card54,nine). + +-pair(hand10). + +deck(hand11). +card(card55). +hasCard(hand11,card55). +hasSuit(card55,hearts). +hasRank(card55,ten). +sameSuit(card55,card57). +sameSuit(card55,card58). + +card(card56). +hasCard(hand11,card56). +hasSuit(card56,clubs). +hasRank(card56,six). + +card(card57). +hasCard(hand11,card57). +hasSuit(card57,hearts). +hasRank(card57,two). +sameSuit(card57,card58). + +card(card58). +hasCard(hand11,card58). +hasSuit(card58,hearts). +hasRank(card58,ace). +nextRank(card58,card57). + +card(card59). +hasCard(hand11,card59). +hasSuit(card59,diamonds). +hasRank(card59,eight). + +-pair(hand11). + +deck(hand12). +card(card60). +hasCard(hand12,card60). +hasSuit(card60,spades). +hasRank(card60,king). +sameSuit(card60,card61). +sameSuit(card60,card64). +nextRank(card60,card61). + +card(card61). +hasCard(hand12,card61). +hasSuit(card61,spades). +hasRank(card61,ace). +sameSuit(card61,card64). + +card(card62). +hasCard(hand12,card62). +hasSuit(card62,clubs). +hasRank(card62,four). +nextRank(card62,card63). + +card(card63). +hasCard(hand12,card63). +hasSuit(card63,hearts). +hasRank(card63,five). + +card(card64). +hasCard(hand12,card64). +hasSuit(card64,spades). +hasRank(card64,jack). + +-pair(hand12). + +deck(hand13). +card(card65). +hasCard(hand13,card65). +hasSuit(card65,diamonds). +hasRank(card65,eight). +sameSuit(card65,card67). +sameSuit(card65,card69). +nextRank(card65,card67). + +card(card66). +hasCard(hand13,card66). +hasSuit(card66,clubs). +hasRank(card66,queen). +sameSuit(card66,card68). + +card(card67). +hasCard(hand13,card67). +hasSuit(card67,diamonds). +hasRank(card67,nine). +sameSuit(card67,card69). + +card(card68). +hasCard(hand13,card68). +hasSuit(card68,clubs). +hasRank(card68,two). +sameRank(card68,card69). + +card(card69). +hasCard(hand13,card69). +hasSuit(card69,diamonds). +hasRank(card69,two). + ++pair(hand13). + +deck(hand14). +card(card70). +hasCard(hand14,card70). +hasSuit(card70,hearts). +hasRank(card70,three). +sameSuit(card70,card72). +nextRank(card70,card73). + +card(card71). +hasCard(hand14,card71). +hasSuit(card71,clubs). +hasRank(card71,seven). +sameSuit(card71,card74). + +card(card72). +hasCard(hand14,card72). +hasSuit(card72,hearts). +hasRank(card72,five). + +card(card73). +hasCard(hand14,card73). +hasSuit(card73,spades). +hasRank(card73,four). +nextRank(card73,card72). + +card(card74). +hasCard(hand14,card74). +hasSuit(card74,clubs). +hasRank(card74,king). + +-pair(hand14). + +deck(hand15). +card(card75). +hasCard(hand15,card75). +hasSuit(card75,hearts). +hasRank(card75,four). +sameSuit(card75,card76). +sameSuit(card75,card77). +nextRank(card75,card78). + +card(card76). +hasCard(hand15,card76). +hasSuit(card76,hearts). +hasRank(card76,ace). +sameSuit(card76,card77). +nextRank(card76,card79). + +card(card77). +hasCard(hand15,card77). +hasSuit(card77,hearts). +hasRank(card77,three). +nextRank(card77,card75). + +card(card78). +hasCard(hand15,card78). +hasSuit(card78,diamonds). +hasRank(card78,five). +sameSuit(card78,card79). + +card(card79). +hasCard(hand15,card79). +hasSuit(card79,diamonds). +hasRank(card79,two). +nextRank(card79,card77). + +-pair(hand15). + +deck(hand16). +card(card80). +hasCard(hand16,card80). +hasSuit(card80,diamonds). +hasRank(card80,eight). +sameSuit(card80,card81). + +card(card81). +hasCard(hand16,card81). +hasSuit(card81,diamonds). +hasRank(card81,queen). + +card(card82). +hasCard(hand16,card82). +hasSuit(card82,spades). +hasRank(card82,seven). +sameSuit(card82,card83). +nextRank(card82,card80). + +card(card83). +hasCard(hand16,card83). +hasSuit(card83,spades). +hasRank(card83,six). +nextRank(card83,card82). + +card(card84). +hasCard(hand16,card84). +hasSuit(card84,hearts). +hasRank(card84,two). + +-pair(hand16). + +deck(hand17). +card(card85). +hasCard(hand17,card85). +hasSuit(card85,clubs). +hasRank(card85,eight). +sameSuit(card85,card87). +sameSuit(card85,card89). + +card(card86). +hasCard(hand17,card86). +hasSuit(card86,hearts). +hasRank(card86,jack). +nextRank(card86,card89). + +card(card87). +hasCard(hand17,card87). +hasSuit(card87,clubs). +hasRank(card87,six). +sameSuit(card87,card89). + +card(card88). +hasCard(hand17,card88). +hasSuit(card88,diamonds). +hasRank(card88,two). + +card(card89). +hasCard(hand17,card89). +hasSuit(card89,clubs). +hasRank(card89,queen). + +-pair(hand17). + +deck(hand18). +card(card90). +hasCard(hand18,card90). +hasSuit(card90,diamonds). +hasRank(card90,seven). +sameRank(card90,card91). +sameSuit(card90,card94). + +card(card91). +hasCard(hand18,card91). +hasSuit(card91,spades). +hasRank(card91,seven). + +card(card92). +hasCard(hand18,card92). +hasSuit(card92,clubs). +hasRank(card92,jack). +nextRank(card92,card93). + +card(card93). +hasCard(hand18,card93). +hasSuit(card93,hearts). +hasRank(card93,queen). + +card(card94). +hasCard(hand18,card94). +hasSuit(card94,diamonds). +hasRank(card94,ace). + ++pair(hand18). + +deck(hand19). +card(card95). +hasCard(hand19,card95). +hasSuit(card95,hearts). +hasRank(card95,king). +sameRank(card95,card99). + +card(card96). +hasCard(hand19,card96). +hasSuit(card96,clubs). +hasRank(card96,eight). + +card(card97). +hasCard(hand19,card97). +hasSuit(card97,spades). +hasRank(card97,seven). +sameSuit(card97,card98). +nextRank(card97,card96). + +card(card98). +hasCard(hand19,card98). +hasSuit(card98,spades). +hasRank(card98,ten). + +card(card99). +hasCard(hand19,card99). +hasSuit(card99,diamonds). +hasRank(card99,king). + ++pair(hand19). + +deck(hand20). +card(card100). +hasCard(hand20,card100). +hasSuit(card100,spades). +hasRank(card100,six). +sameSuit(card100,card101). +nextRank(card100,card104). + +card(card101). +hasCard(hand20,card101). +hasSuit(card101,spades). +hasRank(card101,eight). + +card(card102). +hasCard(hand20,card102). +hasSuit(card102,hearts). +hasRank(card102,jack). +sameSuit(card102,card103). + +card(card103). +hasCard(hand20,card103). +hasSuit(card103,hearts). +hasRank(card103,four). + +card(card104). +hasCard(hand20,card104). +hasSuit(card104,diamonds). +hasRank(card104,seven). +nextRank(card104,card101). + +-pair(hand20). + +deck(hand21). +card(card105). +hasCard(hand21,card105). +hasSuit(card105,diamonds). +hasRank(card105,ten). +sameRank(card105,card106). +sameSuit(card105,card109). + +card(card106). +hasCard(hand21,card106). +hasSuit(card106,spades). +hasRank(card106,ten). + +card(card107). +hasCard(hand21,card107). +hasSuit(card107,clubs). +hasRank(card107,five). + +card(card108). +hasCard(hand21,card108). +hasSuit(card108,hearts). +hasRank(card108,two). + +card(card109). +hasCard(hand21,card109). +hasSuit(card109,diamonds). +hasRank(card109,eight). + ++pair(hand21). + +deck(hand22). +card(card110). +hasCard(hand22,card110). +hasSuit(card110,spades). +hasRank(card110,ace). +sameRank(card110,card114). + +card(card111). +hasCard(hand22,card111). +hasSuit(card111,diamonds). +hasRank(card111,king). +nextRank(card111,card110). +nextRank(card111,card114). + +card(card112). +hasCard(hand22,card112). +hasSuit(card112,clubs). +hasRank(card112,six). +sameSuit(card112,card114). + +card(card113). +hasCard(hand22,card113). +hasSuit(card113,hearts). +hasRank(card113,nine). + +card(card114). +hasCard(hand22,card114). +hasSuit(card114,clubs). +hasRank(card114,ace). + ++pair(hand22). + +deck(hand23). +card(card115). +hasCard(hand23,card115). +hasSuit(card115,spades). +hasRank(card115,ten). +sameSuit(card115,card116). +sameSuit(card115,card119). + +card(card116). +hasCard(hand23,card116). +hasSuit(card116,spades). +hasRank(card116,eight). +sameRank(card116,card117). +sameSuit(card116,card119). + +card(card117). +hasCard(hand23,card117). +hasSuit(card117,hearts). +hasRank(card117,eight). + +card(card118). +hasCard(hand23,card118). +hasSuit(card118,diamonds). +hasRank(card118,two). + +card(card119). +hasCard(hand23,card119). +hasSuit(card119,spades). +hasRank(card119,king). + ++pair(hand23). + +deck(hand24). +card(card120). +hasCard(hand24,card120). +hasSuit(card120,spades). +hasRank(card120,king). + +card(card121). +hasCard(hand24,card121). +hasSuit(card121,hearts). +hasRank(card121,five). +sameRank(card121,card122). + +card(card122). +hasCard(hand24,card122). +hasSuit(card122,clubs). +hasRank(card122,five). +sameSuit(card122,card123). + +card(card123). +hasCard(hand24,card123). +hasSuit(card123,clubs). +hasRank(card123,eight). + +card(card124). +hasCard(hand24,card124). +hasSuit(card124,diamonds). +hasRank(card124,three). + ++pair(hand24). + +deck(hand25). +card(card125). +hasCard(hand25,card125). +hasSuit(card125,diamonds). +hasRank(card125,ace). +sameSuit(card125,card128). +sameRank(card125,card129). + +card(card126). +hasCard(hand25,card126). +hasSuit(card126,hearts). +hasRank(card126,five). +sameSuit(card126,card129). + +card(card127). +hasCard(hand25,card127). +hasSuit(card127,spades). +hasRank(card127,seven). + +card(card128). +hasCard(hand25,card128). +hasSuit(card128,diamonds). +hasRank(card128,king). +nextRank(card128,card125). +nextRank(card128,card129). + +card(card129). +hasCard(hand25,card129). +hasSuit(card129,hearts). +hasRank(card129,ace). + ++pair(hand25). + +deck(hand26). +card(card130). +hasCard(hand26,card130). +hasSuit(card130,hearts). +hasRank(card130,seven). +sameSuit(card130,card131). +sameSuit(card130,card133). +nextRank(card130,card132). + +card(card131). +hasCard(hand26,card131). +hasSuit(card131,hearts). +hasRank(card131,five). +sameSuit(card131,card133). +nextRank(card131,card133). +nextRank(card131,card134). + +card(card132). +hasCard(hand26,card132). +hasSuit(card132,clubs). +hasRank(card132,eight). + +card(card133). +hasCard(hand26,card133). +hasSuit(card133,hearts). +hasRank(card133,six). +sameRank(card133,card134). +nextRank(card133,card130). + +card(card134). +hasCard(hand26,card134). +hasSuit(card134,spades). +hasRank(card134,six). +nextRank(card134,card130). + ++pair(hand26). + +deck(hand27). +card(card135). +hasCard(hand27,card135). +hasSuit(card135,diamonds). +hasRank(card135,seven). +sameSuit(card135,card136). + +card(card136). +hasCard(hand27,card136). +hasSuit(card136,diamonds). +hasRank(card136,nine). + +card(card137). +hasCard(hand27,card137). +hasSuit(card137,spades). +hasRank(card137,queen). +sameSuit(card137,card138). + +card(card138). +hasCard(hand27,card138). +hasSuit(card138,spades). +hasRank(card138,five). + +card(card139). +hasCard(hand27,card139). +hasSuit(card139,clubs). +hasRank(card139,four). +nextRank(card139,card138). + +-pair(hand27). + +deck(hand28). +card(card140). +hasCard(hand28,card140). +hasSuit(card140,spades). +hasRank(card140,ten). +sameSuit(card140,card144). + +card(card141). +hasCard(hand28,card141). +hasSuit(card141,hearts). +hasRank(card141,ace). +sameSuit(card141,card142). + +card(card142). +hasCard(hand28,card142). +hasSuit(card142,hearts). +hasRank(card142,queen). + +card(card143). +hasCard(hand28,card143). +hasSuit(card143,clubs). +hasRank(card143,six). + +card(card144). +hasCard(hand28,card144). +hasSuit(card144,spades). +hasRank(card144,eight). + +-pair(hand28). + +deck(hand29). +card(card145). +hasCard(hand29,card145). +hasSuit(card145,diamonds). +hasRank(card145,king). +sameSuit(card145,card148). + +card(card146). +hasCard(hand29,card146). +hasSuit(card146,spades). +hasRank(card146,seven). +sameSuit(card146,card149). + +card(card147). +hasCard(hand29,card147). +hasSuit(card147,clubs). +hasRank(card147,jack). +sameRank(card147,card148). +sameRank(card147,card149). + +card(card148). +hasCard(hand29,card148). +hasSuit(card148,diamonds). +hasRank(card148,jack). +sameRank(card148,card149). + +card(card149). +hasCard(hand29,card149). +hasSuit(card149,spades). +hasRank(card149,jack). + ++pair(hand29). + +deck(hand30). +card(card150). +hasCard(hand30,card150). +hasSuit(card150,clubs). +hasRank(card150,two). + +card(card151). +hasCard(hand30,card151). +hasSuit(card151,spades). +hasRank(card151,seven). +sameSuit(card151,card153). + +card(card152). +hasCard(hand30,card152). +hasSuit(card152,diamonds). +hasRank(card152,king). +sameSuit(card152,card154). + +card(card153). +hasCard(hand30,card153). +hasSuit(card153,spades). +hasRank(card153,jack). + +card(card154). +hasCard(hand30,card154). +hasSuit(card154,diamonds). +hasRank(card154,ten). +nextRank(card154,card153). + +-pair(hand30). + +deck(hand31). +card(card155). +hasCard(hand31,card155). +hasSuit(card155,hearts). +hasRank(card155,jack). +sameSuit(card155,card157). +sameSuit(card155,card159). + +card(card156). +hasCard(hand31,card156). +hasSuit(card156,spades). +hasRank(card156,seven). + +card(card157). +hasCard(hand31,card157). +hasSuit(card157,hearts). +hasRank(card157,six). +sameSuit(card157,card159). +nextRank(card157,card156). + +card(card158). +hasCard(hand31,card158). +hasSuit(card158,clubs). +hasRank(card158,two). + +card(card159). +hasCard(hand31,card159). +hasSuit(card159,hearts). +hasRank(card159,ace). +nextRank(card159,card158). + +-pair(hand31). + +deck(hand32). +card(card160). +hasCard(hand32,card160). +hasSuit(card160,diamonds). +hasRank(card160,four). +sameSuit(card160,card162). +nextRank(card160,card162). + +card(card161). +hasCard(hand32,card161). +hasSuit(card161,clubs). +hasRank(card161,three). +nextRank(card161,card160). + +card(card162). +hasCard(hand32,card162). +hasSuit(card162,diamonds). +hasRank(card162,five). + +card(card163). +hasCard(hand32,card163). +hasSuit(card163,spades). +hasRank(card163,queen). + +card(card164). +hasCard(hand32,card164). +hasSuit(card164,hearts). +hasRank(card164,nine). + +-pair(hand32). + +deck(hand33). +card(card165). +hasCard(hand33,card165). +hasSuit(card165,diamonds). +hasRank(card165,two). +nextRank(card165,card168). + +card(card166). +hasCard(hand33,card166). +hasSuit(card166,hearts). +hasRank(card166,six). + +card(card167). +hasCard(hand33,card167). +hasSuit(card167,spades). +hasRank(card167,jack). +sameSuit(card167,card169). + +card(card168). +hasCard(hand33,card168). +hasSuit(card168,clubs). +hasRank(card168,three). + +card(card169). +hasCard(hand33,card169). +hasSuit(card169,spades). +hasRank(card169,ten). +nextRank(card169,card167). + +-pair(hand33). + +deck(hand34). +card(card170). +hasCard(hand34,card170). +hasSuit(card170,clubs). +hasRank(card170,eight). +sameSuit(card170,card171). +sameSuit(card170,card172). +sameSuit(card170,card173). + +card(card171). +hasCard(hand34,card171). +hasSuit(card171,clubs). +hasRank(card171,three). +sameSuit(card171,card172). +sameSuit(card171,card173). + +card(card172). +hasCard(hand34,card172). +hasSuit(card172,clubs). +hasRank(card172,king). +sameSuit(card172,card173). +nextRank(card172,card174). + +card(card173). +hasCard(hand34,card173). +hasSuit(card173,clubs). +hasRank(card173,queen). +nextRank(card173,card172). + +card(card174). +hasCard(hand34,card174). +hasSuit(card174,hearts). +hasRank(card174,ace). + +-pair(hand34). + +deck(hand35). +card(card175). +hasCard(hand35,card175). +hasSuit(card175,spades). +hasRank(card175,six). +sameSuit(card175,card178). + +card(card176). +hasCard(hand35,card176). +hasSuit(card176,clubs). +hasRank(card176,eight). +sameSuit(card176,card177). + +card(card177). +hasCard(hand35,card177). +hasSuit(card177,clubs). +hasRank(card177,three). + +card(card178). +hasCard(hand35,card178). +hasSuit(card178,spades). +hasRank(card178,two). +sameRank(card178,card179). +nextRank(card178,card177). + +card(card179). +hasCard(hand35,card179). +hasSuit(card179,hearts). +hasRank(card179,two). +nextRank(card179,card177). + ++pair(hand35). + +deck(hand36). +card(card180). +hasCard(hand36,card180). +hasSuit(card180,clubs). +hasRank(card180,king). + +card(card181). +hasCard(hand36,card181). +hasSuit(card181,hearts). +hasRank(card181,six). +sameSuit(card181,card183). + +card(card182). +hasCard(hand36,card182). +hasSuit(card182,diamonds). +hasRank(card182,eight). + +card(card183). +hasCard(hand36,card183). +hasSuit(card183,hearts). +hasRank(card183,three). +sameRank(card183,card184). + +card(card184). +hasCard(hand36,card184). +hasSuit(card184,spades). +hasRank(card184,three). + ++pair(hand36). + +deck(hand37). +card(card185). +hasCard(hand37,card185). +hasSuit(card185,spades). +hasRank(card185,nine). +sameSuit(card185,card186). +nextRank(card185,card186). + +card(card186). +hasCard(hand37,card186). +hasSuit(card186,spades). +hasRank(card186,ten). +nextRank(card186,card187). + +card(card187). +hasCard(hand37,card187). +hasSuit(card187,clubs). +hasRank(card187,jack). +sameSuit(card187,card188). +sameSuit(card187,card189). + +card(card188). +hasCard(hand37,card188). +hasSuit(card188,clubs). +hasRank(card188,seven). +sameSuit(card188,card189). + +card(card189). +hasCard(hand37,card189). +hasSuit(card189,clubs). +hasRank(card189,three). + +-pair(hand37). + +deck(hand38). +card(card190). +hasCard(hand38,card190). +hasSuit(card190,spades). +hasRank(card190,ten). +sameSuit(card190,card193). +sameSuit(card190,card194). + +card(card191). +hasCard(hand38,card191). +hasSuit(card191,diamonds). +hasRank(card191,queen). +nextRank(card191,card194). + +card(card192). +hasCard(hand38,card192). +hasSuit(card192,hearts). +hasRank(card192,two). +sameRank(card192,card193). + +card(card193). +hasCard(hand38,card193). +hasSuit(card193,spades). +hasRank(card193,two). +sameSuit(card193,card194). + +card(card194). +hasCard(hand38,card194). +hasSuit(card194,spades). +hasRank(card194,king). + ++pair(hand38). + +deck(hand39). +card(card195). +hasCard(hand39,card195). +hasSuit(card195,spades). +hasRank(card195,five). +sameSuit(card195,card196). +sameSuit(card195,card197). + +card(card196). +hasCard(hand39,card196). +hasSuit(card196,spades). +hasRank(card196,queen). +sameSuit(card196,card197). + +card(card197). +hasCard(hand39,card197). +hasSuit(card197,spades). +hasRank(card197,three). +sameRank(card197,card199). + +card(card198). +hasCard(hand39,card198). +hasSuit(card198,hearts). +hasRank(card198,two). +nextRank(card198,card197). +nextRank(card198,card199). + +card(card199). +hasCard(hand39,card199). +hasSuit(card199,diamonds). +hasRank(card199,three). + ++pair(hand39). + +deck(hand40). +card(card200). +hasCard(hand40,card200). +hasSuit(card200,spades). +hasRank(card200,eight). +sameSuit(card200,card202). +sameRank(card200,card204). + +card(card201). +hasCard(hand40,card201). +hasSuit(card201,diamonds). +hasRank(card201,two). + +card(card202). +hasCard(hand40,card202). +hasSuit(card202,spades). +hasRank(card202,five). + +card(card203). +hasCard(hand40,card203). +hasSuit(card203,hearts). +hasRank(card203,queen). + +card(card204). +hasCard(hand40,card204). +hasSuit(card204,clubs). +hasRank(card204,eight). + ++pair(hand40). + +deck(hand41). +card(card205). +hasCard(hand41,card205). +hasSuit(card205,spades). +hasRank(card205,ace). + +card(card206). +hasCard(hand41,card206). +hasSuit(card206,clubs). +hasRank(card206,seven). +sameSuit(card206,card207). +sameSuit(card206,card208). + +card(card207). +hasCard(hand41,card207). +hasSuit(card207,clubs). +hasRank(card207,six). +sameSuit(card207,card208). +nextRank(card207,card206). + +card(card208). +hasCard(hand41,card208). +hasSuit(card208,clubs). +hasRank(card208,five). +sameRank(card208,card209). +nextRank(card208,card207). + +card(card209). +hasCard(hand41,card209). +hasSuit(card209,hearts). +hasRank(card209,five). +nextRank(card209,card207). + ++pair(hand41). + +deck(hand42). +card(card210). +hasCard(hand42,card210). +hasSuit(card210,diamonds). +hasRank(card210,king). +sameSuit(card210,card212). +nextRank(card210,card211). + +card(card211). +hasCard(hand42,card211). +hasSuit(card211,spades). +hasRank(card211,ace). +sameSuit(card211,card214). + +card(card212). +hasCard(hand42,card212). +hasSuit(card212,diamonds). +hasRank(card212,seven). + +card(card213). +hasCard(hand42,card213). +hasSuit(card213,hearts). +hasRank(card213,three). + +card(card214). +hasCard(hand42,card214). +hasSuit(card214,spades). +hasRank(card214,six). +nextRank(card214,card212). + +-pair(hand42). + +deck(hand43). +card(card215). +hasCard(hand43,card215). +hasSuit(card215,clubs). +hasRank(card215,ten). +sameSuit(card215,card216). +sameRank(card215,card219). + +card(card216). +hasCard(hand43,card216). +hasSuit(card216,clubs). +hasRank(card216,king). + +card(card217). +hasCard(hand43,card217). +hasSuit(card217,diamonds). +hasRank(card217,five). + +card(card218). +hasCard(hand43,card218). +hasSuit(card218,spades). +hasRank(card218,eight). + +card(card219). +hasCard(hand43,card219). +hasSuit(card219,hearts). +hasRank(card219,ten). + ++pair(hand43). + +deck(hand44). +card(card220). +hasCard(hand44,card220). +hasSuit(card220,hearts). +hasRank(card220,two). +sameSuit(card220,card221). +sameSuit(card220,card223). + +card(card221). +hasCard(hand44,card221). +hasSuit(card221,hearts). +hasRank(card221,jack). +sameSuit(card221,card223). + +card(card222). +hasCard(hand44,card222). +hasSuit(card222,diamonds). +hasRank(card222,nine). +sameSuit(card222,card224). + +card(card223). +hasCard(hand44,card223). +hasSuit(card223,hearts). +hasRank(card223,seven). + +card(card224). +hasCard(hand44,card224). +hasSuit(card224,diamonds). +hasRank(card224,five). + +-pair(hand44). + +deck(hand45). +card(card225). +hasCard(hand45,card225). +hasSuit(card225,spades). +hasRank(card225,two). +sameSuit(card225,card227). +sameSuit(card225,card228). + +card(card226). +hasCard(hand45,card226). +hasSuit(card226,diamonds). +hasRank(card226,ace). +nextRank(card226,card225). + +card(card227). +hasCard(hand45,card227). +hasSuit(card227,spades). +hasRank(card227,jack). +sameSuit(card227,card228). + +card(card228). +hasCard(hand45,card228). +hasSuit(card228,spades). +hasRank(card228,six). + +card(card229). +hasCard(hand45,card229). +hasSuit(card229,clubs). +hasRank(card229,four). + +-pair(hand45). + +deck(hand46). +card(card230). +hasCard(hand46,card230). +hasSuit(card230,hearts). +hasRank(card230,ten). +sameSuit(card230,card234). + +card(card231). +hasCard(hand46,card231). +hasSuit(card231,clubs). +hasRank(card231,ace). +sameSuit(card231,card232). +sameSuit(card231,card233). + +card(card232). +hasCard(hand46,card232). +hasSuit(card232,clubs). +hasRank(card232,four). +sameSuit(card232,card233). + +card(card233). +hasCard(hand46,card233). +hasSuit(card233,clubs). +hasRank(card233,queen). + +card(card234). +hasCard(hand46,card234). +hasSuit(card234,hearts). +hasRank(card234,nine). +nextRank(card234,card230). + +-pair(hand46). + +deck(hand47). +card(card235). +hasCard(hand47,card235). +hasSuit(card235,clubs). +hasRank(card235,nine). +sameRank(card235,card238). +sameSuit(card235,card239). + +card(card236). +hasCard(hand47,card236). +hasSuit(card236,diamonds). +hasRank(card236,king). +sameSuit(card236,card238). +nextRank(card236,card237). + +card(card237). +hasCard(hand47,card237). +hasSuit(card237,spades). +hasRank(card237,ace). + +card(card238). +hasCard(hand47,card238). +hasSuit(card238,diamonds). +hasRank(card238,nine). + +card(card239). +hasCard(hand47,card239). +hasSuit(card239,clubs). +hasRank(card239,queen). +nextRank(card239,card236). + ++pair(hand47). + +deck(hand48). +card(card240). +hasCard(hand48,card240). +hasSuit(card240,clubs). +hasRank(card240,ace). +sameRank(card240,card241). +sameSuit(card240,card243). + +card(card241). +hasCard(hand48,card241). +hasSuit(card241,diamonds). +hasRank(card241,ace). + +card(card242). +hasCard(hand48,card242). +hasSuit(card242,hearts). +hasRank(card242,three). +nextRank(card242,card243). + +card(card243). +hasCard(hand48,card243). +hasSuit(card243,clubs). +hasRank(card243,four). + +card(card244). +hasCard(hand48,card244). +hasSuit(card244,spades). +hasRank(card244,jack). + ++pair(hand48). + Deleted: trunk/examples/poker/poker_pair.conf =================================================================== --- trunk/examples/poker/poker_pair.conf 2008-02-13 11:00:52 UTC (rev 556) +++ trunk/examples/poker/poker_pair.conf 2008-02-13 11:02:08 UTC (rev 557) @@ -1,1680 +0,0 @@ -/** - * Automatically created random poker decks (the UCI-ML-Repository Poker example - * was transformed to a conf file). The goal is to learn the concept of a pair - * (two cards with equal rank). - * - * possible solution: - * EXISTS hasCard.EXISTS sameRank.TOP - * - * Copyright (C) 2007, Jens Lehmann - */ - -deck(hand0). -card(card0). -hasCard(hand0,card0). -hasSuit(card0,hearts). -hasRank(card0,ten). -sameSuit(card0,card1). -sameSuit(card0,card2). -sameSuit(card0,card3). -sameSuit(card0,card4). -nextRank(card0,card1). - -card(card1). -hasCard(hand0,card1). -hasSuit(card1,hearts). -hasRank(card1,jack). -sameSuit(card1,card2). -sameSuit(card1,card3). -sameSuit(card1,card4). -nextRank(card1,card3). - -card(card2). -hasCard(hand0,card2). -hasSuit(card2,hearts). -hasRank(card2,king). -sameSuit(card2,card3). -sameSuit(card2,card4). -nextRank(card2,card4). - -card(card3). -hasCard(hand0,card3). -hasSuit(card3,hearts). -hasRank(card3,queen). -sameSuit(card3,card4). -nextRank(card3,card2). - -card(card4). -hasCard(hand0,card4). -hasSuit(card4,hearts). -hasRank(card4,ace). - --pair(hand0). - -deck(hand1). -card(card5). -hasCard(hand1,card5). -hasSuit(card5,spades). -hasRank(card5,jack). -sameSuit(card5,card6). -sameSuit(card5,card7). -sameSuit(card5,card8). -sameSuit(card5,card9). -nextRank(card5,card8). - -card(card6). -hasCard(hand1,card6). -hasSuit(card6,spades). -hasRank(card6,king). -sameSuit(card6,card7). -sameSuit(card6,card8). -sameSuit(card6,card9). -nextRank(card6,card9). - -card(card7). -hasCard(hand1,card7). -hasSuit(card7,spades). -hasRank(card7,ten). -sameSuit(card7,card8). -sameSuit(card7,card9). -nextRank(card7,card5). - -card(card8). -hasCard(hand1,card8). -hasSuit(card8,spades). -hasRank(card8,queen). -sameSuit(card8,card9). -nextRank(card8,card6). - -card(card9). -hasCard(hand1,card9). -hasSuit(card9,spades). -hasRank(card9,ace). - --pair(hand1). - -deck(hand2). -card(card10). -hasCard(hand2,card10). -hasSuit(card10,diamonds). -hasRank(card10,queen). -sameSuit(card10,card11). -sameSuit(card10,card12). -sameSuit(card10,card13). -sameSuit(card10,card14). -nextRank(card10,card12). - -card(card11). -hasCard(hand2,card11). -hasSuit(card11,diamonds). -hasRank(card11,jack). -sameSuit(card11,card12). -sameSuit(card11,card13). -sameSuit(card11,card14). -nextRank(card11,card10). - -card(card12). -hasCard(hand2,card12). -hasSuit(card12,diamonds). -hasRank(card12,king). -sameSuit(card12,card13). -sameSuit(card12,card14). -nextRank(card12,card14). - -card(card13). -hasCard(hand2,card13). -hasSuit(card13,diamonds). -hasRank(card13,ten). -sameSuit(card13,card14). -nextRank(card13,card11). - -card(card14). -hasCard(hand2,card14). -hasSuit(card14,diamonds). -hasRank(card14,ace). - --pair(hand2). - -deck(hand3). -card(card15). -hasCard(hand3,card15). -hasSuit(card15,clubs). -hasRank(card15,ten). -sameSuit(card15,card16). -sameSuit(card15,card17). -sameSuit(card15,card18). -sameSuit(card15,card19). -nextRank(card15,card16). - -card(card16). -hasCard(hand3,card16). -hasSuit(card16,clubs). -hasRank(card16,jack). -sameSuit(card16,card17). -sameSuit(card16,card18). -sameSuit(card16,card19). -nextRank(card16,card19). - -card(card17). -hasCard(hand3,card17). -hasSuit(card17,clubs). -hasRank(card17,ace). -sameSuit(card17,card18). -sameSuit(card17,card19). - -card(card18). -hasCard(hand3,card18). -hasSuit(card18,clubs). -hasRank(card18,king). -sameSuit(card18,card19). -nextRank(card18,card17). - -card(card19). -hasCard(hand3,card19). -hasSuit(card19,clubs). -hasRank(card19,queen). -nextRank(card19,card18). - --pair(hand3). - -deck(hand4). -card(card20). -hasCard(hand4,card20). -hasSuit(card20,hearts). -hasRank(card20,two). -sameSuit(card20,card21). -sameSuit(card20,card22). -sameSuit(card20,card23). -sameSuit(card20,card24). -nextRank(card20,card23). - -card(card21). -hasCard(hand4,card21). -hasSuit(card21,hearts). -hasRank(card21,four). -sameSuit(card21,card22). -sameSuit(card21,card23). -sameSuit(card21,card24). -nextRank(card21,card22). - -card(card22). -hasCard(hand4,card22). -hasSuit(card22,hearts). -hasRank(card22,five). -sameSuit(card22,card23). -sameSuit(card22,card24). -nextRank(card22,card24). - -card(card23). -hasCard(hand4,card23). -hasSuit(card23,hearts). -hasRank(card23,three). -sameSuit(card23,card24). -nextRank(card23,card21). - -card(card24). -hasCard(hand4,card24). -hasSuit(card24,hearts). -hasRank(card24,six). - --pair(hand4). - -deck(hand5). -card(card25). -hasCard(hand5,card25). -hasSuit(card25,hearts). -hasRank(card25,nine). -sameSuit(card25,card26). -sameSuit(card25,card27). -sameSuit(card25,card28). -sameSuit(card25,card29). -nextRank(card25,card27). - -card(card26). -hasCard(hand5,card26). -hasSuit(card26,hearts). -hasRank(card26,queen). -sameSuit(card26,card27). -sameSuit(card26,card28). -sameSuit(card26,card29). -nextRank(card26,card29). - -card(card27). -hasCard(hand5,card27). -hasSuit(card27,hearts). -hasRank(card27,ten). -sameSuit(card27,card28). -sameSuit(card27,card29). -nextRank(card27,card28). - -card(card28). -hasCard(hand5,card28). -hasSuit(card28,hearts). -hasRank(card28,jack). -sameSuit(card28,card29). -nextRank(card28,card26). - -card(card29). -hasCard(hand5,card29). -hasSuit(card29,hearts). -hasRank(card29,king). - --pair(hand5). - -deck(hand6). -card(card30). -hasCard(hand6,card30). -hasSuit(card30,spades). -hasRank(card30,ace). -sameSuit(card30,card31). -sameSuit(card30,card32). -sameSuit(card30,card33). -sameSuit(card30,card34). -nextRank(card30,card31). - -card(card31). -hasCard(hand6,card31). -hasSuit(card31,spades). -hasRank(card31,two). -sameSuit(card31,card32). -sameSuit(card31,card33). -sameSuit(card31,card34). -nextRank(card31,card32). - -card(card32). -hasCard(hand6,card32). -hasSuit(card32,spades). -hasRank(card32,three). -sameSuit(card32,card33). -sameSuit(card32,card34). -nextRank(card32,card33). - -card(card33). -hasCard(hand6,card33). -hasSuit(card33,spades). -hasRank(card33,four). -sameSuit(card33,card34). -nextRank(card33,card34). - -card(card34). -hasCard(hand6,card34). -hasSuit(card34,spades). -hasRank(card34,five). - --pair(hand6). - -deck(hand7). -card(card35). -hasCard(hand7,card35). -hasSuit(card35,diamonds). -hasRank(card35,five). -sameSuit(card35,card36). -sameSuit(card35,card37). -sameSuit(card35,card38). -sameSuit(card35,card39). -nextRank(card35,card36). - -card(card36). -hasCard(hand7,card36). -hasSuit(card36,diamonds). -hasRank(card36,six). -sameSuit(card36,card37). -sameSuit(card36,card38). -sameSuit(card36,card39). -nextRank(card36,card38). - -card(card37). -hasCard(hand7,card37). -hasSuit(card37,diamonds). -hasRank(card37,nine). -sameSuit(card37,card38). -sameSuit(card37,card39). - -card(card38). -hasCard(hand7,card38). -hasSuit(card38,diamonds). -hasRank(card38,seven). -sameSuit(card38,card39). -nextRank(card38,card39). - -card(card39). -hasCard(hand7,card39). -hasSuit(card39,diamonds). -hasRank(card39,eight). -nextRank(card39,card37). - --pair(hand7). - -deck(hand8). -card(card40). -hasCard(hand8,card40). -hasSuit(card40,clubs). -hasRank(card40,ace). -sameSuit(card40,card41). -sameSuit(card40,card42). -sameSuit(card40,card43). -sameSuit(card40,card44). -nextRank(card40,card42). - -card(card41). -hasCard(hand8,card41). -hasSuit(card41,clubs). -hasRank(card41,four). -sameSuit(card41,card42). -sameSuit(card41,card43). -sameSuit(card41,card44). -nextRank(card41,card44). - -card(card42). -hasCard(hand8,card42). -hasSuit(card42,clubs). -hasRank(card42,two). -sameSuit(card42,card43). -sameSuit(card42,card44). -nextRank(card42,card43). - -card(card43). -hasCard(hand8,card43). -hasSuit(card43,clubs). -hasRank(card43,three). -sameSuit(card43,card44). -nextRank(card43,card41). - -card(card44). -hasCard(hand8,card44). -hasSuit(card44,clubs). -hasRank(card44,five). - --pair(hand8). - -deck(hand9). -card(card45). -hasCard(hand9,card45). -hasSuit(card45,hearts). -hasRank(card45,ace). -sameRank(card45,card46). -sameSuit(card45,card48). - -card(card46). -hasCard(hand9,card46). -hasSuit(card46,spades). -hasRank(card46,ace). -sameSuit(card46,card49). - -card(card47). -hasCard(hand9,card47). -hasSuit(card47,diamonds). -hasRank(card47,nine). - -card(card48). -hasCard(hand9,card48). -hasSuit(card48,hearts). -hasRank(card48,five). - -card(card49). -hasCard(hand9,card49). -hasSuit(card49,spades). -hasRank(card49,three). - -+pair(hand9). - -deck(hand10). -card(card50). -hasCard(hand10,card50). -hasSuit(card50,spades). -hasRank(card50,six). -sameSuit(card50,card51). -sameSuit(card50,card53). - -card(card51). -hasCard(hand10,card51). -hasSuit(card51,spades). -hasRank(card51,ace). -sameSuit(card51,card53). - -card(card52). -hasCard(hand10,card52). -hasSuit(card52,clubs). -hasRank(card52,king). -sameSuit(card52,card54). -nextRank(card52,card51). - -card(card53). -hasCard(hand10,card53). -hasSuit(card53,spades). -hasRank(card53,four). - -card(card54). -hasCard(hand10,card54). -hasSuit(card54,clubs). -hasRank(card54,nine). - --pair(hand10). - -deck(hand11). -card(card55). -hasCard(hand11,card55). -hasSuit(card55,hearts). -hasRank(card55,ten). -sameSuit(card55,card57). -sameSuit(card55,card58). - -card(card56). -hasCard(hand11,card56). -hasSuit(card56,clubs). -hasRank(card56,six). - -card(card57). -hasCard(hand11,card57). -hasSuit(card57,hearts). -hasRank(card57,two). -sameSuit(card57,card58). - -card(card58). -hasCard(hand11,card58). -hasSuit(card58,hearts). -hasRank(card58,ace). -nextRank(card58,card57). - -card(card59). -hasCard(hand11,card59). -hasSuit(card59,diamonds). -hasRank(card59,eight). - --pair(hand11). - -deck(hand12). -card(card60). -hasCard(hand12,card60). -hasSuit(card60,spades). -hasRank(card60,king). -sameSuit(card60,card61). -sameSuit(card60,card64). -nextRank(card60,card61). - -card(card61). -hasCard(hand12,card61). -hasSuit(card61,spades). -hasRank(card61,ace). -sameSuit(card61,card64). - -card(card62). -hasCard(hand12,card62). -hasSuit(card62,clubs). -hasRank(card62,four). -nextRank(card62,card63). - -card(card63). -hasCard(hand12,card63). -hasSuit(card63,hearts). -hasRank(card63,five). - -card(card64). -hasCard(hand12,card64). -hasSuit(card64,spades). -hasRank(card64,jack). - --pair(hand12). - -deck(hand13). -card(card65). -hasCard(hand13,card65). -hasSuit(card65,diamonds). -hasRank(card65,eight). -sameSuit(card65,card67). -sameSuit(card65,card69). -nextRank(card65,card67). - -card(card66). -hasCard(hand13,card66). -hasSuit(card66,clubs). -hasRank(card66,queen). -sameSuit(card66,card68). - -card(card67). -hasCard(hand13,card67). -hasSuit(card67,diamonds). -hasRank(card67,nine). -sameSuit(card67,card69). - -card(card68). -hasCard(hand13,card68). -hasSuit(card68,clubs). -hasRank(card68,two). -sameRank(card68,card69). - -card(card69). -hasCard(hand13,card69). -hasSuit(card69,diamonds). -hasRank(card69,two). - -+pair(hand13). - -deck(hand14). -card(card70). -hasCard(hand14,card70). -hasSuit(card70,hearts). -hasRank(card70,three). -sameSuit(card70,card72). -nextRank(card70,card73). - -card(card71). -hasCard(hand14,card71). -hasSuit(card71,clubs). -hasRank(card71,seven). -sameSuit(card71,card74). - -card(card72). -hasCard(hand14,card72). -hasSuit(card72,hearts). -hasRank(card72,five). - -card(card73). -hasCard(hand14,card73). -hasSuit(card73,spades). -hasRank(card73,four). -nextRank(card73,card72). - -card(card74). -hasCard(hand14,card74). -hasSuit(card74,clubs). -hasRank(card74,king). - --pair(hand14). - -deck(hand15). -card(card75). -hasCard(hand15,card75). -hasSuit(card75,hearts). -hasRank(card75,four). -sameSuit(card75,card76). -sameSuit(card75,card77). -nextRank(card75,card78). - -card(card76). -hasCard(hand15,card76). -hasSuit(card76,hearts). -hasRank(card76,ace). -sameSuit(card76,card77). -nextRank(card76,card79). - -card(card77). -hasCard(hand15,card77). -hasSuit(card77,hearts). -hasRank(card77,three). -nextRank(card77,card75). - -card(card78). -hasCard(hand15,card78). -hasSuit(card78,diamonds). -hasRank(card78,five). -sameSuit(card78,card79). - -card(card79). -hasCard(hand15,card79). -hasSuit(card79,diamonds). -hasRank(card79,two). -nextRank(card79,card77). - --pair(hand15). - -deck(hand16). -card(card80). -hasCard(hand16,card80). -hasSuit(card80,diamonds). -hasRank(card80,eight). -sameSuit(card80,card81). - -card(card81). -hasCard(hand16,card81). -hasSuit(card81,diamonds). -hasRank(card81,queen). - -card(card82). -hasCard(hand16,card82). -hasSuit(card82,spades). -hasRank(card82,seven). -sameSuit(card82,card83). -nextRank(card82,card80). - -card(card83). -hasCard(hand16,card83). -hasSuit(card83,spades). -hasRank(card83,six). -nextRank(card83,card82). - -card(card84). -hasCard(hand16,card84). -hasSuit(card84,hearts). -hasRank(card84,two). - --pair(hand16). - -deck(hand17). -card(card85). -hasCard(hand17,card85). -hasSuit(card85,clubs). -hasRank(card85,eight). -sameSuit(card85,card87). -sameSuit(card85,card89). - -card(card86). -hasCard(hand17,card86). -hasSuit(card86,hearts). -hasRank(card86,jack). -nextRank(card86,card89). - -card(card87). -hasCard(hand17,card87). -hasSuit(card87,clubs). -hasRank(card87,six). -sameSuit(card87,card89). - -card(card88). -hasCard(hand17,card88). -hasSuit(card88,diamonds). -hasRank(card88,two). - -card(card89). -hasCard(hand17,card89). -hasSuit(card89,clubs). -hasRank(card89,queen). - --pair(hand17). - -deck(hand18). -card(card90). -hasCard(hand18,card90). -hasSuit(card90,diamonds). -hasRank(card90,seven). -sameRank(card90,card91). -sameSuit(card90,card94). - -card(card91). -hasCard(hand18,card91). -hasSuit(card91,spades). -hasRank(card91,seven). - -card(card92). -hasCard(hand18,card92). -hasSuit(card92,clubs). -hasRank(card92,jack). -nextRank(card92,card93). - -card(card93). -hasCard(hand18,card93). -hasSuit(card93,hearts). -hasRank(card93,queen). - -card(card94). -hasCard(hand18,card94). -hasSuit(card94,diamonds). -hasRank(card94,ace). - -+pair(hand18). - -deck(hand19). -card(card95). -hasCard(hand19,card95). -hasSuit(card95,hearts). -hasRank(card95,king). -sameRank(card95,card99). - -card(card96). -hasCard(hand19,card96). -hasSuit(card96,clubs). -hasRank(card96,eight). - -card(card97). -hasCard(hand19,card97). -hasSuit(card97,spades). -hasRank(card97,seven). -sameSuit(card97,card98). -nextRank(card97,card96). - -card(card98). -hasCard(hand19,card98). -hasSuit(card98,spades). -hasRank(card98,ten). - -card(card99). -hasCard(hand19,card99). -hasSuit(card99,diamonds). -hasRank(card99,king). - -+pair(hand19). - -deck(hand20). -card(card100). -hasCard(hand20,card100). -hasSuit(card100,spades). -hasRank(card100,six). -sameSuit(card100,card101). -nextRank(card100,card104). - -card(card101). -hasCard(hand20,card101). -hasSuit(card101,spades). -hasRank(card101,eight). - -card(card102). -hasCard(hand20,card102). -hasSuit(card102,hearts). -hasRank(card102,jack). -sameSuit(card102,card103). - -card(card103). -hasCard(hand20,card103). -hasSuit(card103,hearts). -hasRank(card103,four). - -card(card104). -hasCard(hand20,card104). -hasSuit(card104,diamonds). -hasRank(card104,seven). -nextRank(card104,card101). - --pair(hand20). - -deck(hand21). -card(card105). -hasCard(hand21,card105). -hasSuit(card105,diamonds). -hasRank(card105,ten). -sameRank(card105,card106). -sameSuit(card105,card109). - -card(card106). -hasCard(hand21,card106). -hasSuit(card106,spades). -hasRank(card106,ten). - -card(card107). -hasCard(hand21,card107). -hasSuit(card107,clubs). -hasRank(card107,five). - -card(card108). -hasCard(hand21,card108). -hasSuit(card108,hearts). -hasRank(card108,two). - -card(card109). -hasCard(hand21,card109). -hasSuit(card109,diamonds). -hasRank(card109,eight). - -+pair(hand21). - -deck(hand22). -card(card110). -hasCard(hand22,card110). -hasSuit(card110,spades). -hasRank(card110,ace). -sameRank(card110,card114). - -card(card111). -hasCard(hand22,card111). -hasSuit(card111,diamonds). -hasRank(card111,king). -nextRank(card111,card110). -nextRank(card111,card114). - -card(card112). -hasCard(hand22,card112). -hasSuit(card112,clubs). -hasRank(card112,six). -sameSuit(card112,card114). - -card(card113). -hasCard(hand22,card113). -hasSuit(card113,hearts). -hasRank(card113,nine). - -card(card114). -hasCard(hand22,card114). -hasSuit(card114,clubs). -hasRank(card114,ace). - -+pair(hand22). - -deck(hand23). -card(card115). -hasCard(hand23,card115). -hasSuit(card115,spades). -hasRank(card115,ten). -sameSuit(card115,card116). -sameSuit(card115,card119). - -card(card116). -hasCard(hand23,card116). -hasSuit(card116,spades). -hasRank(card116,eight). -sameRank(card116,card117). -sameSuit(card116,card119). - -card(card117). -hasCard(hand23,card117). -hasSuit(card117,hearts). -hasRank(card117,eight). - -card(card118). -hasCard(hand23,card118). -hasSuit(card118,diamonds). -hasRank(card118,two). - -card(card119). -hasCard(hand23,card119). -hasSuit(card119,spades). -hasRank(card119,king). - -+pair(hand23). - -deck(hand24). -card(card120). -hasCard(hand24,card120). -hasSuit(card120,spades). -hasRank(card120,king). - -card(card121). -hasCard(hand24,card121). -hasSuit(card121,hearts). -hasRank(card121,five). -sameRank(card121,card122). - -card(card122). -hasCard(hand24,card122). -hasSuit(card122,clubs). -hasRank(card122,five). -sameSuit(card122,card123). - -card(card123). -hasCard(hand24,card123). -hasSuit(card123,clubs). -hasRank(card123,eight). - -card(card124). -hasCard(hand24,card124). -hasSuit(card124,diamonds). -hasRank(card124,three). - -+pair(hand24). - -deck(hand25). -card(card125). -hasCard(hand25,card125). -hasSuit(card125,diamonds). -hasRank(card125,ace). -sameSuit(card125,card128). -sameRank(card125,card129). - -card(card126). -hasCard(hand25,card126). -hasSuit(card126,hearts). -hasRank(card126,five). -sameSuit(card126,card129). - -card(card127). -hasCard(hand25,card127). -hasSuit(card127,spades). -hasRank(card127,seven). - -card(card128). -hasCard(hand25,card128). -hasSuit(card128,diamonds). -hasRank(card128,king). -nextRank(card128,card125). -nextRank(card128,card129). - -card(card129). -hasCard(hand25,card129). -hasSuit(card129,hearts). -hasRank(card129,ace). - -+pair(hand25). - -deck(hand26). -card(card130). -hasCard(hand26,card130). -hasSuit(card130,hearts). -hasRank(card130,seven). -sameSuit(card130,card131). -sameSuit(card130,card133). -nextRank(card130,card132). - -card(card131). -hasCard(hand26,card131). -hasSuit(card131,hearts). -hasRank(card131,five). -sameSuit(card131,card133). -nextRank(card131,card133). -nextRank(card131,card134). - -card(card132). -hasCard(hand26,card132). -hasSuit(card132,clubs). -hasRank(card132,eight). - -card(card133). -hasCard(hand26,card133). -hasSuit(card133,hearts). -hasRank(card133,six). -sameRank(card133,card134). -nextRank(card133,card130). - -card(card134). -hasCard(hand26,card134). -hasSuit(card134,spades). -hasRank(card134,six). -nextRank(card134,card130). - -+pair(hand26). - -deck(hand27). -card(card135). -hasCard(hand27,card135). -hasSuit(card135,diamonds). -hasRank(card135,seven). -sameSuit(card135,card136). - -card(card136). -hasCard(hand27,card136). -hasSuit(card136,diamonds). -hasRank(card136,nine). - -card(card137). -hasCard(hand27,card137). -hasSuit(card137,spades). -hasRank(card137,queen). -sameSuit(card137,card138). - -card(card138). -hasCard(hand27,card138). -hasSuit(card138,spades). -hasRank(card138,five). - -card(card139). -hasCard(hand27,card139). -hasSuit(card139,clubs). -hasRank(card139,four). -nextRank(card139,card138). - --pair(hand27). - -deck(hand28). -card(card140). -hasCard(hand28,card140). -hasSuit(card140,spades). -hasRank(card140,ten). -sameSuit(card140,card144). - -card(card141). -hasCard(hand28,card141). -hasSuit(card141,hearts). -hasRank(card141,ace). -sameSuit(card141,card142). - -card(card142). -hasCard(hand28,card142). -hasSuit(card142,hearts). -hasRank(card142,queen). - -card(card143). -hasCard(hand28,card143). -hasSuit(card143,clubs). -hasRank(card143,six). - -card(card144). -hasCard(hand28,card144). -hasSuit(card144,spades). -hasRank(card144,eight). - --pair(hand28). - -deck(hand29). -card(card145). -hasCard(hand29,card145). -hasSuit(card145,diamonds). -hasRank(card145,king). -sameSuit(card145,card148). - -card(card146). -hasCard(hand29,card146). -hasSuit(card146,spades). -hasRank(card146,seven). -sameSuit(card146,card149). - -card(card147). -hasCard(hand29,card147). -hasSuit(card147,clubs). -hasRank(card147,jack). -sameRank(card147,card148). -sameRank(card147,card149). - -card(card148). -hasCard(hand29,card148). -hasSuit(card148,diamonds). -hasRank(card148,jack). -sameRank(card148,card149). - -card(card149). -hasCard(hand29,card149). -hasSuit(card149,spades). -hasRank(card149,jack). - -+pair(hand29). - -deck(hand30). -card(card150). -hasCard(hand30,card150). -hasSuit(card150,clubs). -hasRank(card150,two). - -card(card151). -hasCard(hand30,card151). -hasSuit(card151,spades). -hasRank(card151,seven). -sameSuit(card151,card153). - -card(card152). -hasCard(hand30,card152). -hasSuit(card152,diamonds). -hasRank(card152,king). -sameSuit(card152,card154). - -card(card153). -hasCard(hand30,card153). -hasSuit(card153,spades). -hasRank(card153,jack). - -card(card154). -hasCard(hand30,card154). -hasSuit(card154,diamonds). -hasRank(card154,ten). -nextRank(card154,card153). - --pair(hand30). - -deck(hand31). -card(card155). -hasCard(hand31,card155). -hasSuit(card155,hearts). -hasRank(card155,jack). -sameSuit(card155,card157). -sameSuit(card155,card159). - -card(card156). -hasCard(hand31,card156). -hasSuit(card156,spades). -hasRank(card156,seven). - -card(card157). -hasCard(hand31,card157). -hasSuit(card157,hearts). -hasRank(card157,six). -sameSuit(card157,card159). -nextRank(card157,card156). - -card(card158). -hasCard(hand31,card158). -hasSuit(card158,clubs). -hasRank(card158,two). - -card(card159). -hasCard(hand31,card159). -hasSuit(card159,hearts). -hasRank(card159,ace). -nextRank(card159,card158). - --pair(hand31). - -deck(hand32). -card(card160). -hasCard(hand32,card160). -hasSuit(card160,diamonds). -hasRank(card160,four). -sameSuit(card160,card162). -nextRank(card160,card162). - -card(card161). -hasCard(hand32,card161). -hasSuit(card161,clubs). -hasRank(card161,three). -nextRank(card161,card160). - -card(card162). -hasCard(hand32,card162). -hasSuit(card162,diamonds). -hasRank(card162,five). - -card(card163). -hasCard(hand32,card163). -hasSuit(card163,spades). -hasRank(card163,queen). - -card(card164). -hasCard(hand32,card164). -hasSuit(card164,hearts). -hasRank(card164,nine). - --pair(hand32). - -deck(hand33). -card(card165). -hasCard(hand33,card165). -hasSuit(card165,diamonds). -hasRank(card165,two). -nextRank(card165,card168). - -card(card166). -hasCard(hand33,card166). -hasSuit(card166,hearts). -hasRank(card166,six). - -card(card167). -hasCard(hand33,card167). -hasSuit(card167,spades). -hasRank(card167,jack). -sameSuit(card167,card169). - -card(card168). -hasCard(hand33,card168). -hasSuit(card168,clubs). -hasRank(card168,three). - -card(card169). -hasCard(hand33,card169). -hasSuit(card169,spades). -hasRank(card169,ten). -nextRank(card169,card167). - --pair(hand33). - -deck(hand34). -card(card170). -hasCard(hand34,card170). -hasSuit(card170,clubs). -hasRank(card170,eight). -sameSuit(card170,card171). -sameSuit(card170,card172). -sameSuit(card170,card173). - -card(card171). -hasCard(hand34,card171). -hasSuit(card171,clubs). -hasRank(card171,three). -sameSuit(card171,card172). -sameSuit(card171,card173). - -card(card172). -hasCard(hand34,card172). -hasSuit(card172,clubs). -hasRank(card172,king). -sameSuit(card172,card173). -nextRank(card172,card174). - -card(card173). -hasCard(hand34,card173). -hasSuit(card173,clubs). -hasRank(card173,queen). -nextRank(card173,card172). - -card(card174). -hasCard(hand34,card174). -hasSuit(card174,hearts). -hasRank(card174,ace). - --pair(hand34). - -deck(hand35). -card(card175). -hasCard(hand35,card175). -hasSuit(card175,spades). -hasRank(card175,six). -sameSuit(card175,card178). - -card(card176). -hasCard(hand35,card176). -hasSuit(card176,clubs). -hasRank(card176,eight). -sameSuit(card176,card177). - -card(card177). -hasCard(hand35,card177). -hasSuit(card177,clubs). -hasRank(card177,three). - -card(card178). -hasCard(hand35,card178). -hasSuit(card178,spades). -hasRank(card178,two). -sameRank(card178,card179). -nextRank(card178,card177). - -card(card179). -hasCard(hand35,card179). -hasSuit(card179,hearts). -hasRank(card179,two). -nextRank(card179,card177). - -+pair(hand35). - -deck(hand36). -card(card180). -hasCard(hand36,card180). -hasSuit(card180,clubs). -hasRank(card180,king). - -card(card181). -hasCard(hand36,card181). -hasSuit(card181,hearts). -hasRank(card181,six). -sameSuit(card181,card183). - -card(card182). -hasCard(hand36,card182). -hasSuit(card182,diamonds). -hasRank(card182,eight). - -card(card183). -hasCard(hand36,card183). -hasSuit(card183,hearts). -hasRank(card183,three). -sameRank(card183,card184). - -card(card184). -hasCard(hand36,card184). -hasSuit(card184,spades). -hasRank(card184,three). - -+pair(hand36). - -deck(hand37). -card(card185). -hasCard(hand37,card185). -hasSuit(card185,spades). -hasRank(card185,nine). -sameSuit(card185,card186). -nextRank(card185,card186). - -card(card186). -hasCard(hand37,card186). -hasSuit(card186,spades). -hasRank(card186,ten). -nextRank(card186,card187). - -card(card187). -hasCard(hand37,card187). -hasSuit(card187,clubs). -hasRank(card187,jack). -sameSuit(card187,card188). -sameSuit(card187,card189). - -card(card188). -hasCard(hand37,card188). -hasSuit(card188,clubs). -hasRank(card188,seven). -sameSuit(card188,card189). - -card(card189). -hasCard(hand37,card189). -hasSuit(card189,clubs). -hasRank(card189,three). - --pair(hand37). - -deck(hand38). -card(card190). -hasCard(hand38,card190). -hasSuit(card190,spades). -hasRank(card190,ten). -sameSuit(card190,card193). -sameSuit(card190,card194). - -card(card191). -hasCard(hand38,card191). -hasSuit(card191,diamonds). -hasRank(card191,queen). -nextRank(card191,card194). - -card(card192). -hasCard(hand38,card192). -hasSuit(card192,hearts). -hasRank(card192,two). -sameRank(card192,card193). - -card(card193). -hasCard(hand38,card193). -hasSuit(card193,spades). -hasRank(card193,two). -sameSuit(card193,card194). - -card(card194). -hasCard(hand38,card194). -hasSuit(card194,spades). -hasRank(card194,king). - -+pair(hand38). - -deck(hand39). -card(card195). -hasCard(hand39,card195). -hasSuit(card195,spades). -hasRank(card195,five). -sameSuit(card195,card196). -sameSuit(card195,card197). - -card(card196). -hasCard(hand39,card196). -hasSuit(card196,spades). -hasRank(card196,queen). -sameSuit(card196,card197). - -card(card197). -hasCard(hand39,card197). -hasSuit(card197,spades). -hasRank(card197,three). -sameRank(card197,card199). - -card(card198). -hasCard(hand39,card198). -hasSuit(card198,hearts). -hasRank(card198,two). -nextRank(card198,card197). -nextRank(card198,card199). - -card(card199). -hasCard(hand39,card199). -hasSuit(card199,diamonds). -hasRank(card199,three). - -+pair(hand39). - -deck(hand40). -card(card200). -hasCard(hand40,card200). -hasSuit(card200,spades). -hasRank(card200,eight). -sameSuit(card200,card202). -sameRank(card200,card204). - -card(card201). -hasCard(hand40,card201). -hasSuit(card201,diamonds). -hasRank(card201,two). - -card(card202). -hasCard(hand40,card202). -hasSuit(card202,spades). -hasRank(card202,five). - -card(card203). -hasCard(hand40,card203). -hasSuit(card203,hearts). -hasRank(car... [truncated message content] |
From: <ku...@us...> - 2008-02-13 11:00:54
|
Revision: 556 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=556&view=rev Author: kurzum Date: 2008-02-13 03:00:52 -0800 (Wed, 13 Feb 2008) Log Message: ----------- moral Modified Paths: -------------- trunk/examples/moral_reasoner/moral_43examples_complex.conf trunk/examples/moral_reasoner/moral_43examples_complex_owl.conf trunk/examples/moral_reasoner/moral_43examples_simple.conf trunk/examples/moral_reasoner/moral_43examples_simple_owl.conf trunk/examples/moral_reasoner/moral_all_examples_complex.conf trunk/examples/moral_reasoner/moral_all_examples_complex_owl.conf trunk/examples/moral_reasoner/moral_all_examples_simple.conf trunk/examples/moral_reasoner/moral_all_examples_simple_owl.conf Added Paths: ----------- trunk/examples/moral_reasoner/README.txt trunk/examples/moral_reasoner/moral.kb trunk/examples/moral_reasoner/moral_43_instances.kb trunk/examples/moral_reasoner/moral_43_instances_complex.kb Removed Paths: ------------- trunk/examples/moral_reasoner/README Deleted: trunk/examples/moral_reasoner/README =================================================================== --- trunk/examples/moral_reasoner/README 2008-02-13 10:36:25 UTC (rev 555) +++ trunk/examples/moral_reasoner/README 2008-02-13 11:00:52 UTC (rev 556) @@ -1,19 +0,0 @@ -Moral Reasoner Examples -======================= - -Taken from http://mlearn.ics.uci.edu/databases/moral-reasoner/. - -Explanations for the files in this directory: - -OWL-files: - - "43instances" means that the number of instances has been reduced to 43 - from the original example - - "complex" means that a definition has been left out to make the learned - concept more complex - - complete - -Conf-files: - - "43examples" means that these learning examples do not use all examples but - just 43 - - "owl" means that these examples read the corresponding OWL files (instead - of using internal Syntax in conf files) Copied: trunk/examples/moral_reasoner/README.txt (from rev 551, trunk/examples/moral_reasoner/README) =================================================================== --- trunk/examples/moral_reasoner/README.txt (rev 0) +++ trunk/examples/moral_reasoner/README.txt 2008-02-13 11:00:52 UTC (rev 556) @@ -0,0 +1,19 @@ +Moral Reasoner Examples +======================= + +Taken from http://mlearn.ics.uci.edu/databases/moral-reasoner/. + +Explanations for the files in this directory: + +OWL-files: + - "43instances" means that the number of instances has been reduced to 43 + from the original example + - "complex" means that a definition has been left out to make the learned + concept more complex + - complete + +Conf-files: + - "43examples" means that these learning examples do not use all examples but + just 43 + - "owl" means that these examples read the corresponding OWL files (instead + of using internal Syntax in conf files) Added: trunk/examples/moral_reasoner/moral.kb =================================================================== --- trunk/examples/moral_reasoner/moral.kb (rev 0) +++ trunk/examples/moral_reasoner/moral.kb 2008-02-13 11:00:52 UTC (rev 556) @@ -0,0 +1,4971 @@ + /*********************** + kb containing all concepts and all instances + + ***********************/ + + + +/** background knowledge **/ + +intend_mental_state = (NOT reckless_mental_state AND (NOT negligent_mental_state AND NOT neither_mental_state)). +reckless_mental_state = (NOT intend_mental_state AND (NOT negligent_mental_state AND NOT neither_mental_state)). +negligent_mental_state = (NOT reckless_mental_state AND (NOT intend_mental_state AND NOT neither_mental_state)). +neither_mental_state = (NOT reckless_mental_state AND (NOT negligent_mental_state AND NOT intend_mental_state)). + + + +cause = (produce_harm OR (necessary_for_harm OR sufficient_for_harm)). + + +responsible = ( cause AND + ( notaccident AND + (voluntary AND + (foreseeable AND + NOT intervening_cause)))). + + +notaccident = (intend_c OR (reckless_c OR negligent_c)). + + +foreseeable = (high_foreseeability OR low_foreseeability ). + + +reckless_c = ( reckless_mental_state OR + + ( NOT careful AND + ( high_foreseeability AND + NOT strong_intend + ))) . + + + +negligent_c = ( negligent_mental_state OR + ( NOT careful AND + ( NOT strong_intend AND + low_foreseeability + ))). + + + +intend_c = (strong_intend OR weak_intend). + + +strong_intend = ( intend_mental_state OR + + ( plan_known AND + ( plan_include_harm AND + harm_caused_as_planned)) + ). + + + + weak_intend = ( ( monitor OR + (benefit_protagonist AND + NOT external_cause )) + + AND + ( NOT negligent_c AND + NOT reckless_c) ). + + + + +voluntary = NOT external_force. + + +intervening_cause = ( intervening_contribution AND + NOT foresee_intervention ). + + + +vicarious = ( someone_else_cause_harm AND + ( outrank_perpetrator AND + control_perpetrator )). + + +blameworthy = ( responsible AND + ( severity_harm AND + ( NOT benefit_victim AND + NOT justified ))). + + +vicarious_blame = ( vicarious AND + ( severity_harm AND + ( NOT benefit_victim AND + NOT justified ))). + + + + +justified= + ( achieve_goal AND + ( goal_outweigh_harm AND + NOT goal_achieveable_less_harmful)). + + +guilty = (blameworthy OR vicarious_blame ). + +/******************** + + + + + +/**Example**/ + +NOT sufficient_for_harm(p0). +produce_harm(p0). +plan_known(p0). +plan_include_harm(p0). +NOT someone_else_cause_harm(p0). +NOT outrank_perpetrator(p0). +monitor(p0). +harm_caused_as_planned(p0). +goal_outweigh_harm(p0). +NOT goal_achieveable_less_harmful(p0). +foresee_intervention(p0). +NOT external_cause(p0). +control_perpetrator(p0). +benefit_protagonist(p0). +careful(p0). +NOT benefit_victim(p0). +severity_harm(p0). +NOT achieve_goal(p0). +NOT intervening_contribution(p0). +high_foreseeability(p0). +NOT external_force(p0). +negligent_mental_state(p0). +necessary_for_harm(p0). + +NOT produce_harm(p1). +NOT plan_known(p1). +NOT plan_include_harm(p1). +NOT someone_else_cause_harm(p1). +outrank_perpetrator(p1). +NOT necessary_for_harm(p1). +monitor(p1). +NOT intervening_contribution(p1). +harm_caused_as_planned(p1). +NOT goal_outweigh_harm(p1). +goal_achieveable_less_harmful(p1). +NOT external_cause(p1). +control_perpetrator(p1). +benefit_protagonist(p1). +NOT careful(p1). +NOT benefit_victim(p1). +severity_harm(p1). +NOT achieve_goal(p1). +foresee_intervention(p1). +high_foreseeability(p1). +NOT external_force(p1). +negligent_mental_state(p1). +sufficient_for_harm(p1). + +sufficient_for_harm(p2). +NOT plan_known(p2). +NOT plan_include_harm(p2). +NOT someone_else_cause_harm(p2). +outrank_perpetrator(p2). +necessary_for_harm(p2). +monitor(p2). +harm_caused_as_planned(p2). +goal_outweigh_harm(p2). +NOT goal_achieveable_less_harmful(p2). +NOT foresee_intervention(p2). +external_cause(p2). +control_perpetrator(p2). +benefit_protagonist(p2). +NOT careful(p2). +NOT benefit_victim(p2). +severity_harm(p2). +NOT achieve_goal(p2). +NOT intervening_contribution(p2). +high_foreseeability(p2). +NOT external_force(p2). +negligent_mental_state(p2). +produce_harm(p2). + +sufficient_for_harm(p3). +produce_harm(p3). +plan_known(p3). +plan_include_harm(p3). +NOT someone_else_cause_harm(p3). +outrank_perpetrator(p3). +monitor(p3). +NOT intervening_contribution(p3). +harm_caused_as_planned(p3). +goal_outweigh_harm(p3). +NOT external_cause(p3). +control_perpetrator(p3). +benefit_protagonist(p3). +NOT achieve_goal(p3). +NOT careful(p3). +NOT benefit_victim(p3). +severity_harm(p3). +goal_achieveable_less_harmful(p3). +foresee_intervention(p3). +high_foreseeability(p3). +NOT external_force(p3). +negligent_mental_state(p3). +necessary_for_harm(p3). + +sufficient_for_harm(p4). +plan_known(p4). +NOT plan_include_harm(p4). +NOT someone_else_cause_harm(p4). +outrank_perpetrator(p4). +NOT necessary_for_harm(p4). +monitor(p4). +NOT intervening_contribution(p4). +NOT harm_caused_as_planned(p4). +NOT goal_achieveable_less_harmful(p4). +external_cause(p4). +NOT control_perpetrator(p4). +NOT benefit_protagonist(p4). +NOT achieve_goal(p4). +careful(p4). +NOT benefit_victim(p4). +severity_harm(p4). +NOT goal_outweigh_harm(p4). +foresee_intervention(p4). +high_foreseeability(p4). +NOT external_force(p4). +negligent_mental_state(p4). +produce_harm(p4). + +NOT produce_harm(p5). +plan_known(p5). +NOT plan_include_harm(p5). +someone_else_cause_harm(p5). +NOT outrank_perpetrator(p5). +necessary_for_harm(p5). +monitor(p5). +harm_caused_as_planned(p5). +goal_outweigh_harm(p5). +foresee_intervention(p5). +NOT external_cause(p5). +control_perpetrator(p5). +NOT benefit_protagonist(p5). +NOT achieve_goal(p5). +careful(p5). +NOT benefit_victim(p5). +severity_harm(p5). +goal_achieveable_less_harmful(p5). +NOT intervening_contribution(p5). +high_foreseeability(p5). +NOT external_force(p5). +negligent_mental_state(p5). +sufficient_for_harm(p5). + +sufficient_for_harm(p6). +plan_known(p6). +NOT plan_include_harm(p6). +NOT someone_else_cause_harm(p6). +NOT outrank_perpetrator(p6). +NOT necessary_for_harm(p6). +NOT monitor(p6). +NOT intervening_contribution(p6). +NOT harm_caused_as_planned(p6). +goal_outweigh_harm(p6). +external_cause(p6). +NOT control_perpetrator(p6). +benefit_protagonist(p6). +NOT achieve_goal(p6). +careful(p6). +NOT benefit_victim(p6). +severity_harm(p6). +goal_achieveable_less_harmful(p6). +foresee_intervention(p6). +low_foreseeability(p6). +NOT external_force(p6). +negligent_mental_state(p6). +produce_harm(p6). + +produce_harm(p7). +plan_known(p7). +plan_include_harm(p7). +someone_else_cause_harm(p7). +NOT outrank_perpetrator(p7). +necessary_for_harm(p7). +monitor(p7). +intervening_contribution(p7). +harm_caused_as_planned(p7). +goal_outweigh_harm(p7). +goal_achieveable_less_harmful(p7). +NOT external_cause(p7). +NOT control_perpetrator(p7). +benefit_protagonist(p7). +NOT careful(p7). +NOT benefit_victim(p7). +severity_harm(p7). +NOT achieve_goal(p7). +foresee_intervention(p7). +low_foreseeability(p7). +NOT external_force(p7). +negligent_mental_state(p7). +sufficient_for_harm(p7). + +NOT sufficient_for_harm(p8). +NOT produce_harm(p8). +NOT plan_known(p8). +NOT plan_include_harm(p8). +NOT someone_else_cause_harm(p8). +outrank_perpetrator(p8). +monitor(p8). +NOT harm_caused_as_planned(p8). +NOT goal_outweigh_harm(p8). +NOT goal_achieveable_less_harmful(p8). +foresee_intervention(p8). +external_cause(p8). +control_perpetrator(p8). +NOT benefit_protagonist(p8). +NOT careful(p8). +NOT benefit_victim(p8). +severity_harm(p8). +NOT achieve_goal(p8). +NOT intervening_contribution(p8). +low_foreseeability(p8). +NOT external_force(p8). +negligent_mental_state(p8). +necessary_for_harm(p8). + +NOT sufficient_for_harm(p9). +produce_harm(p9). +NOT plan_known(p9). +plan_include_harm(p9). +someone_else_cause_harm(p9). +outrank_perpetrator(p9). +NOT monitor(p9). +NOT harm_caused_as_planned(p9). +NOT goal_outweigh_harm(p9). +NOT goal_achieveable_less_harmful(p9). +foresee_intervention(p9). +external_cause(p9). +control_perpetrator(p9). +NOT benefit_protagonist(p9). +NOT careful(p9). +NOT benefit_victim(p9). +severity_harm(p9). +NOT achieve_goal(p9). +NOT intervening_contribution(p9). +low_foreseeability(p9). +NOT external_force(p9). +negligent_mental_state(p9). +necessary_for_harm(p9). + +sufficient_for_harm(p10). +NOT plan_known(p10). +plan_include_harm(p10). +NOT someone_else_cause_harm(p10). +outrank_perpetrator(p10). +necessary_for_harm(p10). +NOT monitor(p10). +NOT intervening_contribution(p10). +harm_caused_as_planned(p10). +NOT goal_achieveable_less_harmful(p10). +NOT external_cause(p10). +NOT control_perpetrator(p10). +benefit_protagonist(p10). +NOT achieve_goal(p10). +careful(p10). +NOT benefit_victim(p10). +severity_harm(p10). +NOT goal_outweigh_harm(p10). +foresee_intervention(p10). +low_foreseeability(p10). +NOT external_force(p10). +negligent_mental_state(p10). +produce_harm(p10). + + +sufficient_for_harm(p11). +NOT plan_known(p11). +plan_include_harm(p11). +someone_else_cause_harm(p11). +outrank_perpetrator(p11). +NOT necessary_for_harm(p11). +monitor(p11). +NOT harm_caused_as_planned(p11). +NOT goal_outweigh_harm(p11). +foresee_intervention(p11). +NOT external_cause(p11). +NOT control_perpetrator(p11). +benefit_protagonist(p11). +NOT achieve_goal(p11). +NOT careful(p11). +NOT benefit_victim(p11). +severity_harm(p11). +goal_achieveable_less_harmful(p11). +NOT intervening_contribution(p11). +low_foreseeability(p11). +NOT external_force(p11). +negligent_mental_state(p11). +produce_harm(p11). + +produce_harm(p12). +plan_known(p12). +NOT plan_include_harm(p12). +someone_else_cause_harm(p12). +NOT outrank_perpetrator(p12). +necessary_for_harm(p12). +NOT monitor(p12). +NOT harm_caused_as_planned(p12). +goal_outweigh_harm(p12). +foresee_intervention(p12). +NOT external_cause(p12). +control_perpetrator(p12). +NOT benefit_protagonist(p12). +achieve_goal(p12). +reckless_mental_state(p12). +NOT benefit_victim(p12). +severity_harm(p12). +goal_achieveable_less_harmful(p12). +NOT intervening_contribution(p12). +NOT external_force(p12). +low_foreseeability(p12). +NOT careful(p12). +sufficient_for_harm(p12). + +NOT sufficient_for_harm(p13). +plan_known(p13). +plan_include_harm(p13). +someone_else_cause_harm(p13). +outrank_perpetrator(p13). +NOT necessary_for_harm(p13). +monitor(p13). +harm_caused_as_planned(p13). +goal_achieveable_less_harmful(p13). +NOT foresee_intervention(p13). +NOT external_cause(p13). +NOT control_perpetrator(p13). +benefit_protagonist(p13). +achieve_goal(p13). +negligent_mental_state(p13). +NOT benefit_victim(p13). +severity_harm(p13). +NOT goal_outweigh_harm(p13). +NOT intervening_contribution(p13). +NOT external_force(p13). +low_foreseeability(p13). +NOT careful(p13). +produce_harm(p13). + +NOT produce_harm(p14). +plan_known(p14). +NOT plan_include_harm(p14). +someone_else_cause_harm(p14). +NOT outrank_perpetrator(p14). +NOT necessary_for_harm(p14). +monitor(p14). +NOT intervening_contribution(p14). +harm_caused_as_planned(p14). +NOT goal_outweigh_harm(p14). +NOT external_cause(p14). +control_perpetrator(p14). +NOT benefit_protagonist(p14). +NOT achieve_goal(p14). +reckless_mental_state(p14). +NOT benefit_victim(p14). +severity_harm(p14). +goal_achieveable_less_harmful(p14). +foresee_intervention(p14). +NOT external_force(p14). +low_foreseeability(p14). +NOT careful(p14). +sufficient_for_harm(p14). + +NOT sufficient_for_harm(p15). +plan_known(p15). +plan_include_harm(p15). +NOT someone_else_cause_harm(p15). +outrank_perpetrator(p15). +NOT necessary_for_harm(p15). +monitor(p15). +intervening_contribution(p15). +harm_caused_as_planned(p15). +NOT goal_achieveable_less_harmful(p15). +external_cause(p15). +control_perpetrator(p15). +benefit_protagonist(p15). +NOT achieve_goal(p15). +negligent_mental_state(p15). +NOT benefit_victim(p15). +severity_harm(p15). +NOT goal_outweigh_harm(p15). +foresee_intervention(p15). +NOT external_force(p15). +low_foreseeability(p15). +NOT careful(p15). +produce_harm(p15). + +sufficient_for_harm(p16). +produce_harm(p16). +NOT plan_known(p16). +NOT plan_include_harm(p16). +someone_else_cause_harm(p16). +NOT outrank_perpetrator(p16). +monitor(p16). +harm_caused_as_planned(p16). +NOT goal_achieveable_less_harmful(p16). +NOT foresee_intervention(p16). +external_cause(p16). +control_perpetrator(p16). +NOT benefit_protagonist(p16). +achieve_goal(p16). +reckless_mental_state(p16). +NOT benefit_victim(p16). +severity_harm(p16). +NOT goal_outweigh_harm(p16). +NOT intervening_contribution(p16). +NOT external_force(p16). +low_foreseeability(p16). +NOT careful(p16). +necessary_for_harm(p16). + +NOT produce_harm(p17). +plan_known(p17). +plan_include_harm(p17). +someone_else_cause_harm(p17). +outrank_perpetrator(p17). +necessary_for_harm(p17). +NOT monitor(p17). +NOT harm_caused_as_planned(p17). +goal_achieveable_less_harmful(p17). +foresee_intervention(p17). +NOT external_cause(p17). +NOT control_perpetrator(p17). +NOT benefit_protagonist(p17). +NOT achieve_goal(p17). +neither_mental_state(p17). +NOT benefit_victim(p17). +severity_harm(p17). +NOT goal_outweigh_harm(p17). +NOT intervening_contribution(p17). +NOT external_force(p17). +low_foreseeability(p17). +NOT careful(p17). +sufficient_for_harm(p17). + +produce_harm(p18). +plan_known(p18). +NOT plan_include_harm(p18). +someone_else_cause_harm(p18). +outrank_perpetrator(p18). +NOT necessary_for_harm(p18). +monitor(p18). +NOT intervening_contribution(p18). +harm_caused_as_planned(p18). +NOT goal_outweigh_harm(p18). +goal_achieveable_less_harmful(p18). +external_cause(p18). +control_perpetrator(p18). +NOT benefit_protagonist(p18). +NOT careful(p18). +NOT benefit_victim(p18). +severity_harm(p18). +NOT achieve_goal(p18). +foresee_intervention(p18). +high_foreseeability(p18). +NOT external_force(p18). +reckless_mental_state(p18). +sufficient_for_harm(p18). + +sufficient_for_harm(p19). +produce_harm(p19). +plan_known(p19). +plan_include_harm(p19). +someone_else_cause_harm(p19). +NOT outrank_perpetrator(p19). +NOT monitor(p19). +NOT harm_caused_as_planned(p19). +goal_achieveable_less_harmful(p19). +NOT foresee_intervention(p19). +NOT external_cause(p19). +NOT control_perpetrator(p19). +NOT benefit_protagonist(p19). +NOT achieve_goal(p19). +careful(p19). +NOT benefit_victim(p19). +severity_harm(p19). +NOT goal_outweigh_harm(p19). +NOT intervening_contribution(p19). +high_foreseeability(p19). +NOT external_force(p19). +reckless_mental_state(p19). +necessary_for_harm(p19). + +sufficient_for_harm(p20). +NOT plan_known(p20). +NOT plan_include_harm(p20). +someone_else_cause_harm(p20). +NOT outrank_perpetrator(p20). +NOT necessary_for_harm(p20). +monitor(p20). +NOT harm_caused_as_planned(p20). +NOT goal_achieveable_less_harmful(p20). +NOT foresee_intervention(p20). +NOT external_cause(p20). +NOT control_perpetrator(p20). +NOT benefit_protagonist(p20). +achieve_goal(p20). +careful(p20). +NOT benefit_victim(p20). +severity_harm(p20). +NOT goal_outweigh_harm(p20). +NOT intervening_contribution(p20). +high_foreseeability(p20). +NOT external_force(p20). +reckless_mental_state(p20). +produce_harm(p20). + +sufficient_for_harm(p21). +plan_known(p21). +plan_include_harm(p21). +someone_else_cause_harm(p21). +outrank_perpetrator(p21). +NOT necessary_for_harm(p21). +monitor(p21). +intervening_contribution(p21). +NOT harm_caused_as_planned(p21). +goal_outweigh_harm(p21). +goal_achieveable_less_harmful(p21). +NOT external_cause(p21). +NOT control_perpetrator(p21). +NOT benefit_protagonist(p21). +NOT careful(p21). +NOT benefit_victim(p21). +severity_harm(p21). +NOT achieve_goal(p21). +foresee_intervention(p21). +high_foreseeability(p21). +NOT external_force(p21). +reckless_mental_state(p21). +produce_harm(p21). + +NOT produce_harm(p22). +plan_known(p22). +plan_include_harm(p22). +someone_else_cause_harm(p22). +NOT outrank_perpetrator(p22). +necessary_for_harm(p22). +NOT monitor(p22). +NOT harm_caused_as_planned(p22). +NOT goal_outweigh_harm(p22). +NOT goal_achieveable_less_harmful(p22). +foresee_intervention(p22). +external_cause(p22). +control_perpetrator(p22). +benefit_protagonist(p22). +NOT careful(p22). +NOT benefit_victim(p22). +severity_harm(p22). +NOT achieve_goal(p22). +NOT intervening_contribution(p22). +high_foreseeability(p22). +NOT external_force(p22). +reckless_mental_state(p22). +sufficient_for_harm(p22). + +sufficient_for_harm(p23). +plan_known(p23). +NOT plan_include_harm(p23). +someone_else_cause_harm(p23). +outrank_perpetrator(p23). +necessary_for_harm(p23). +NOT monitor(p23). +intervening_contribution(p23). +NOT harm_caused_as_planned(p23). +goal_outweigh_harm(p23). +goal_achieveable_less_harmful(p23). +external_cause(p23). +control_perpetrator(p23). +benefit_protagonist(p23). +careful(p23). +NOT benefit_victim(p23). +severity_harm(p23). +NOT achieve_goal(p23). +foresee_intervention(p23). +high_foreseeability(p23). +NOT external_force(p23). +reckless_mental_state(p23). +produce_harm(p23). + +sufficient_for_harm(p24). +produce_harm(p24). +plan_known(p24). +NOT plan_include_harm(p24). +NOT someone_else_cause_harm(p24). +NOT outrank_perpetrator(p24). +monitor(p24). +intervening_contribution(p24). +NOT harm_caused_as_planned(p24). +goal_achieveable_less_harmful(p24). +NOT external_cause(p24). +NOT control_perpetrator(p24). +NOT benefit_protagonist(p24). +NOT achieve_goal(p24). +careful(p24). +NOT benefit_victim(p24). +severity_harm(p24). +NOT goal_outweigh_harm(p24). +foresee_intervention(p24). +low_foreseeability(p24). +NOT external_force(p24). +reckless_mental_state(p24). +necessary_for_harm(p24). + +sufficient_for_harm(p25). +plan_known(p25). +plan_include_harm(p25). +someone_else_cause_harm(p25). +NOT outrank_perpetrator(p25). +necessary_for_harm(p25). +monitor(p25). +harm_caused_as_planned(p25). +goal_outweigh_harm(p25). +NOT foresee_intervention(p25). +NOT external_cause(p25). +control_perpetrator(p25). +NOT benefit_protagonist(p25). +NOT achieve_goal(p25). +NOT careful(p25). +NOT benefit_victim(p25). +severity_harm(p25). +goal_achieveable_less_harmful(p25). +NOT intervening_contribution(p25). +low_foreseeability(p25). +NOT external_force(p25). +reckless_mental_state(p25). +produce_harm(p25). + +NOT sufficient_for_harm(p26). +NOT plan_known(p26). +plan_include_harm(p26). +NOT someone_else_cause_harm(p26). +outrank_perpetrator(p26). +NOT necessary_for_harm(p26). +monitor(p26). +NOT harm_caused_as_planned(p26). +NOT goal_outweigh_harm(p26). +NOT foresee_intervention(p26). +external_cause(p26). +NOT control_perpetrator(p26). +benefit_protagonist(p26). +achieve_goal(p26). +NOT careful(p26). +NOT benefit_victim(p26). +severity_harm(p26). +goal_achieveable_less_harmful(p26). +NOT intervening_contribution(p26). +low_foreseeability(p26). +NOT external_force(p26). +reckless_mental_state(p26). +produce_harm(p26). + +NOT sufficient_for_harm(p27). +NOT produce_harm(p27). +plan_known(p27). +plan_include_harm(p27). +NOT someone_else_cause_harm(p27). +NOT outrank_perpetrator(p27). +monitor(p27). +NOT intervening_contribution(p27). +NOT harm_caused_as_planned(p27). +NOT goal_outweigh_harm(p27). +NOT goal_achieveable_less_harmful(p27). +external_cause(p27). +control_perpetrator(p27). +benefit_protagonist(p27). +careful(p27). +NOT benefit_victim(p27). +severity_harm(p27). +NOT achieve_goal(p27). +foresee_intervention(p27). +low_foreseeability(p27). +NOT external_force(p27). +reckless_mental_state(p27). +necessary_for_harm(p27). + +sufficient_for_harm(p28). +plan_known(p28). +plan_include_harm(p28). +NOT someone_else_cause_harm(p28). +NOT outrank_perpetrator(p28). +NOT necessary_for_harm(p28). +monitor(p28). +harm_caused_as_planned(p28). +goal_outweigh_harm(p28). +foresee_intervention(p28). +NOT external_cause(p28). +control_perpetrator(p28). +benefit_protagonist(p28). +NOT achieve_goal(p28). +careful(p28). +NOT benefit_victim(p28). +severity_harm(p28). +goal_achieveable_less_harmful(p28). +NOT intervening_contribution(p28). +low_foreseeability(p28). +NOT external_force(p28). +reckless_mental_state(p28). +produce_harm(p28). + +sufficient_for_harm(p29). +NOT produce_harm(p29). +NOT plan_known(p29). +plan_include_harm(p29). +someone_else_cause_harm(p29). +outrank_perpetrator(p29). +monitor(p29). +harm_caused_as_planned(p29). +goal_outweigh_harm(p29). +goal_achieveable_less_harmful(p29). +NOT foresee_intervention(p29). +external_cause(p29). +NOT control_perpetrator(p29). +NOT benefit_protagonist(p29). +careful(p29). +NOT benefit_victim(p29). +severity_harm(p29). +NOT achieve_goal(p29). +NOT intervening_contribution(p29). +low_foreseeability(p29). +NOT external_force(p29). +reckless_mental_state(p29). +necessary_for_harm(p29). + +NOT sufficient_for_harm(p30). +NOT produce_harm(p30). +plan_known(p30). +NOT plan_include_harm(p30). +someone_else_cause_harm(p30). +NOT outrank_perpetrator(p30). +monitor(p30). +harm_caused_as_planned(p30). +goal_outweigh_harm(p30). +NOT foresee_intervention(p30). +NOT external_cause(p30). +NOT control_perpetrator(p30). +benefit_protagonist(p30). +achieve_goal(p30). +negligent_mental_state(p30). +NOT benefit_victim(p30). +severity_harm(p30). +goal_achieveable_less_harmful(p30). +NOT intervening_contribution(p30). +NOT external_force(p30). +high_foreseeability(p30). +NOT careful(p30). +necessary_for_harm(p30). + + +produce_harm(p31). +NOT plan_known(p31). +plan_include_harm(p31). +NOT someone_else_cause_harm(p31). +outrank_perpetrator(p31). +necessary_for_harm(p31). +monitor(p31). +intervening_contribution(p31). +NOT harm_caused_as_planned(p31). +NOT goal_achieveable_less_harmful(p31). +external_cause(p31). +control_perpetrator(p31). +NOT benefit_protagonist(p31). +NOT achieve_goal(p31). +neither_mental_state(p31). +NOT benefit_victim(p31). +severity_harm(p31). +NOT goal_outweigh_harm(p31). +foresee_intervention(p31). +NOT external_force(p31). +high_foreseeability(p31). +NOT careful(p31). +sufficient_for_harm(p31). + +sufficient_for_harm(p32). +produce_harm(p32). +NOT plan_known(p32). +plan_include_harm(p32). +someone_else_cause_harm(p32). +outrank_perpetrator(p32). +monitor(p32). +intervening_contribution(p32). +NOT harm_caused_as_planned(p32). +goal_achieveable_less_harmful(p32). +NOT external_cause(p32). +control_perpetrator(p32). +benefit_protagonist(p32). +achieve_goal(p32). +negligent_mental_state(p32). +NOT benefit_victim(p32). +severity_harm(p32). +NOT goal_outweigh_harm(p32). +foresee_intervention(p32). +NOT external_force(p32). +high_foreseeability(p32). +NOT careful(p32). +necessary_for_harm(p32). + +NOT sufficient_for_harm(p33). +plan_known(p33). +plan_include_harm(p33). +someone_else_cause_harm(p33). +NOT outrank_perpetrator(p33). +necessary_for_harm(p33). +NOT monitor(p33). +intervening_contribution(p33). +harm_caused_as_planned(p33). +goal_outweigh_harm(p33). +NOT external_cause(p33). +control_perpetrator(p33). +benefit_protagonist(p33). +NOT achieve_goal(p33). +reckless_mental_state(p33). +NOT benefit_victim(p33). +severity_harm(p33). +goal_achieveable_less_harmful(p33). +foresee_intervention(p33). +NOT external_force(p33). +high_foreseeability(p33). +NOT careful(p33). +produce_harm(p33). + +produce_harm(p34). +NOT plan_known(p34). +plan_include_harm(p34). +NOT someone_else_cause_harm(p34). +outrank_perpetrator(p34). +NOT necessary_for_harm(p34). +NOT monitor(p34). +intervening_contribution(p34). +harm_caused_as_planned(p34). +goal_achieveable_less_harmful(p34). +NOT external_cause(p34). +control_perpetrator(p34). +NOT benefit_protagonist(p34). +NOT achieve_goal(p34). +negligent_mental_state(p34). +NOT benefit_victim(p34). +severity_harm(p34). +NOT goal_outweigh_harm(p34). +foresee_intervention(p34). +NOT external_force(p34). +high_foreseeability(p34). +NOT careful(p34). +sufficient_for_harm(p34). + +NOT sufficient_for_harm(p35). +produce_harm(p35). +plan_known(p35). +plan_include_harm(p35). +someone_else_cause_harm(p35). +NOT outrank_perpetrator(p35). +NOT monitor(p35). +harm_caused_as_planned(p35). +NOT goal_outweigh_harm(p35). +NOT foresee_intervention(p35). +NOT external_cause(p35). +NOT control_perpetrator(p35). +benefit_protagonist(p35). +achieve_goal(p35). +reckless_mental_state(p35). +NOT benefit_victim(p35). +severity_harm(p35). +goal_achieveable_less_harmful(p35). +NOT intervening_contribution(p35). +NOT external_force(p35). +high_foreseeability(p35). +NOT careful(p35). +necessary_for_harm(p35). + +produce_harm(p36). +NOT plan_known(p36). +plan_include_harm(p36). +NOT someone_else_cause_harm(p36). +NOT outrank_perpetrator(p36). +NOT necessary_for_harm(p36). +monitor(p36). +NOT intervening_contribution(p36). +NOT harm_caused_as_planned(p36). +NOT goal_achieveable_less_harmful(p36). +external_cause(p36). +control_perpetrator(p36). +NOT benefit_protagonist(p36). +NOT achieve_goal(p36). +NOT careful(p36). +NOT benefit_victim(p36). +severity_harm(p36). +NOT goal_outweigh_harm(p36). +foresee_intervention(p36). +high_foreseeability(p36). +NOT external_force(p36). +intend_mental_state(p36). +sufficient_for_harm(p36). + +NOT sufficient_for_harm(p37). +NOT plan_known(p37). +NOT plan_include_harm(p37). +someone_else_cause_harm(p37). +NOT outrank_perpetrator(p37). +NOT necessary_for_harm(p37). +NOT monitor(p37). +intervening_contribution(p37). +harm_caused_as_planned(p37). +NOT goal_achieveable_less_harmful(p37). +NOT external_cause(p37). +NOT control_perpetrator(p37). +NOT benefit_protagonist(p37). +achieve_goal(p37). +NOT careful(p37). +NOT benefit_victim(p37). +severity_harm(p37). +NOT goal_outweigh_harm(p37). +foresee_intervention(p37). +high_foreseeability(p37). +NOT external_force(p37). +intend_mental_state(p37). +produce_harm(p37). + +sufficient_for_harm(p38). +plan_known(p38). +NOT plan_include_harm(p38). +NOT someone_else_cause_harm(p38). +NOT outrank_perpetrator(p38). +NOT necessary_for_harm(p38). +monitor(p38). +NOT intervening_contribution(p38). +harm_caused_as_planned(p38). +goal_outweigh_harm(p38). +NOT external_cause(p38). +control_perpetrator(p38). +benefit_protagonist(p38). +achieve_goal(p38). +careful(p38). +NOT benefit_victim(p38). +severity_harm(p38). +goal_achieveable_less_harmful(p38). +foresee_intervention(p38). +high_foreseeability(p38). +NOT external_force(p38). +intend_mental_state(p38). +produce_harm(p38). + +NOT sufficient_for_harm(p39). +NOT plan_known(p39). +NOT plan_include_harm(p39). +someone_else_cause_harm(p39). +NOT outrank_perpetrator(p39). +necessary_for_harm(p39). +NOT monitor(p39). +NOT intervening_contribution(p39). +NOT harm_caused_as_planned(p39). +NOT goal_outweigh_harm(p39). +NOT external_cause(p39). +NOT control_perpetrator(p39). +NOT benefit_protagonist(p39). +achieve_goal(p39). +careful(p39). +NOT benefit_victim(p39). +severity_harm(p39). +goal_achieveable_less_harmful(p39). +foresee_intervention(p39). +high_foreseeability(p39). +NOT external_force(p39). +intend_mental_state(p39). +produce_harm(p39). + +NOT sufficient_for_harm(p40). +plan_known(p40). +plan_include_harm(p40). +NOT someone_else_cause_harm(p40). +NOT outrank_perpetrator(p40). +necessary_for_harm(p40). +NOT monitor(p40). +NOT harm_caused_as_planned(p40). +NOT goal_outweigh_harm(p40). +foresee_intervention(p40). +external_cause(p40). +NOT control_perpetrator(p40). +benefit_protagonist(p40). +NOT achieve_goal(p40). +careful(p40). +NOT benefit_victim(p40). +severity_harm(p40). +goal_achieveable_less_harmful(p40). +NOT intervening_contribution(p40). +high_foreseeability(p40). +NOT external_force(p40). +intend_mental_state(p40). +produce_harm(p40). + +produce_harm(p41). +plan_known(p41). +plan_include_harm(p41). +NOT someone_else_cause_harm(p41). +NOT outrank_perpetrator(p41). +necessary_for_harm(p41). +monitor(p41). +NOT harm_caused_as_planned(p41). +NOT goal_outweigh_harm(p41). +foresee_intervention(p41). +external_cause(p41). +NOT control_perpetrator(p41). +benefit_protagonist(p41). +NOT achieve_goal(p41). +NOT careful(p41). +NOT benefit_victim(p41). +severity_harm(p41). +goal_achieveable_less_harmful(p41). +NOT intervening_contribution(p41). +high_foreseeability(p41). +NOT external_force(p41). +intend_mental_state(p41). +sufficient_for_harm(p41). + +NOT produce_harm(p42). +NOT plan_known(p42). +NOT plan_include_harm(p42). +someone_else_cause_harm(p42). +outrank_perpetrator(p42). +NOT necessary_for_harm(p42). +monitor(p42). +NOT harm_caused_as_planned(p42). +NOT goal_achieveable_less_harmful(p42). +NOT foresee_intervention(p42). +external_cause(p42). +NOT control_perpetrator(p42). +NOT benefit_protagonist(p42). +achieve_goal(p42). +NOT careful(p42). +NOT benefit_victim(p42). +severity_harm(p42). +NOT goal_outweigh_harm(p42). +NOT intervening_contribution(p42). +low_foreseeability(p42). +NOT external_force(p42). +intend_mental_state(p42). +sufficient_for_harm(p42). + +NOT sufficient_for_harm(p43). +produce_harm(p43). +NOT plan_known(p43). +NOT plan_include_harm(p43). +NOT someone_else_cause_harm(p43). +outrank_perpetrator(p43). +NOT monitor(p43). +intervening_contribution(p43). +harm_caused_as_planned(p43). +NOT goal_outweigh_harm(p43). +NOT goal_achieveable_less_harmful(p43). +external_cause(p43). +control_perpetrator(p43). +benefit_protagonist(p43). +careful(p43). +NOT benefit_victim(p43). +severity_harm(p43). +NOT achieve_goal(p43). +foresee_intervention(p43). +low_foreseeability(p43). +NOT external_force(p43). +intend_mental_state(p43). +necessary_for_harm(p43). + +NOT sufficient_for_harm(p44). +produce_harm(p44). +plan_known(p44). +plan_include_harm(p44). +NOT someone_else_cause_harm(p44). +outrank_perpetrator(p44). +NOT monitor(p44). +NOT harm_caused_as_planned(p44). +goal_outweigh_harm(p44). +NOT goal_achieveable_less_harmful(p44). +NOT foresee_intervention(p44). +external_cause(p44). +control_perpetrator(p44). +benefit_protagonist(p44). +NOT careful(p44). +NOT benefit_victim(p44). +severity_harm(p44). +NOT achieve_goal(p44). +NOT intervening_contribution(p44). +low_foreseeability(p44). +NOT external_force(p44). +intend_mental_state(p44). +necessary_for_harm(p44). + +NOT sufficient_for_harm(p45). +NOT plan_known(p45). +NOT plan_include_harm(p45). +someone_else_cause_harm(p45). +NOT outrank_perpetrator(p45). +NOT necessary_for_harm(p45). +NOT monitor(p45). +harm_caused_as_planned(p45). +goal_outweigh_harm(p45). +foresee_intervention(p45). +NOT external_cause(p45). +control_perpetrator(p45). +NOT benefit_protagonist(p45). +achieve_goal(p45). +careful(p45). +NOT benefit_victim(p45). +severity_harm(p45). +goal_achieveable_less_harmful(p45). +NOT intervening_contribution(p45). +low_foreseeability(p45). +NOT external_force(p45). +intend_mental_state(p45). +produce_harm(p45). + +sufficient_for_harm(p46). +NOT plan_known(p46). +NOT plan_include_harm(p46). +someone_else_cause_harm(p46). +NOT outrank_perpetrator(p46). +necessary_for_harm(p46). +NOT monitor(p46). +harm_caused_as_planned(p46). +goal_achieveable_less_harmful(p46). +foresee_intervention(p46). +external_cause(p46). +control_perpetrator(p46). +benefit_protagonist(p46). +achieve_goal(p46). +NOT careful(p46). +NOT benefit_victim(p46). +severity_harm(p46). +NOT goal_outweigh_harm(p46). +NOT intervening_contribution(p46). +low_foreseeability(p46). +NOT external_force(p46). +intend_mental_state(p46). +produce_harm(p46). + +NOT sufficient_for_harm(p47). +produce_harm(p47). +plan_known(p47). +NOT plan_include_harm(p47). +NOT someone_else_cause_harm(p47). +NOT outrank_perpetrator(p47). +monitor(p47). +intervening_contribution(p47). +harm_caused_as_planned(p47). +NOT goal_outweigh_harm(p47). +goal_achieveable_less_harmful(p47). +NOT external_cause(p47). +NOT control_perpetrator(p47). +benefit_protagonist(p47). +careful(p47). +NOT benefit_victim(p47). +severity_harm(p47). +NOT achieve_goal(p47). +foresee_intervention(p47). +low_foreseeability(p47). +NOT external_force(p47). +intend_mental_state(p47). +necessary_for_harm(p47). + +produce_harm(p48). +someone_else_cause_harm(p48). +NOT outrank_perpetrator(p48). +necessary_for_harm(p48). +NOT monitor(p48). +NOT intervening_contribution(p48). +NOT goal_outweigh_harm(p48). +NOT goal_achieveable_less_harmful(p48). +NOT external_cause(p48). +NOT control_perpetrator(p48). +NOT benefit_protagonist(p48). +NOT careful(p48). +neither_mental_state(p48). +NOT benefit_victim(p48). +severity_harm(p48). +NOT achieve_goal(p48). +foresee_intervention(p48). +high_foreseeability(p48). +NOT external_force(p48). +plan_known(p48). +plan_include_harm(p48). +harm_caused_as_planned(p48). +sufficient_for_harm(p48). + +NOT sufficient_for_harm(p49). +NOT someone_else_cause_harm(p49). +outrank_perpetrator(p49). +NOT necessary_for_harm(p49). +monitor(p49). +intervening_contribution(p49). +goal_achieveable_less_harmful(p49). +NOT external_cause(p49). +NOT control_perpetrator(p49). +benefit_protagonist(p49). +NOT achieve_goal(p49). +careful(p49). +reckless_mental_state(p49). +NOT benefit_victim(p49). +severity_harm(p49). +NOT goal_outweigh_harm(p49). +foresee_intervention(p49). +high_foreseeability(p49). +NOT external_force(p49). +plan_known(p49). +plan_include_harm(p49). +harm_caused_as_planned(p49). +produce_harm(p49). + +sufficient_for_harm(p50). +NOT someone_else_cause_harm(p50). +NOT outrank_perpetrator(p50). +necessary_for_harm(p50). +NOT monitor(p50). +NOT intervening_contribution(p50). +goal_outweigh_harm(p50). +external_cause(p50). +NOT control_perpetrator(p50). +NOT benefit_protagonist(p50). +achieve_goal(p50). +NOT careful(p50). +neither_mental_state(p50). +NOT benefit_victim(p50). +severity_harm(p50). +goal_achieveable_less_harmful(p50). +foresee_intervention(p50). +high_foreseeability(p50). +NOT external_force(p50). +plan_known(p50). +plan_include_harm(p50). +harm_caused_as_planned(p50). +produce_harm(p50). + +sufficient_for_harm(p51). +NOT produce_harm(p51). +someone_else_cause_harm(p51). +NOT outrank_perpetrator(p51). +monitor(p51). +NOT goal_achieveable_less_harmful(p51). +foresee_intervention(p51). +external_cause(p51). +NOT control_perpetrator(p51). +NOT benefit_protagonist(p51). +NOT achieve_goal(p51). +careful(p51). +neither_mental_state(p51). +NOT benefit_victim(p51). +severity_harm(p51). +NOT goal_outweigh_harm(p51). +NOT intervening_contribution(p51). +high_foreseeability(p51). +NOT external_force(p51). +plan_known(p51). +plan_include_harm(p51). +harm_caused_as_planned(p51). +necessary_for_harm(p51). + +NOT produce_harm(p52). +NOT someone_else_cause_harm(p52). +outrank_perpetrator(p52). +NOT necessary_for_harm(p52). +NOT monitor(p52). +NOT goal_outweigh_harm(p52). +NOT goal_achieveable_less_harmful(p52). +foresee_intervention(p52). +NOT external_cause(p52). +control_perpetrator(p52). +NOT benefit_protagonist(p52). +NOT careful(p52). +neither_mental_state(p52). +NOT benefit_victim(p52). +severity_harm(p52). +NOT achieve_goal(p52). +NOT intervening_contribution(p52). +high_foreseeability(p52). +NOT external_force(p52). +plan_known(p52). +plan_include_harm(p52). +harm_caused_as_planned(p52). +sufficient_for_harm(p52). + +NOT produce_harm(p53). +NOT someone_else_cause_harm(p53). +outrank_perpetrator(p53). +NOT necessary_for_harm(p53). +monitor(p53). +NOT intervening_contribution(p53). +NOT goal_outweigh_harm(p53). +NOT goal_achieveable_less_harmful(p53). +external_cause(p53). +NOT control_perpetrator(p53). +NOT benefit_protagonist(p53). +NOT careful(p53). +reckless_mental_state(p53). +NOT benefit_victim(p53). +severity_harm(p53). +NOT achieve_goal(p53). +foresee_intervention(p53). +high_foreseeability(p53). +NOT external_force(p53). +plan_known(p53). +plan_include_harm(p53). +harm_caused_as_planned(p53). +sufficient_for_harm(p53). + +NOT produce_harm(p54). +someone_else_cause_harm(p54). +outrank_perpetrator(p54). +necessary_for_harm(p54). +monitor(p54). +goal_outweigh_harm(p54). +goal_achieveable_less_harmful(p54). +NOT foresee_intervention(p54). +external_cause(p54). +control_perpetrator(p54). +NOT benefit_protagonist(p54). +NOT careful(p54). +reckless_mental_state(p54). +NOT benefit_victim(p54). +severity_harm(p54). +NOT achieve_goal(p54). +NOT intervening_contribution(p54). +low_foreseeability(p54). +NOT external_force(p54). +plan_known(p54). +plan_include_harm(p54). +harm_caused_as_planned(p54). +sufficient_for_harm(p54). + +NOT sufficient_for_harm(p55). +someone_else_cause_harm(p55). +outrank_perpetrator(p55). +necessary_for_harm(p55). +monitor(p55). +goal_outweigh_harm(p55). +NOT foresee_intervention(p55). +external_cause(p55). +NOT control_perpetrator(p55). +benefit_protagonist(p55). +achieve_goal(p55). +NOT careful(p55). +reckless_mental_state(p55). +NOT benefit_victim(p55). +severity_harm(p55). +goal_achieveable_less_harmful(p55). +NOT intervening_contribution(p55). +low_foreseeability(p55). +NOT external_force(p55). +plan_known(p55). +plan_include_harm(p55). +harm_caused_as_planned(p55). +produce_harm(p55). + +NOT produce_harm(p56). +NOT someone_else_cause_harm(p56). +outrank_perpetrator(p56). +NOT necessary_for_harm(p56). +NOT monitor(p56). +NOT intervening_contribution(p56). +NOT goal_outweigh_harm(p56). +NOT external_cause(p56). +control_perpetrator(p56). +NOT benefit_protagonist(p56). +achieve_goal(p56). +NOT careful(p56). +negligent_mental_state(p56). +NOT benefit_victim(p56). +severity_harm(p56). +goal_achieveable_less_harmful(p56). +foresee_intervention(p56). +low_foreseeability(p56). +NOT external_force(p56). +plan_known(p56). +plan_include_harm(p56). +harm_caused_as_planned(p56). +sufficient_for_harm(p56). + +sufficient_for_harm(p57). +produce_harm(p57). +NOT someone_else_cause_harm(p57). +outrank_perpetrator(p57). +monitor(p57). +NOT goal_outweigh_harm(p57). +NOT foresee_intervention(p57). +NOT external_cause(p57). +NOT control_perpetrator(p57). +NOT benefit_protagonist(p57). +NOT achieve_goal(p57). +careful(p57). +neither_mental_state(p57). +NOT benefit_victim(p57). +severity_harm(p57). +goal_achieveable_less_harmful(p57). +NOT intervening_contribution(p57). +low_foreseeability(p57). +NOT external_force(p57). +plan_known(p57). +plan_include_harm(p57). +harm_caused_as_planned(p57). +necessary_for_harm(p57). + +sufficient_for_harm(p58). +produce_harm(p58). +someone_else_cause_harm(p58). +outrank_perpetrator(p58). +monitor(p58). +NOT goal_outweigh_harm(p58). +NOT goal_achieveable_less_harmful(p58). +NOT foresee_intervention(p58). +NOT external_cause(p58). +control_perpetrator(p58). +benefit_protagonist(p58). +NOT careful(p58). +neither_mental_state(p58). +NOT benefit_victim(p58). +severity_harm(p58). +NOT achieve_goal(p58). +NOT intervening_contribution(p58). +low_foreseeability(p58). +NOT external_force(p58). +plan_known(p58). +plan_include_harm(p58). +harm_caused_as_planned(p58). +necessary_for_harm(p58). + +NOT sufficient_for_harm(p59). +NOT someone_else_cause_harm(p59). +NOT outrank_perpetrator(p59). +NOT necessary_for_harm(p59). +monitor(p59). +NOT goal_achieveable_less_harmful(p59). +NOT foresee_intervention(p59). +external_cause(p59). +control_perpetrator(p59). +NOT benefit_protagonist(p59). +NOT achieve_goal(p59). +careful(p59). +neither_mental_state(p59). +NOT benefit_victim(p59). +severity_harm(p59). +NOT goal_outweigh_harm(p59). +NOT intervening_contribution(p59). +low_foreseeability(p59). +NOT external_force(p59). +plan_known(p59). +plan_include_harm(p59). +harm_caused_as_planned(p59). +produce_harm(p59). + +NOT sufficient_for_harm(p60). +plan_known(p60). +plan_include_harm(p60). +NOT someone_else_cause_harm(p60). +NOT outrank_perpetrator(p60). +NOT necessary_for_harm(p60). +NOT harm_caused_as_planned(p60). +NOT goal_outweigh_harm(p60). +NOT goal_achieveable_less_harmful(p60). +NOT foresee_intervention(p60). +NOT external_cause(p60). +control_perpetrator(p60). +benefit_protagonist(p60). +NOT careful(p60). +neither_mental_state(p60). +NOT benefit_victim(p60). +severity_harm(p60). +NOT achieve_goal(p60). +NOT intervening_contribution(p60). +high_foreseeability(p60). +NOT external_force(p60). +monitor(p60). +produce_harm(p60). + +sufficient_for_harm(p61). +NOT plan_known(p61). +NOT plan_include_harm(p61). +NOT someone_else_cause_harm(p61). +outrank_perpetrator(p61). +NOT necessary_for_harm(p61). +intervening_contribution(p61). +NOT harm_caused_as_planned(p61). +NOT goal_outweigh_harm(p61). +external_cause(p61). +NOT control_perpetrator(p61). +benefit_protagonist(p61). +achieve_goal(p61). +NOT careful(p61). +reckless_mental_state(p61). +NOT benefit_victim(p61). +severity_harm(p61). +goal_achieveable_less_harmful(p61). +foresee_intervention(p61). +high_foreseeability(p61). +NOT external_force(p61). +monitor(p61). +produce_harm(p61). + +NOT sufficient_for_harm(p62). +NOT produce_harm(p62). +plan_known(p62). +plan_include_harm(p62). +someone_else_cause_harm(p62). +NOT outrank_perpetrator(p62). +NOT intervening_contribution(p62). +NOT harm_caused_as_planned(p62). +goal_outweigh_harm(p62). +goal_achieveable_less_harmful(p62). +NOT external_cause(p62). +control_perpetrator(p62). +benefit_protagonist(p62). +NOT careful(p62). +neither_mental_state(p62). +NOT benefit_victim(p62). +severity_harm(p62). +NOT achieve_goal(p62). +foresee_intervention(p62). +high_foreseeability(p62). +NOT external_force(p62). +monitor(p62). +necessary_for_harm(p62). + +NOT sufficient_for_harm(p63). +produce_harm(p63). +plan_known(p63). +plan_include_harm(p63). +NOT someone_else_cause_harm(p63). +outrank_perpetrator(p63). +NOT intervening_contribution(p63). +harm_caused_as_planned(p63). +goal_outweigh_harm(p63). +NOT goal_achieveable_less_harmful(p63). +external_cause(p63). +control_perpetrator(p63). +benefit_protagonist(p63). +careful(p63). +reckless_mental_state(p63). +NOT benefit_victim(p63). +severity_harm(p63). +NOT achieve_goal(p63). +foresee_intervention(p63). +high_foreseeability(p63). +NOT external_force(p63). +monitor(p63). +necessary_for_harm(p63). + +sufficient_for_harm(p64). +NOT produce_harm(p64). +plan_known(p64). +NOT plan_include_harm(p64). +NOT someone_else_cause_harm(p64). +NOT outrank_perpetrator(p64). +NOT intervening_contribution(p64). +harm_caused_as_planned(p64). +goal_outweigh_harm(p64). +NOT external_cause(p64). +control_perpetrator(p64). +NOT benefit_protagonist(p64). +NOT achieve_goal(p64). +NOT careful(p64). +reckless_mental_state(p64). +NOT benefit_victim(p64). +severity_harm(p64). +goal_achieveable_less_harmful(p64). +foresee_intervention(p64). +high_foreseeability(p64). +NOT external_force(p64). +monitor(p64). +necessary_for_harm(p64). + +NOT sufficient_for_harm(p65). +NOT plan_known(p65). +NOT plan_include_harm(p65). +NOT someone_else_cause_harm(p65). +NOT outrank_perpetrator(p65). +NOT necessary_for_harm(p65). +NOT harm_caused_as_planned(p65). +goal_outweigh_harm(p65). +NOT goal_achieveable_less_harmful(p65). +NOT foresee_intervention(p65). +NOT external_cause(p65). +control_perpetrator(p65). +NOT benefit_protagonist(p65). +careful(p65). +negligent_mental_state(p65). +NOT benefit_victim(p65). +severity_harm(p65). +NOT achieve_goal(p65). +NOT intervening_contribution(p65). +high_foreseeability(p65). +NOT external_force(p65). +monitor(p65). +produce_harm(p65). + +sufficient_for_harm(p66). +produce_harm(p66). +NOT plan_known(p66). +plan_include_harm(p66). +NOT someone_else_cause_harm(p66). +NOT outrank_perpetrator(p66). +harm_caused_as_planned(p66). +NOT goal_outweigh_harm(p66). +NOT foresee_intervention(p66). +external_cause(p66). +NOT control_perpetrator(p66). +benefit_protagonist(p66). +achieve_goal(p66). +NOT careful(p66). +negligent_mental_state(p66). +NOT benefit_victim(p66). +severity_harm(p66). +goal_achieveable_less_harmful(p66). +NOT intervening_contribution(p66). +low_foreseeability(p66). +NOT external_force(p66). +monitor(p66). +necessary_for_harm(p66). + +NOT sufficient_for_harm(p67). +NOT plan_known(p67). +NOT plan_include_harm(p67). +someone_else_cause_harm(p67). +outrank_perpetrator(p67). +NOT necessary_for_harm(p67). +intervening_contribution(p67). +NOT harm_caused_as_planned(p67). +NOT goal_achieveable_less_harmful(p67). +external_cause(p67). +NOT control_perpetrator(p67). +benefit_protagonist(p67). +achieve_goal(p67). +NOT careful(p67). +reckless_mental_state(p67). +NOT benefit_victim(p67). +severity_harm(p67). +NOT goal_outweigh_harm(p67). +foresee_intervention(p67). +low_foreseeability(p67). +NOT external_force(p67). +monitor(p67). +produce_harm(p67). + +sufficient_for_harm(p68). +plan_known(p68). +NOT plan_include_harm(p68). +someone_else_cause_harm(p68). +NOT outrank_perpetrator(p68). +necessary_for_harm(p68). +intervening_contribution(p68). +NOT harm_caused_as_planned(p68). +NOT goal_outweigh_harm(p68). +goal_achieveable_less_harmful(p68). +NOT external_cause(p68). +NOT control_perpetrator(p68). +NOT benefit_protagonist(p68). +NOT careful(p68). +negligent_mental_state(p68). +NOT benefit_victim(p68). +severity_harm(p68). +NOT achieve_goal(p68). +foresee_intervention(p68). +low_foreseeability(p68). +NOT external_force(p68). +monitor(p68). +produce_harm(p68). + +sufficient_for_harm(p69). +plan_known(p69). +plan_include_harm(p69). +NOT someone_else_cause_harm(p69). +NOT outrank_perpetrator(p69). +necessary_for_harm(p69). +NOT intervening_contribution(p69). +NOT harm_caused_as_planned(p69). +goal_outweigh_harm(p69). +NOT goal_achieveable_less_harmful(p69). +NOT external_cause(p69). +control_perpetrator(p69). +NOT benefit_protagonist(p69). +careful(p69). +neither_mental_state(p69). +NOT benefit_victim(p69). +severity_harm(p69). +NOT achieve_goal(p69). +foresee_intervention(p69). +low_foreseeability(p69). +NOT external_force(p69). +monitor(p69). +produce_harm(p69). + +sufficient_for_harm(p70). +NOT produce_harm(p70). +NOT plan_known(p70). +plan_include_harm(p70). +someone_else_cause_harm(p70). +NOT outrank_perpetrator(p70). +intervening_contribution(p70). +harm_caused_as_planned(p70). +goal_outweigh_harm(p70). +NOT external_cause(p70). +control_perpetrator(p70). +NOT benefit_protagonist(p70). +NOT achieve_goal(p70). +NOT careful(p70). +negligent_mental_state(p70). +NOT benefit_victim(p70). +severity_harm(p70). +goal_achieveable_less_harmful(p70). +foresee_intervention(p70). +low_foreseeability(p70). +NOT external_force(p70). +monitor(p70). +necessary_for_harm(p70). + +produce_harm(p71). +NOT plan_known(p71). +NOT plan_include_harm(p71). +someone_else_cause_harm(p71). +outrank_perpetrator(p71). +NOT necessary_for_harm(p71). +intervening_contribution(p71). +NOT harm_caused_as_planned(p71). +goal_outweigh_harm(p71). +external_cause(p71). +control_perpetrator(p71). +benefit_protagonist(p71). +NOT achieve_goal(p71). +careful(p71). +neither_mental_state(p71). +NOT benefit_victim(p71). +severity_harm(p71). +goal_achieveable_less_harmful(p71). +foresee_intervention(p71). +low_foreseeability(p71). +NOT external_force(p71). +monitor(p71). +sufficient_for_harm(p71). + +sufficient_for_harm(p72). +NOT plan_known(p72). +NOT plan_include_harm(p72). +NOT someone_else_cause_harm(p72). +NOT outrank_perpetrator(p72). +NOT necessary_for_harm(p72). +monitor(p72). +NOT intervening_contribution(p72). +harm_caused_as_planned(p72). +NOT goal_outweigh_harm(p72). +goal_achieveable_less_harmful(p72). +external_cause(p72). +NOT control_perpetrator(p72). +NOT careful(p72). +reckless_mental_state(p72). +NOT benefit_victim(p72). +severity_harm(p72). +NOT achieve_goal(p72). +foresee_intervention(p72). +high_foreseeability(p72). +NOT external_force(p72). +benefit_protagonist(p72). +produce_harm(p72). + +produce_harm(p73). +plan_known(p73). +plan_include_harm(p73). +someone_else_cause_harm(p73). +outrank_perpetrator(p73). +NOT necessary_for_harm(p73). +monitor(p73). +NOT harm_caused_as_planned(p73). +NOT goal_achieveable_less_harmful(p73). +foresee_intervention(p73). +NOT external_cause(p73). +control_perpetrator(p73). +achieve_goal(p73). +careful(p73). +neither_mental_state(p73). +NOT benefit_victim(p73). +severity_harm(p73). +NOT goal_outweigh_harm(p73). +NOT intervening_contribution(p73). +high_foreseeability(p73). +NOT external_force(p73). +benefit_protagonist(p73). +sufficient_for_harm(p73). + +sufficient_for_harm(p74). +NOT plan_known(p74). +plan_include_harm(p74). +someone_else_cause_harm(p74). +NOT outrank_perpetrator(p74). +NOT necessary_for_harm(p74). +monitor(p74). +NOT harm_caused_as_planned(p74). +NOT goal_achieveable_less_harmful(p74). +foresee_intervention(p74). +NOT external_cause(p74). +NOT control_perpetrator(p74). +NOT achieve_goal(p74). +NOT careful(p74). +negligent_mental_state(p74). +NOT benefit_victim(p74). +severity_harm(p74). +NOT goal_outweigh_harm(p74). +NOT intervening_contribution(p74). +high_foreseeability(p74). +NOT external_force(p74). +benefit_protagonist(p74). +produce_harm(p74). + +NOT sufficient_for_harm(p75). +NOT produce_harm(p75). +NOT plan_known(p75). +plan_include_harm(p75). +NOT someone_else_cause_harm(p75). +outrank_perpetrator(p75). +monitor(p75). +harm_caused_as_planned(p75). +NOT goal_outweigh_harm(p75). +goal_achieveable_less_harmful(p75). +NOT foresee_intervention(p75). +external_cause(p75). +control_perpetrator(p75). +NOT careful(p75). +reckless_mental_state(p75). +NOT benefit_victim(p75). +severity_harm(p75). +NOT achieve_goal(p75). +NOT intervening_contribution(p75). +high_foreseeability(p75). +NOT external_force(p75). +benefit_protagonist(p75). +necessary_for_harm(p75). + +sufficient_for_harm(p76). +NOT produce_harm(p76). +plan_known(p76). +NOT plan_include_harm(p76). +someone_else_cause_harm(p76). +outrank_perpetrator(p76). +monitor(p76). +harm_caused_as_planned(p76). +NOT goal_achieveable_less_harmful(p76). +NOT foresee_intervention(p76). +external_cause(p76). +control_perpetrator(p76). +achieve_goal(p76). +NOT careful(p76). +negligent_mental_state(p76). +NOT benefit_victim(p76). +severity_harm(p76). +NOT goal_outweigh_harm(p76). +NOT intervening_contribution(p76). +high_foreseeability(p76). +NOT external_force(p76). +benefit_protagonist(p76). +necessary_for_harm(p76). + +produce_harm(p77). +NOT plan_known(p77). +NOT plan_include_harm(p77). +NOT someone_else_cause_harm(p77). +NOT outrank_perpetrator(p77). +NOT necessary_for_harm(p77). +NOT monitor(p77). +NOT intervening_contribution(p77). +NOT harm_caused_as_planned(p77). +goal_outweigh_harm(p77). +goal_achieveable_less_harmful(p77). +NOT external_cause(p77). +control_perpetrator(p77). +NOT careful(p77). +reckless_mental_state(p77). +NOT benefit_victim(p77). +severity_harm(p77). +NOT achieve_goal(p77). +foresee_intervention(p77). +high_foreseeability(p77). +NOT external_force(p77). +benefit_protagonist(p77). +sufficient_for_harm(p77). + +produce_harm(p78). +NOT plan_known(p78). +plan_include_harm(p78). +NOT someone_else_cause_harm(p78). +outrank_perpetrator(p78). +NOT necessary_for_harm(p78). +monitor(p78). +NOT intervening_contribution(p78). +harm_caused_as_planned(p78). +goal_achieveable_less_harmful(p78). +NOT external_cause(p78). +control_perpetrator(p78). +achieve_goal(p78). +NOT careful(p78). +reckless_mental_state(p78). +NOT benefit_victim(p78). +severity_harm(p78). +NOT goal_outweigh_harm(p78). +foresee_intervention(p78). +low_foreseeability(p78). +NOT external_force(p78). +benefit_protagonist(p78). +sufficient_for_harm(p78). + +produce_harm(p79). +NOT plan_known(p79). +plan_include_harm(p79). +NOT someone_else_cause_harm(p79). +NOT outrank_perpetrator(p79). +necessary_for_harm(p79). +monitor(p79). +NOT harm_caused_as_planned(p79). +NOT goal_outweigh_harm(p79). +NOT foresee_intervention(p79). +NOT external_cause(p79). +NOT control_perpetrator(p79). +NOT achieve_goal(p79). +NOT careful(p79). +neither_mental_state(p79). +NOT benefit_victim(p79). +severity_harm(p79). +goal_achieveable_less_harmful(p79). +NOT intervening_contribution(p79). +low_foreseeability(p79). +NOT external_force(p79). +benefit_protagonist(p79). +sufficient_for_harm(p79). + +sufficient_for_harm(p80). +NOT plan_known(p80). +NOT plan_include_harm(p80). +someone_else_cause_harm(p80). +NOT outrank_perpetrator(p80). +necessary_for_harm(p80). +monitor(p80). +NOT intervening_contribution(p80). +harm_caused_as_planned(p80). +goal_outweigh_harm(p80). +NOT external_cause(p80). +control_perpetrator(p80). +NOT achieve_goal(p80). +careful(p80). +neither_mental_state(p80). +NOT benefit_victim(p80). +severity_harm(p80). +goal_achieveable_less_harmful(p80). +foresee_intervention(p80). +low_foreseeability(p80). +NOT external_force(p80). +benefit_protagonist(p80). +produce_harm(p80). + +NOT sufficient_for_harm(p81). +plan_known(p81). +NOT plan_include_harm(p81). +NOT someone_else_cause_harm(p81). +outrank_perpetrator(p81). +NOT necessary_for_harm(p81). +NOT monitor(p81). +NOT intervening_contribution(p81). +harm_caused_as_planned(p81). +NOT goal_outweigh_harm(p81). +NOT goal_achieveable_less_harmful(p81). +NOT external_cause(p81). +NOT control_perpetrator(p81). +NOT careful(p81). +reckless_mental_state(p81). +NOT benefit_victim(p81). +severity_harm(p81). +NOT achieve_goal(p81). +foresee_intervention(p81). +low_foreseeability(p81). +NOT external_force(p81). +benefit_protagonist(p81). +produce_harm(p81). + +NOT sufficient_for_harm(p82). +plan_known(p82). +NOT plan_include_harm(p82). +someone_else_cause_harm(p82). +outrank_perpetrator(p82). +NOT necessary_for_harm(p82). +NOT monitor(p82). +intervening_contribution(p82). +harm_caused_as_planned(p82). +NOT goal_achieveable_less_harmful(p82). +external_cause(p82). +NOT control_perpetrator(p82). +NOT achieve_goal(p82). +NOT careful(p82). +negligent_mental_state(p82). +NOT benefit_victim(p82). +severity_harm(p82). +NOT goal_outweigh_harm(p82). +foresee_intervention(p82). +low_foreseeability(p82). +NOT external_force(p82). +benefit_protagonist(p82). +produce_harm(p82). + +sufficient_for_harm(p83). +NOT plan_known(p83). +NOT plan_include_harm(p83). +NOT someone_else_cause_harm(p83). +NOT outrank_perpetrator(p83). +necessary_for_harm(p83). +NOT monitor(p83). +NOT harm_caused_as_planned(p83). +goal_achieveable_less_harmful(p83). +NOT foresee_intervention(p83). +NOT external_cause(p83). +control_perpetrator(p83). +achieve_goal(p83). +NOT careful(p83). +neither_mental_state(p83). +NOT benefit_victim(p83). +severity_harm(p83). +NOT goal_outweigh_harm(p83). +NOT intervening_contribution(p83). +low_foreseeability(p83). +NOT external_force(p83). +benefit_protagonist(p83). +produce_harm(p83). + +NOT sufficient_for_harm(p84). +NOT produce_harm(p84). +NOT plan_known(p84). +NOT plan_include_harm(p84). +someone_else_cause_harm(p84). +outrank_perpetrator(p84). +NOT monitor(p84). +NOT intervening_contribution(p84). +harm_caused_as_planned(p84). +NOT goal_achieveable_less_harmful(p84). +NOT control_perpetrator(p84). +NOT benefit_protagonist(p84). +achieve_goal(p84). +NOT careful(p84). +negligent_mental_state(p84). +NOT benefit_victim(p84). +severity_harm(p84). +NOT goal_outweigh_harm(p84). +foresee_intervention(p84). +high_foreseeability(p84). +NOT external_force(p84). +NOT external_cause(p84). +necessary_for_harm(p84). + +sufficient_for_harm(p85). +plan_known(p85). +NOT plan_include_harm(p85). +someone_else_cause_harm(p85). +NOT outrank_perpetrator(p85). +NOT necessary_for_harm(p85). +monitor(p85). +NOT intervening_contribution(p85). +harm_caused_as_planned(p85). +NOT goal_outweigh_harm(p85). +goal_achieveable_less_harmful(p85). +control_perpetrator(p85). +benefit_protagonist(p85). +NOT careful(p85). +reckless_mental_state(p85). +NOT benefit_victim(p85). +severity_harm(p85). +NOT achieve_goal(p85). +foresee_intervention(p85). +high_foreseeability(p85). +NOT external_force(p85). +NOT external_cause(p85). +produce_harm(p85). + +NOT produce_harm(p86). +plan_known(p86). +NOT plan_include_harm(p86). +NOT someone_else_cause_harm(p86). +outrank_perpetrator(p86). +NOT necessary_for_harm(p86). +monitor(p86). +harm_caused_as_planned(p86). +NOT goal_achieveable_less_harmful(p86). +foresee_intervention(p86). +NOT control_perpetrator(p86). +benefit_protagonist(p86). +NOT achieve_goal(p86). +careful(p86). +neither_mental_state(p86). +NOT benefit_victim(p86). +severity_harm(p86). +NOT goal_outweigh_harm(p86). +NOT intervening_contribution(p86). +high_foreseeability(p86). +NOT external_force(p86). +NOT external_cause(p86). +sufficient_for_harm(p86). + +sufficient_for_harm(p87). +produce_harm(p87). +NOT plan_known(p87). +plan_include_harm(p87). +NOT someone_else_cause_harm(p87). +outrank_perpetrator(p87). +NOT monitor(p87). +NOT harm_caused_as_planned(p87). +goal_outweigh_harm(p87). +goal_achieveable_less_harmful(p87). +NOT foresee_intervention(p87). +NOT control_perpetrator(p87). +benefit_protagonist(p87). +careful(p87). +reckless_mental_state(p87). +NOT benefit_victim(p87). +severity_harm(p87). +NOT achieve_goal(p87). +NOT intervening_contribution(p87). +high_foreseeability(p87). +NOT external_force(p87). +NOT external_cause(p87). +necessary_for_harm(p87). + +produce_harm(p88). +NOT plan_known(p88). +NOT plan_include_harm(p88). +NOT someone_else_cause_harm(p88). +outrank_perpetrator(p88). +necessary_for_harm(p88). +NOT monitor(p88). +NOT intervening_contribution(p88). +harm_caused_as_planned(p88). +goal_outweigh_harm(p88). +control_perpetrator(p88). +benefit_protagonist(p88). +NOT achieve_goal(p88). +careful(p88). +neither_mental_state(p88). +NOT benefit_victim(p88). +severity_harm(p88). +goal_achieveable_less_harmful(p88). +foresee_intervention(p88). +high_foreseeability(p88). +NOT external_force(p88). +NOT external_cause(p88). +sufficient_for_harm(p88). + +sufficient_for_harm(p89). +produce_harm(p89). +plan_known(p89). +NOT plan_include_harm(p89). +someone_else_cause_harm(p89). +outrank_perpetrator(p89). +NOT monitor(p89). +harm_caused_as_planned(p89). +NOT goal_outweigh_harm(p89). +goal_achieveable_less_harmful(p89). +foresee_intervention(p89). +NOT control_perpetrator(p89). +benefit_protagonist(p89). +careful(p89). +neither_mental_state(... [truncated message content] |
From: <sk...@us...> - 2008-02-13 10:36:32
|
Revision: 555 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=555&view=rev Author: sknappe Date: 2008-02-13 02:36:25 -0800 (Wed, 13 Feb 2008) Log Message: ----------- minor display changes Modified Paths: -------------- trunk/src/dbpedia-navigator/index.php Modified: trunk/src/dbpedia-navigator/index.php =================================================================== --- trunk/src/dbpedia-navigator/index.php 2008-02-13 10:26:52 UTC (rev 554) +++ trunk/src/dbpedia-navigator/index.php 2008-02-13 10:36:25 UTC (rev 555) @@ -39,6 +39,8 @@ }; hideLoading = function() { xajax.$('Loading').style.display = 'none'; + xajax.$('SearchResultBox').style.display = 'block'; + xajax.$('LastArticlesBox').style.display = 'block'; }; </script> </head> @@ -65,7 +67,7 @@ </div> <!-- boxcontent --> </div> <!-- box --> - <div class="box"> + <div class="box" id="SearchResultBox" style="display:none"> <div class="boxtitle">Search Results</div> <div class="boxcontent"> <div id="searchcontent" style="display:block"></div> @@ -116,7 +118,7 @@ </div> <!-- boxcontent --> </div> <!-- box --> - <div class="box"> + <div class="box" id="LastArticlesBox" style="display:none"> <div class="boxtitle">Articles Last Viewed</div> <div class="boxcontent" id="lastarticles"> </div> <!-- boxcontent --> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 10:27:05
|
Revision: 554 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=554&view=rev Author: kurzum Date: 2008-02-13 02:26:52 -0800 (Wed, 13 Feb 2008) Log Message: ----------- changed filenames moral Added Paths: ----------- trunk/examples/moral_reasoner/moral_43examples_simple_owl.conf trunk/examples/moral_reasoner/moral_all_examples_simple_owl.conf Removed Paths: ------------- trunk/examples/moral_reasoner/moral_43examples_simple owl.conf trunk/examples/moral_reasoner/moral_all_examples_owl.conf Deleted: trunk/examples/moral_reasoner/moral_43examples_simple owl.conf =================================================================== --- trunk/examples/moral_reasoner/moral_43examples_simple owl.conf 2008-02-13 10:24:51 UTC (rev 553) +++ trunk/examples/moral_reasoner/moral_43examples_simple owl.conf 2008-02-13 10:26:52 UTC (rev 554) @@ -1,246 +0,0 @@ - /*********************** - solution should be: - guilty = (blameworthy OR vicarious_blame ). - - - Examples: - 23 positive - 20 negative - - ***********************/ - - /** settings **/ - // reasoner settings - reasoner = dig; - digReasonerURL = "http://localhost:8081"; - useRetrievalForClassification = true; - refinement.useDIGMultiInstanceChecks = twoChecks; - - // algorithm settings - algorithm = refinement; - refinement.horizontalExpansionFactor = 0.6; - refinement.quiet = false; - refinement.useTooWeakList = true; - - // search tree protocol - refinement.writeSearchTree = false; - refinement.searchTreeFile = "searchTree.txt"; - - writeDIGProtocol = true; - digProtocolFile = "dig.log"; - - // control output - showIndividuals = false; - showConcepts = true; - showRoles = true; - showInternalKB = false; -showSubsumptionHierarchy = true; -import("43_simple.nt","NT"); -//hidePrefix("http://localhost/foo#"); - -/** background knowledge **/ - - - -+guilty(p0). -+guilty(p1). -+guilty(p2). -+guilty(p3). -+guilty(p4). -+guilty(p5). -+guilty(p6). -+guilty(p7). -+guilty(p8). -+guilty(p9). -+guilty(p10). -/*+guilty(p11). -+guilty(p12). -+guilty(p13). -+guilty(p14). -+guilty(p15). -+guilty(p16). -+guilty(p17). -+guilty(p18). -+guilty(p19). -+guilty(p20). -/*+guilty(p21). -+guilty(p22). -+guilty(p23). -+guilty(p24). -+guilty(p25). -+guilty(p26). -+guilty(p27). -+guilty(p28). -+guilty(p29). -/*+guilty(p30). -+guilty(p31). -+guilty(p32). -+guilty(p33). -+guilty(p34). -+guilty(p35). -+guilty(p36). -+guilty(p37). -+guilty(p38). -+guilty(p39). -+guilty(p40). -+guilty(p41). -+guilty(p42). -+guilty(p43). -+guilty(p44). -+guilty(p45). -+guilty(p46). -+guilty(p47). -+guilty(p48). -+guilty(p49). -+guilty(p50). -+guilty(p51). -+guilty(p52). -+guilty(p53). -+guilty(p54). -+guilty(p55). -+guilty(p56). -+guilty(p57). -+guilty(p58). -+guilty(p59). -+guilty(p60). -+guilty(p61). -+guilty(p62). -+guilty(p63). -+guilty(p64). -+guilty(p65). -+guilty(p66). -+guilty(p67). -+guilty(p68). -+guilty(p69). -+guilty(p70). -+guilty(p71). -+guilty(p72). -+guilty(p73). -+guilty(p74). -+guilty(p75). -+guilty(p76). -+guilty(p77). -+guilty(p78). -+guilty(p79). -+guilty(p80). -+guilty(p81). -+guilty(p82). -+guilty(p83). -+guilty(p84). -+guilty(p85). -+guilty(p86). -+guilty(p87). -+guilty(p88). -+guilty(p89).*/ -+guilty(p90). -+guilty(p91). -+guilty(p92). -+guilty(p93). -+guilty(p94). -+guilty(p95). -+guilty(p96). -+guilty(p97). -+guilty(p98). -+guilty(p99). -+guilty(p100). -+guilty(p101). --guilty(n0). --guilty(n1). --guilty(n2). --guilty(n3). -//-guilty(n4). --guilty(n5). --guilty(n6). --guilty(n7). --guilty(n8). --guilty(n9). --guilty(n10). -/*-guilty(n11). --guilty(n12). --guilty(n13). --guilty(n14). --guilty(n15). --guilty(n16). --guilty(n17). --guilty(n18). --guilty(n19). -/*-guilty(n20). --guilty(n21). --guilty(n22). --guilty(n23). --guilty(n24). --guilty(n25). --guilty(n26). --guilty(n27). --guilty(n28). --guilty(n29). -/*-guilty(n30). --guilty(n31). --guilty(n32). --guilty(n33). --guilty(n34). --guilty(n35). --guilty(n36). --guilty(n37). --guilty(n38). --guilty(n39). --guilty(n40). --guilty(n41). --guilty(n42). --guilty(n43). --guilty(n44). --guilty(n45). --guilty(n46). --guilty(n47). --guilty(n48). --guilty(n49). --guilty(n50). --guilty(n51). --guilty(n52). --guilty(n53). --guilty(n54). --guilty(n55). --guilty(n56). --guilty(n57). --guilty(n58). --guilty(n59). --guilty(n60). --guilty(n61). --guilty(n62). --guilty(n63). --guilty(n64). --guilty(n65). --guilty(n66). --guilty(n67). --guilty(n68). --guilty(n69). --guilty(n70). --guilty(n71). --guilty(n72). --guilty(n73). --guilty(n74). --guilty(n75). --guilty(n76). --guilty(n77). --guilty(n78). --guilty(n79). --guilty(n80). --guilty(n81). --guilty(n82). --guilty(n83). --guilty(n84). --guilty(n85). --guilty(n86). --guilty(n87). --guilty(n88). --guilty(n89). 10*/ --guilty(n90). --guilty(n91). --guilty(n92). --guilty(n93). --guilty(n94). --guilty(n95). --guilty(n96). --guilty(n97). --guilty(n98). --guilty(n99). Copied: trunk/examples/moral_reasoner/moral_43examples_simple_owl.conf (from rev 551, trunk/examples/moral_reasoner/moral_43examples_simple owl.conf) =================================================================== --- trunk/examples/moral_reasoner/moral_43examples_simple_owl.conf (rev 0) +++ trunk/examples/moral_reasoner/moral_43examples_simple_owl.conf 2008-02-13 10:26:52 UTC (rev 554) @@ -0,0 +1,246 @@ + /*********************** + solution should be: + guilty = (blameworthy OR vicarious_blame ). + + + Examples: + 23 positive + 20 negative + + ***********************/ + + /** settings **/ + // reasoner settings + reasoner = dig; + digReasonerURL = "http://localhost:8081"; + useRetrievalForClassification = true; + refinement.useDIGMultiInstanceChecks = twoChecks; + + // algorithm settings + algorithm = refinement; + refinement.horizontalExpansionFactor = 0.6; + refinement.quiet = false; + refinement.useTooWeakList = true; + + // search tree protocol + refinement.writeSearchTree = false; + refinement.searchTreeFile = "searchTree.txt"; + + writeDIGProtocol = true; + digProtocolFile = "dig.log"; + + // control output + showIndividuals = false; + showConcepts = true; + showRoles = true; + showInternalKB = false; +showSubsumptionHierarchy = true; +import("43_simple.nt","NT"); +//hidePrefix("http://localhost/foo#"); + +/** background knowledge **/ + + + ++guilty(p0). ++guilty(p1). ++guilty(p2). ++guilty(p3). ++guilty(p4). ++guilty(p5). ++guilty(p6). ++guilty(p7). ++guilty(p8). ++guilty(p9). ++guilty(p10). +/*+guilty(p11). ++guilty(p12). ++guilty(p13). ++guilty(p14). ++guilty(p15). ++guilty(p16). ++guilty(p17). ++guilty(p18). ++guilty(p19). ++guilty(p20). +/*+guilty(p21). ++guilty(p22). ++guilty(p23). ++guilty(p24). ++guilty(p25). ++guilty(p26). ++guilty(p27). ++guilty(p28). ++guilty(p29). +/*+guilty(p30). ++guilty(p31). ++guilty(p32). ++guilty(p33). ++guilty(p34). ++guilty(p35). ++guilty(p36). ++guilty(p37). ++guilty(p38). ++guilty(p39). ++guilty(p40). ++guilty(p41). ++guilty(p42). ++guilty(p43). ++guilty(p44). ++guilty(p45). ++guilty(p46). ++guilty(p47). ++guilty(p48). ++guilty(p49). ++guilty(p50). ++guilty(p51). ++guilty(p52). ++guilty(p53). ++guilty(p54). ++guilty(p55). ++guilty(p56). ++guilty(p57). ++guilty(p58). ++guilty(p59). ++guilty(p60). ++guilty(p61). ++guilty(p62). ++guilty(p63). ++guilty(p64). ++guilty(p65). ++guilty(p66). ++guilty(p67). ++guilty(p68). ++guilty(p69). ++guilty(p70). ++guilty(p71). ++guilty(p72). ++guilty(p73). ++guilty(p74). ++guilty(p75). ++guilty(p76). ++guilty(p77). ++guilty(p78). ++guilty(p79). ++guilty(p80). ++guilty(p81). ++guilty(p82). ++guilty(p83). ++guilty(p84). ++guilty(p85). ++guilty(p86). ++guilty(p87). ++guilty(p88). ++guilty(p89).*/ ++guilty(p90). ++guilty(p91). ++guilty(p92). ++guilty(p93). ++guilty(p94). ++guilty(p95). ++guilty(p96). ++guilty(p97). ++guilty(p98). ++guilty(p99). ++guilty(p100). ++guilty(p101). +-guilty(n0). +-guilty(n1). +-guilty(n2). +-guilty(n3). +//-guilty(n4). +-guilty(n5). +-guilty(n6). +-guilty(n7). +-guilty(n8). +-guilty(n9). +-guilty(n10). +/*-guilty(n11). +-guilty(n12). +-guilty(n13). +-guilty(n14). +-guilty(n15). +-guilty(n16). +-guilty(n17). +-guilty(n18). +-guilty(n19). +/*-guilty(n20). +-guilty(n21). +-guilty(n22). +-guilty(n23). +-guilty(n24). +-guilty(n25). +-guilty(n26). +-guilty(n27). +-guilty(n28). +-guilty(n29). +/*-guilty(n30). +-guilty(n31). +-guilty(n32). +-guilty(n33). +-guilty(n34). +-guilty(n35). +-guilty(n36). +-guilty(n37). +-guilty(n38). +-guilty(n39). +-guilty(n40). +-guilty(n41). +-guilty(n42). +-guilty(n43). +-guilty(n44). +-guilty(n45). +-guilty(n46). +-guilty(n47). +-guilty(n48). +-guilty(n49). +-guilty(n50). +-guilty(n51). +-guilty(n52). +-guilty(n53). +-guilty(n54). +-guilty(n55). +-guilty(n56). +-guilty(n57). +-guilty(n58). +-guilty(n59). +-guilty(n60). +-guilty(n61). +-guilty(n62). +-guilty(n63). +-guilty(n64). +-guilty(n65). +-guilty(n66). +-guilty(n67). +-guilty(n68). +-guilty(n69). +-guilty(n70). +-guilty(n71). +-guilty(n72). +-guilty(n73). +-guilty(n74). +-guilty(n75). +-guilty(n76). +-guilty(n77). +-guilty(n78). +-guilty(n79). +-guilty(n80). +-guilty(n81). +-guilty(n82). +-guilty(n83). +-guilty(n84). +-guilty(n85). +-guilty(n86). +-guilty(n87). +-guilty(n88). +-guilty(n89). 10*/ +-guilty(n90). +-guilty(n91). +-guilty(n92). +-guilty(n93). +-guilty(n94). +-guilty(n95). +-guilty(n96). +-guilty(n97). +-guilty(n98). +-guilty(n99). Deleted: trunk/examples/moral_reasoner/moral_all_examples_owl.conf =================================================================== --- trunk/examples/moral_reasoner/moral_all_examples_owl.conf 2008-02-13 10:24:51 UTC (rev 553) +++ trunk/examples/moral_reasoner/moral_all_examples_owl.conf 2008-02-13 10:26:52 UTC (rev 554) @@ -1,246 +0,0 @@ - /*********************** - solution should be: - guilty = (blameworthy OR vicarious_blame ). - - - Examples: - 102 positive - 100 negative - - ***********************/ - - /** settings **/ - // reasoner settings - reasoner = dig; - digReasonerURL = "http://localhost:8081"; - useRetrievalForClassification = true; - refinement.useDIGMultiInstanceChecks = twoChecks; - - // algorithm settings - algorithm = refinement; - refinement.horizontalExpansionFactor = 0.6; - refinement.quiet = false; - refinement.useTooWeakList = true; - - // search tree protocol - refinement.writeSearchTree = false; - refinement.searchTreeFile = "searchTree.txt"; - - - - // control output - showIndividuals = false; - showConcepts = true; - showRoles = true; - showInternalKB = false; -showSubsumptionHierarchy = true; -import("moral.owl"); -//hidePrefix("http://localhost/foo#"); - -/** background knowledge **/ - -refinement.ignoredConcepts = {"http://localhost/foo#guilty"}; - - -+guilty(p0). -+guilty(p1). -+guilty(p2). -+guilty(p3). -+guilty(p4). -+guilty(p5). -+guilty(p6). -+guilty(p7). -+guilty(p8). -+guilty(p9). -+guilty(p10). -+guilty(p11). -+guilty(p12). -+guilty(p13). -+guilty(p14). -+guilty(p15). -+guilty(p16). -+guilty(p17). -+guilty(p18). -+guilty(p19). -+guilty(p20). -+guilty(p21). -+guilty(p22). -+guilty(p23). -+guilty(p24). -+guilty(p25). -+guilty(p26). -+guilty(p27). -+guilty(p28). -+guilty(p29). -+guilty(p30). -+guilty(p31). -+guilty(p32). -+guilty(p33). -+guilty(p34). -+guilty(p35). -+guilty(p36). -+guilty(p37). -+guilty(p38). -+guilty(p39). -+guilty(p40). -+guilty(p41). -+guilty(p42). -+guilty(p43). -+guilty(p44). -+guilty(p45). -+guilty(p46). -+guilty(p47). -+guilty(p48). -+guilty(p49). -+guilty(p50). -+guilty(p51). -+guilty(p52). -+guilty(p53). -+guilty(p54). -+guilty(p55). -+guilty(p56). -+guilty(p57). -+guilty(p58). -+guilty(p59). -+guilty(p60). -+guilty(p61). -+guilty(p62). -+guilty(p63). -+guilty(p64). -+guilty(p65). -+guilty(p66). -+guilty(p67). -+guilty(p68). -+guilty(p69). -+guilty(p70). -+guilty(p71). -+guilty(p72). -+guilty(p73). -+guilty(p74). -+guilty(p75). -+guilty(p76). -+guilty(p77). -+guilty(p78). -+guilty(p79). -+guilty(p80). -+guilty(p81). -+guilty(p82). -+guilty(p83). -+guilty(p84). -+guilty(p85). -+guilty(p86). -+guilty(p87). -+guilty(p88). -+guilty(p89). -+guilty(p90). -+guilty(p91). -+guilty(p92). -+guilty(p93). -+guilty(p94). -+guilty(p95). -+guilty(p96). -+guilty(p97). -+guilty(p98). -+guilty(p99). -+guilty(p100). -+guilty(p101). --guilty(n0). --guilty(n1). --guilty(n2). --guilty(n3). --guilty(n4). --guilty(n5). --guilty(n6). --guilty(n7). --guilty(n8). --guilty(n9). --guilty(n10). --guilty(n11). --guilty(n12). --guilty(n13). --guilty(n14). --guilty(n15). --guilty(n16). --guilty(n17). --guilty(n18). --guilty(n19). --guilty(n20). --guilty(n21). --guilty(n22). --guilty(n23). --guilty(n24). --guilty(n25). --guilty(n26). --guilty(n27). --guilty(n28). --guilty(n29). --guilty(n30). --guilty(n31). --guilty(n32). --guilty(n33). --guilty(n34). --guilty(n35). --guilty(n36). --guilty(n37). --guilty(n38). --guilty(n39). --guilty(n40). --guilty(n41). --guilty(n42). --guilty(n43). --guilty(n44). --guilty(n45). --guilty(n46). --guilty(n47). --guilty(n48). --guilty(n49). --guilty(n50). --guilty(n51). --guilty(n52). --guilty(n53). --guilty(n54). --guilty(n55). --guilty(n56). --guilty(n57). --guilty(n58). --guilty(n59). --guilty(n60). --guilty(n61). --guilty(n62). --guilty(n63). --guilty(n64). --guilty(n65). --guilty(n66). --guilty(n67). --guilty(n68). --guilty(n69). --guilty(n70). --guilty(n71). --guilty(n72). --guilty(n73). --guilty(n74). --guilty(n75). --guilty(n76). --guilty(n77). --guilty(n78). --guilty(n79). --guilty(n80). --guilty(n81). --guilty(n82). --guilty(n83). --guilty(n84). --guilty(n85). --guilty(n86). --guilty(n87). --guilty(n88). --guilty(n89). --guilty(n90). --guilty(n91). --guilty(n92). --guilty(n93). --guilty(n94). --guilty(n95). --guilty(n96). --guilty(n97). --guilty(n98). --guilty(n99). Copied: trunk/examples/moral_reasoner/moral_all_examples_simple_owl.conf (from rev 551, trunk/examples/moral_reasoner/moral_all_examples_owl.conf) =================================================================== --- trunk/examples/moral_reasoner/moral_all_examples_simple_owl.conf (rev 0) +++ trunk/examples/moral_reasoner/moral_all_examples_simple_owl.conf 2008-02-13 10:26:52 UTC (rev 554) @@ -0,0 +1,246 @@ + /*********************** + solution should be: + guilty = (blameworthy OR vicarious_blame ). + + + Examples: + 102 positive + 100 negative + + ***********************/ + + /** settings **/ + // reasoner settings + reasoner = dig; + digReasonerURL = "http://localhost:8081"; + useRetrievalForClassification = true; + refinement.useDIGMultiInstanceChecks = twoChecks; + + // algorithm settings + algorithm = refinement; + refinement.horizontalExpansionFactor = 0.6; + refinement.quiet = false; + refinement.useTooWeakList = true; + + // search tree protocol + refinement.writeSearchTree = false; + refinement.searchTreeFile = "searchTree.txt"; + + + + // control output + showIndividuals = false; + showConcepts = true; + showRoles = true; + showInternalKB = false; +showSubsumptionHierarchy = true; +import("moral.owl"); +//hidePrefix("http://localhost/foo#"); + +/** background knowledge **/ + +refinement.ignoredConcepts = {"http://localhost/foo#guilty"}; + + ++guilty(p0). ++guilty(p1). ++guilty(p2). ++guilty(p3). ++guilty(p4). ++guilty(p5). ++guilty(p6). ++guilty(p7). ++guilty(p8). ++guilty(p9). ++guilty(p10). ++guilty(p11). ++guilty(p12). ++guilty(p13). ++guilty(p14). ++guilty(p15). ++guilty(p16). ++guilty(p17). ++guilty(p18). ++guilty(p19). ++guilty(p20). ++guilty(p21). ++guilty(p22). ++guilty(p23). ++guilty(p24). ++guilty(p25). ++guilty(p26). ++guilty(p27). ++guilty(p28). ++guilty(p29). ++guilty(p30). ++guilty(p31). ++guilty(p32). ++guilty(p33). ++guilty(p34). ++guilty(p35). ++guilty(p36). ++guilty(p37). ++guilty(p38). ++guilty(p39). ++guilty(p40). ++guilty(p41). ++guilty(p42). ++guilty(p43). ++guilty(p44). ++guilty(p45). ++guilty(p46). ++guilty(p47). ++guilty(p48). ++guilty(p49). ++guilty(p50). ++guilty(p51). ++guilty(p52). ++guilty(p53). ++guilty(p54). ++guilty(p55). ++guilty(p56). ++guilty(p57). ++guilty(p58). ++guilty(p59). ++guilty(p60). ++guilty(p61). ++guilty(p62). ++guilty(p63). ++guilty(p64). ++guilty(p65). ++guilty(p66). ++guilty(p67). ++guilty(p68). ++guilty(p69). ++guilty(p70). ++guilty(p71). ++guilty(p72). ++guilty(p73). ++guilty(p74). ++guilty(p75). ++guilty(p76). ++guilty(p77). ++guilty(p78). ++guilty(p79). ++guilty(p80). ++guilty(p81). ++guilty(p82). ++guilty(p83). ++guilty(p84). ++guilty(p85). ++guilty(p86). ++guilty(p87). ++guilty(p88). ++guilty(p89). ++guilty(p90). ++guilty(p91). ++guilty(p92). ++guilty(p93). ++guilty(p94). ++guilty(p95). ++guilty(p96). ++guilty(p97). ++guilty(p98). ++guilty(p99). ++guilty(p100). ++guilty(p101). +-guilty(n0). +-guilty(n1). +-guilty(n2). +-guilty(n3). +-guilty(n4). +-guilty(n5). +-guilty(n6). +-guilty(n7). +-guilty(n8). +-guilty(n9). +-guilty(n10). +-guilty(n11). +-guilty(n12). +-guilty(n13). +-guilty(n14). +-guilty(n15). +-guilty(n16). +-guilty(n17). +-guilty(n18). +-guilty(n19). +-guilty(n20). +-guilty(n21). +-guilty(n22). +-guilty(n23). +-guilty(n24). +-guilty(n25). +-guilty(n26). +-guilty(n27). +-guilty(n28). +-guilty(n29). +-guilty(n30). +-guilty(n31). +-guilty(n32). +-guilty(n33). +-guilty(n34). +-guilty(n35). +-guilty(n36). +-guilty(n37). +-guilty(n38). +-guilty(n39). +-guilty(n40). +-guilty(n41). +-guilty(n42). +-guilty(n43). +-guilty(n44). +-guilty(n45). +-guilty(n46). +-guilty(n47). +-guilty(n48). +-guilty(n49). +-guilty(n50). +-guilty(n51). +-guilty(n52). +-guilty(n53). +-guilty(n54). +-guilty(n55). +-guilty(n56). +-guilty(n57). +-guilty(n58). +-guilty(n59). +-guilty(n60). +-guilty(n61). +-guilty(n62). +-guilty(n63). +-guilty(n64). +-guilty(n65). +-guilty(n66). +-guilty(n67). +-guilty(n68). +-guilty(n69). +-guilty(n70). +-guilty(n71). +-guilty(n72). +-guilty(n73). +-guilty(n74). +-guilty(n75). +-guilty(n76). +-guilty(n77). +-guilty(n78). +-guilty(n79). +-guilty(n80). +-guilty(n81). +-guilty(n82). +-guilty(n83). +-guilty(n84). +-guilty(n85). +-guilty(n86). +-guilty(n87). +-guilty(n88). +-guilty(n89). +-guilty(n90). +-guilty(n91). +-guilty(n92). +-guilty(n93). +-guilty(n94). +-guilty(n95). +-guilty(n96). +-guilty(n97). +-guilty(n98). +-guilty(n99). This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <ku...@us...> - 2008-02-13 10:25:01
|
Revision: 553 http://dl-learner.svn.sourceforge.net/dl-learner/?rev=553&view=rev Author: kurzum Date: 2008-02-13 02:24:51 -0800 (Wed, 13 Feb 2008) Log Message: ----------- forte Added Paths: ----------- trunk/examples/forte/forte_family.kb trunk/examples/forte/forte_family.owl trunk/examples/forte/uncle_large.conf trunk/examples/forte/uncle_owl_large.conf trunk/examples/forte/uncle_owl_small.conf trunk/examples/forte/uncle_small.conf Removed Paths: ------------- trunk/examples/forte/forte.owl trunk/examples/forte/forte_uncle.conf trunk/examples/forte/forte_uncle_owl.conf Deleted: trunk/examples/forte/forte.owl =================================================================== --- trunk/examples/forte/forte.owl 2008-02-13 10:09:50 UTC (rev 552) +++ trunk/examples/forte/forte.owl 2008-02-13 10:24:51 UTC (rev 553) @@ -1,547 +0,0 @@ -<?xml version="1.0" encoding="ISO-8859-1"?> -<!DOCTYPE rdf:RDF [ - <!ENTITY owl 'http://www.w3.org/2002/07/owl#'> -]> - -<rdf:RDF - xml:base="http://localhost/foo" - xmlns:a="http://localhost/foo#" - xmlns:owl="http://www.w3.org/2002/07/owl#" - xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" - xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"> - -<owl:Ontology rdf:about=""/> - -<owl:Class rdf:about="&owl;Nothing"> - <owl:equivalentClass> - <owl:Class> - <owl:intersectionOf rdf:parseType="Collection"> - <owl:Class rdf:about="#male"/> - <owl:Class rdf:about="#female"/> - </owl:intersectionOf> - </owl:Class> - </owl:equivalentClass> -</owl:Class> - -<owl:ObjectProperty rdf:ID="married"> - <rdf:type rdf:resource="&owl;SymmetricProperty"/> - <rdf:type rdf:resource="&owl;FunctionalProperty"/> -</owl:ObjectProperty> - -<owl:ObjectProperty rdf:ID="sibling"> - <rdf:type rdf:resource="&owl;SymmetricProperty"/> -</owl:ObjectProperty> - -<a:male rdf:ID="alfred"> - <a:parent rdf:resource="#david"/> - <a:parent rdf:resource="#elisa"/> -</a:male> - -<a:female rdf:ID="alice"> - <a:married rdf:resource="#art"/> - <a:parent rdf:resource="#f14"/> - <a:parent rdf:resource="#m13"/> - <a:parent rdf:resource="#m15"/> -</a:female> - -<a:female rdf:ID="angela"> - <a:sibling rdf:resource="#ray"/> -</a:female> - -<a:female rdf:ID="ann"> - <a:married rdf:resource="#alfred"/> - <a:parent rdf:resource="#david"/> - <a:parent rdf:resource="#elisa"/> -</a:female> - -<a:male rdf:ID="art"> - <a:parent rdf:resource="#f14"/> - <a:parent rdf:resource="#m13"/> - <a:parent rdf:resource="#m15"/> - <a:sibling rdf:resource="#umo"/> - <a:sibling rdf:resource="#wendy"/> -</a:male> - -<a:female rdf:ID="beatrice"> - <a:married rdf:resource="#bob"/> - <a:parent rdf:resource="#eric"/> - <a:parent rdf:resource="#fannie"/> - <a:parent rdf:resource="#gail"/> - <a:parent rdf:resource="#harry"/> -</a:female> - -<a:male rdf:ID="bob"> - <a:parent rdf:resource="#eric"/> - <a:parent rdf:resource="#fannie"/> - <a:parent rdf:resource="#gail"/> - <a:parent rdf:resource="#harry"/> -</a:male> - -<a:female rdf:ID="callie"> - <a:married rdf:resource="#carl"/> - <a:parent rdf:resource="#karl"/> - <a:parent rdf:resource="#lorrie"/> - <a:parent rdf:resource="#mark"/> -</a:female> - -<a:male rdf:ID="calvin"> - <a:sibling rdf:resource="#christy"/> - <a:sibling rdf:resource="#jack"/> -</a:male> - -<a:male rdf:ID="carl"> - <a:parent rdf:resource="#karl"/> - <a:parent rdf:resource="#lorrie"/> - <a:parent rdf:resource="#mark"/> -</a:male> - -<a:male rdf:ID="carlos"> - <a:parent rdf:resource="#f26"/> - <a:parent rdf:resource="#f28"/> - <a:parent rdf:resource="#m27"/> -</a:male> - -<a:female rdf:ID="christy"> - <a:married rdf:resource="#carlos"/> - <a:parent rdf:resource="#f26"/> - <a:parent rdf:resource="#f28"/> - <a:parent rdf:resource="#m27"/> - <a:sibling rdf:resource="#calvin"/> - <a:sibling rdf:resource="#jack"/> -</a:female> - -<a:female rdf:ID="cornelia"> - <a:sibling rdf:resource="#melvin"/> - <a:sibling rdf:resource="#nancy"/> -</a:female> - -<a:male rdf:ID="david"> - <a:parent rdf:resource="#jonas"/> - <a:parent rdf:resource="#terry"/> - <a:sibling rdf:resource="#elisa"/> -</a:male> - -<a:female rdf:ID="deanna"> - <a:married rdf:resource="#david"/> - <a:parent rdf:resource="#jonas"/> - <a:parent rdf:resource="#terry"/> -</a:female> - -<a:female rdf:ID="elisa"> - <a:married rdf:resource="#eric"/> - <a:parent rdf:resource="#art"/> - <a:parent rdf:resource="#umo"/> - <a:parent rdf:resource="#wendy"/> - <a:sibling rdf:resource="#david"/> -</a:female> - -<a:male rdf:ID="eric"> - <a:parent rdf:resource="#art"/> - <a:parent rdf:resource="#umo"/> - <a:parent rdf:resource="#wendy"/> - <a:sibling rdf:resource="#fannie"/> - <a:sibling rdf:resource="#gail"/> - <a:sibling rdf:resource="#harry"/> -</a:male> - -<a:female rdf:ID="f12"> - <a:sibling rdf:resource="#m11"/> -</a:female> - -<a:female rdf:ID="f14"> - <a:sibling rdf:resource="#m13"/> - <a:sibling rdf:resource="#m15"/> -</a:female> - -<a:female rdf:ID="f19"> - <a:sibling rdf:resource="#f20"/> - <a:sibling rdf:resource="#m18"/> -</a:female> - -<a:female rdf:ID="f2"> - <a:sibling rdf:resource="#m1"/> -</a:female> - -<a:female rdf:ID="f20"> - <a:sibling rdf:resource="#f19"/> - <a:sibling rdf:resource="#m18"/> -</a:female> - -<a:female rdf:ID="f21"> - <a:sibling rdf:resource="#f22"/> -</a:female> - -<a:female rdf:ID="f22"> - <a:sibling rdf:resource="#f21"/> -</a:female> - -<a:female rdf:ID="f23"> - <a:sibling rdf:resource="#f25"/> - <a:sibling rdf:resource="#m24"/> -</a:female> - -<a:female rdf:ID="f25"> - <a:sibling rdf:resource="#f23"/> - <a:sibling rdf:resource="#m24"/> -</a:female> - -<a:female rdf:ID="f26"> - <a:sibling rdf:resource="#f28"/> - <a:sibling rdf:resource="#m27"/> -</a:female> - -<a:female rdf:ID="f28"> - <a:sibling rdf:resource="#f26"/> - <a:sibling rdf:resource="#m27"/> -</a:female> - -<a:female rdf:ID="f8"> - <a:sibling rdf:resource="#m10"/> - <a:sibling rdf:resource="#m9"/> -</a:female> - -<a:female rdf:ID="fannie"> - <a:married rdf:resource="#fred"/> - <a:parent rdf:resource="#cornelia"/> - <a:parent rdf:resource="#melvin"/> - <a:parent rdf:resource="#nancy"/> - <a:sibling rdf:resource="#eric"/> - <a:sibling rdf:resource="#gail"/> - <a:sibling rdf:resource="#harry"/> -</a:female> - -<a:male rdf:ID="fred"> - <a:parent rdf:resource="#cornelia"/> - <a:parent rdf:resource="#melvin"/> - <a:parent rdf:resource="#nancy"/> -</a:male> - -<a:male rdf:ID="frederick"> - <a:sibling rdf:resource="#jane"/> - <a:sibling rdf:resource="#prissie"/> -</a:male> - -<a:female rdf:ID="gail"> - <a:married rdf:resource="#george"/> - <a:sibling rdf:resource="#eric"/> - <a:sibling rdf:resource="#fannie"/> - <a:sibling rdf:resource="#harry"/> -</a:female> - -<a:male rdf:ID="george"/> - -<a:male rdf:ID="harry"> - <a:parent rdf:resource="#frederick"/> - <a:parent rdf:resource="#jane"/> - <a:parent rdf:resource="#prissie"/> - <a:sibling rdf:resource="#eric"/> - <a:sibling rdf:resource="#fannie"/> - <a:sibling rdf:resource="#gail"/> -</a:male> - -<a:female rdf:ID="helen"> - <a:married rdf:resource="#harry"/> - <a:parent rdf:resource="#frederick"/> - <a:parent rdf:resource="#jane"/> - <a:parent rdf:resource="#prissie"/> -</a:female> - -<a:male rdf:ID="jack"> - <a:parent rdf:resource="#f23"/> - <a:parent rdf:resource="#f25"/> - <a:parent rdf:resource="#m24"/> - <a:sibling rdf:resource="#calvin"/> - <a:sibling rdf:resource="#christy"/> -</a:male> - -<a:male rdf:ID="james"> - <a:parent rdf:resource="#calvin"/> - <a:parent rdf:resource="#christy"/> - <a:parent rdf:resource="#jack"/> -</a:male> - -<a:female rdf:ID="jane"> - <a:married rdf:resource="#jack"/> - <a:parent rdf:resource="#f23"/> - <a:parent rdf:resource="#f25"/> - <a:parent rdf:resource="#m24"/> - <a:sibling rdf:resource="#frederick"/> - <a:sibling rdf:resource="#prissie"/> -</a:female> - -<a:female rdf:ID="janet"> - <a:married rdf:resource="#james"/> - <a:parent rdf:resource="#calvin"/> - <a:parent rdf:resource="#christy"/> - <a:parent rdf:resource="#jack"/> - <a:sibling rdf:resource="#nero"/> -</a:female> - -<a:male rdf:ID="jonas"> - <a:sibling rdf:resource="#terry"/> -</a:male> - -<a:female rdf:ID="kari"> - <a:married rdf:resource="#karl"/> - <a:parent rdf:resource="#janet"/> - <a:parent rdf:resource="#nero"/> -</a:female> - -<a:male rdf:ID="karl"> - <a:parent rdf:resource="#janet"/> - <a:parent rdf:resource="#nero"/> - <a:sibling rdf:resource="#lorrie"/> - <a:sibling rdf:resource="#mark"/> -</a:male> - -<a:male rdf:ID="leon"> - <a:parent rdf:resource="#oma"/> - <a:parent rdf:resource="#paul"/> - <a:parent rdf:resource="#rachel"/> -</a:male> - -<a:female rdf:ID="lorrie"> - <a:married rdf:resource="#leon"/> - <a:parent rdf:resource="#oma"/> - <a:parent rdf:resource="#paul"/> - <a:parent rdf:resource="#rachel"/> - <a:sibling rdf:resource="#karl"/> - <a:sibling rdf:resource="#mark"/> -</a:female> - -<a:male rdf:ID="m1"> - <a:sibling rdf:resource="#f2"/> -</a:male> - -<a:male rdf:ID="m10"> - <a:sibling rdf:resource="#f8"/> - <a:sibling rdf:resource="#m9"/> -</a:male> - -<a:male rdf:ID="m11"> - <a:sibling rdf:resource="#f12"/> -</a:male> - -<a:male rdf:ID="m13"> - <a:sibling rdf:resource="#f14"/> - <a:sibling rdf:resource="#m15"/> -</a:male> - -<a:male rdf:ID="m15"> - <a:sibling rdf:resource="#f14"/> - <a:sibling rdf:resource="#m13"/> -</a:male> - -<a:male rdf:ID="m16"> - <a:sibling rdf:resource="#m17"/> -</a:male> - -<a:male rdf:ID="m17"> - <a:sibling rdf:resource="#m16"/> -</a:male> - -<a:male rdf:ID="m18"> - <a:sibling rdf:resource="#f19"/> - <a:sibling rdf:resource="#f20"/> -</a:male> - -<a:male rdf:ID="m24"> - <a:sibling rdf:resource="#f23"/> - <a:sibling rdf:resource="#f25"/> -</a:male> - -<a:male rdf:ID="m27"> - <a:sibling rdf:resource="#f26"/> - <a:sibling rdf:resource="#f28"/> -</a:male> - -<a:male rdf:ID="m29"/> - -<a:male rdf:ID="m3"/> - -<a:male rdf:ID="m4"> - <a:sibling rdf:resource="#m5"/> - <a:sibling rdf:resource="#m6"/> - <a:sibling rdf:resource="#m7"/> -</a:male> - -<a:male rdf:ID="m5"> - <a:sibling rdf:resource="#m4"/> - <a:sibling rdf:resource="#m6"/> - <a:sibling rdf:resource="#m7"/> -</a:male> - -<a:male rdf:ID="m6"> - <a:sibling rdf:resource="#m4"/> - <a:sibling rdf:resource="#m5"/> - <a:sibling rdf:resource="#m7"/> -</a:male> - -<a:male rdf:ID="m7"> - <a:sibling rdf:resource="#m4"/> - <a:sibling rdf:resource="#m5"/> - <a:sibling rdf:resource="#m6"/> -</a:male> - -<a:male rdf:ID="m9"> - <a:sibling rdf:resource="#f8"/> - <a:sibling rdf:resource="#m10"/> -</a:male> - -<a:female rdf:ID="maria"> - <a:married rdf:resource="#melvin"/> - <a:parent rdf:resource="#m16"/> - <a:parent rdf:resource="#m17"/> -</a:female> - -<a:male rdf:ID="mark"> - <a:parent rdf:resource="#susan"/> - <a:sibling rdf:resource="#karl"/> - <a:sibling rdf:resource="#lorrie"/> -</a:male> - -<a:female rdf:ID="martha"> - <a:married rdf:resource="#mark"/> - <a:parent rdf:resource="#susan"/> -</a:female> - -<a:male rdf:ID="melvin"> - <a:parent rdf:resource="#m16"/> - <a:parent rdf:resource="#m17"/> - <a:sibling rdf:resource="#cornelia"/> - <a:sibling rdf:resource="#nancy"/> -</a:male> - -<a:female rdf:ID="nancy"> - <a:married rdf:resource="#neil"/> - <a:parent rdf:resource="#f19"/> - <a:parent rdf:resource="#f20"/> - <a:parent rdf:resource="#m18"/> - <a:sibling rdf:resource="#cornelia"/> - <a:sibling rdf:resource="#melvin"/> -</a:female> - -<a:male rdf:ID="neil"> - <a:parent rdf:resource="#f19"/> - <a:parent rdf:resource="#f20"/> - <a:parent rdf:resource="#m18"/> -</a:male> - -<a:male rdf:ID="nero"> - <a:parent rdf:resource="#angela"/> - <a:parent rdf:resource="#ray"/> - <a:sibling rdf:resource="#janet"/> -</a:male> - -<a:female rdf:ID="nonnie"> - <a:married rdf:resource="#nero"/> - <a:parent rdf:resource="#angela"/> - <a:parent rdf:resource="#ray"/> -</a:female> - -<a:female rdf:ID="oma"> - <a:married rdf:resource="#owen"/> - <a:parent rdf:resource="#f2"/> - <a:parent rdf:resource="#m1"/> - <a:sibling rdf:resource="#paul"/> - <a:sibling rdf:resource="#rachel"/> -</a:female> - -<a:male rdf:ID="owen"> - <a:parent rdf:resource="#f2"/> - <a:parent rdf:resource="#m1"/> -</a:male> - -<a:male rdf:ID="paul"> - <a:parent rdf:resource="#m3"/> - <a:sibling rdf:resource="#oma"/> - <a:sibling rdf:resource="#rachel"/> -</a:male> - -<a:female rdf:ID="paula"> - <a:married rdf:resource="#paul"/> - <a:parent rdf:resource="#m3"/> -</a:female> - -<a:male rdf:ID="peter"> - <a:parent rdf:resource="#f21"/> - <a:parent rdf:resource="#f22"/> -</a:male> - -<a:female rdf:ID="prissie"> - <a:married rdf:resource="#peter"/> - <a:parent rdf:resource="#f21"/> - <a:parent rdf:resource="#f22"/> - <a:sibling rdf:resource="#frederick"/> - <a:sibling rdf:resource="#jane"/> -</a:female> - -<a:female rdf:ID="rachel"> - <a:sibling rdf:resource="#oma"/> - <a:sibling rdf:resource="#paul"/> -</a:female> - -<a:male rdf:ID="ray"> - <a:parent rdf:resource="#m29"/> - <a:sibling rdf:resource="#angela"/> -</a:male> - -<a:female rdf:ID="regina"> - <a:married rdf:resource="#ray"/> - <a:parent rdf:resource="#m29"/> -</a:female> - -<a:male rdf:ID="steve"> - <a:parent rdf:resource="#m4"/> - <a:parent rdf:resource="#m5"/> - <a:parent rdf:resource="#m6"/> - <a:parent rdf:resource="#m7"/> -</a:male> - -<a:female rdf:ID="susan"> - <a:married rdf:resource="#steve"/> - <a:parent rdf:resource="#m4"/> - <a:parent rdf:resource="#m5"/> - <a:parent rdf:resource="#m6"/> - <a:parent rdf:resource="#m7"/> -</a:female> - -<a:female rdf:ID="terri"> - <a:married rdf:resource="#terry"/> - <a:parent rdf:resource="#f8"/> - <a:parent rdf:resource="#m10"/> - <a:parent rdf:resource="#m9"/> -</a:female> - -<a:male rdf:ID="terry"> - <a:parent rdf:resource="#f8"/> - <a:parent rdf:resource="#m10"/> - <a:parent rdf:resource="#m9"/> - <a:sibling rdf:resource="#jonas"/> -</a:male> - -<a:male rdf:ID="umo"> - <a:sibling rdf:resource="#art"/> - <a:sibling rdf:resource="#wendy"/> -</a:male> - -<a:male rdf:ID="walt"> - <a:parent rdf:resource="#f12"/> - <a:parent rdf:resource="#m11"/> -</a:male> - -<a:female rdf:ID="wendy"> - <a:married rdf:resource="#walt"/> - <a:parent rdf:resource="#f12"/> - <a:parent rdf:resource="#m11"/> - <a:sibling rdf:resource="#art"/> - <a:sibling rdf:resource="#umo"/> -</a:female> - -<owl:Class rdf:ID="female"/> - -<owl:Class rdf:ID="male"/> - -<owl:ObjectProperty rdf:ID="parent"/> - -</rdf:RDF> Added: trunk/examples/forte/forte_family.kb =================================================================== --- trunk/examples/forte/forte_family.kb (rev 0) +++ trunk/examples/forte/forte_family.kb 2008-02-13 10:24:51 UTC (rev 553) @@ -0,0 +1,378 @@ +/** + * Extracted from the FORTE (First Order Revision of Theories from Examples) + * data set: + * + * http://www.cs.utexas.edu/users/ml/forte.html + * + * The goal of this learning problem is to learn the concept of an uncle. + * + * At the bottom of this file, you can find a graphical representation of the + * family tree corresponding to the facts in this file. + * + * possible solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP + * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP)) + * + * Copyright (C) 2007, Jens Lehmann + */ + + +/** background knowledge **/ +BOTTOM = (male AND female). + +Symmetric(sibling). +Symmetric(married). +Functional(married). + +male(alfred). +female(alice). +female(angela). +female(ann). +male(art). +female(beatrice). +male(bob). +female(callie). +male(calvin). +male(carl). +male(carlos). +female(christy). +female(cornelia). +male(david). +female(deanna). +female(elisa). +male(eric). +female(f12). +female(f14). +female(f19). +female(f2). +female(f20). +female(f21). +female(f22). +female(f23). +female(f25). +female(f26). +female(f28). +female(f8). +female(fannie). +male(fred). +male(frederick). +female(gail). +male(george). +male(harry). +female(helen). +male(jack). +male(james). +female(jane). +female(janet). +male(jonas). +female(kari). +male(karl). +male(leon). +female(lorrie). +male(m1). +male(m10). +male(m11). +male(m13). +male(m15). +male(m16). +male(m17). +male(m18). +male(m24). +male(m27). +male(m29). +male(m3). +male(m4). +male(m5). +male(m6). +male(m7). +male(m9). +female(maria). +male(mark). +female(martha). +male(melvin). +female(nancy). +male(neil). +male(nero). +female(nonnie). +female(oma). +male(owen). +male(paul). +female(paula). +male(peter). +female(prissie). +female(rachel). +male(ray). +female(regina). +male(steve). +female(susan). +female(terri). +male(terry). +male(umo). +male(walt). +female(wendy). + +sibling(angela,ray). +sibling(art,umo). +sibling(art,wendy). +sibling(calvin,christy). +sibling(calvin,jack). +sibling(christy,calvin). +sibling(christy,jack). +sibling(cornelia,melvin). +sibling(cornelia,nancy). +sibling(david,elisa). +sibling(elisa,david). +sibling(eric,fannie). +sibling(eric,gail). +sibling(eric,harry). +sibling(f12,m11). +sibling(f14,m13). +sibling(f14,m15). +sibling(f19,f20). +sibling(f19,m18). +sibling(f2,m1). +sibling(f20,f19). +sibling(f20,m18). +sibling(f21,f22). +sibling(f22,f21). +sibling(f23,f25). +sibling(f23,m24). +sibling(f25,f23). +sibling(f25,m24). +sibling(f26,f28). +sibling(f26,m27). +sibling(f28,f26). +sibling(f28,m27). +sibling(f8,m10). +sibling(f8,m9). +sibling(fannie,eric). +sibling(fannie,gail). +sibling(fannie,harry). +sibling(frederick,jane). +sibling(frederick,prissie). +sibling(gail,eric). +sibling(gail,fannie). +sibling(gail,harry). +sibling(harry,eric). +sibling(harry,fannie). +sibling(harry,gail). +sibling(jack,calvin). +sibling(jack,christy). +sibling(jane,frederick). +sibling(jane,prissie). +sibling(janet,nero). +sibling(jonas,terry). +sibling(karl,lorrie). +sibling(karl,mark). +sibling(lorrie,karl). +sibling(lorrie,mark). +sibling(m1,f2). +sibling(m10,f8). +sibling(m10,m9). +sibling(m11,f12). +sibling(m13,f14). +sibling(m13,m15). +sibling(m15,f14). +sibling(m15,m13). +sibling(m16,m17). +sibling(m17,m16). +sibling(m18,f19). +sibling(m18,f20). +sibling(m24,f23). +sibling(m24,f25). +sibling(m27,f26). +sibling(m27,f28). +sibling(m4,m5). +sibling(m4,m6). +sibling(m4,m7). +sibling(m5,m4). +sibling(m5,m6). +sibling(m5,m7). +sibling(m6,m4). +sibling(m6,m5). +sibling(m6,m7). +sibling(m7,m4). +sibling(m7,m5). +sibling(m7,m6). +sibling(m9,f8). +sibling(m9,m10). +sibling(mark,karl). +sibling(mark,lorrie). +sibling(melvin,cornelia). +sibling(melvin,nancy). +sibling(nancy,cornelia). +sibling(nancy,melvin). +sibling(nero,janet). +sibling(oma,paul). +sibling(oma,rachel). +sibling(paul,oma). +sibling(paul,rachel). +sibling(prissie,frederick). +sibling(prissie,jane). +sibling(rachel,oma). +sibling(rachel,paul). +sibling(ray,angela). +sibling(terry,jonas). +sibling(umo,art). +sibling(umo,wendy). +sibling(wendy,art). +sibling(wendy,umo). + +parent(ann, david). +parent(ann, elisa). +parent(beatrice, eric). +parent(beatrice, fannie). +parent(beatrice, gail). +parent(beatrice, harry). +parent(callie, karl). +parent(callie, lorrie). +parent(callie, mark). +parent(kari, janet). +parent(kari, nero). +parent(lorrie, oma). +parent(lorrie, paul). +parent(lorrie, rachel). +parent(martha, susan). +parent(deanna, jonas). parent(deanna, terry). parent(elisa, umo). +parent(elisa, wendy). parent(elisa, art). parent(fannie, cornelia). +parent(fannie, melvin). parent(fannie, nancy). parent(helen, prissie). +parent(helen, jane). parent(janet, jack). parent(janet, calvin). +parent(janet, christy). parent(nonnie, angela). parent(nonnie, ray). +parent(terri, f8). parent(terri, m9). parent(terri, m10). +parent(wendy, m11). parent(wendy, f12). parent(alice, m13). +parent(alice, f14). parent(alice, m15). parent(maria, m16). +parent(maria, m17). parent(nancy, m18). parent(nancy, f19). +parent(nancy, f20). parent(prissie, f21). parent(prissie, f22). +parent(jane, f23). parent(jane, m24). parent(jane, f25). +parent(christy, f26). parent(christy, m27). parent(christy, f28). +parent(regina, m29). parent(oma, m1). parent(oma, f2). +parent(paula, m3). parent(susan, m4). parent(susan, m5). +parent(susan, m6). parent(susan, m7). parent(helen, frederick). + +parent(alfred, david). parent(alfred, elisa). parent(bob, eric). +parent(bob, fannie). parent(bob, gail). parent(bob, harry). +parent(carl, karl). parent(carl, lorrie). parent(carl, mark). +parent(karl, janet). parent(karl, nero). parent(leon, oma). +parent(leon, paul). parent(leon, rachel). parent(mark, susan). +parent(david, jonas). parent(david, terry). parent(eric, umo). +parent(eric, wendy). parent(eric, art). parent(fred, cornelia). +parent(fred, melvin). parent(fred, nancy). parent(harry, prissie). +parent(harry, jane). parent(james, jack). parent(james, calvin). +parent(james, christy). parent(nero, angela). parent(nero, ray). +parent(terry, f8). parent(terry, m9). parent(terry, m10). +parent(walt, m11). parent(walt, f12). parent(art, m13). +parent(art, f14). parent(art, m15). parent(melvin, m16). +parent(melvin, m17). parent(neil, m18). parent(neil, f19). +parent(neil, f20). parent(peter, f21). parent(peter, f22). +parent(jack, f23). parent(jack, m24). parent(jack, f25). +parent(carlos, f26). parent(carlos, m27). parent(carlos, f28). +parent(ray, m29). parent(owen, m1). parent(owen, f2). +parent(paul, m3). parent(steve, m4). parent(steve, m5). +parent(steve, m6). parent(steve, m7). parent(harry, frederick). + + married(ann, alfred). married(beatrice, bob). married(callie, carl). + married(deanna, david). married(elisa, eric). married(fannie, fred). + married(gail, george). married(helen, harry). married(janet, james). + married(kari, karl). married(lorrie, leon). married(martha, mark). + married(nonnie, nero). married(oma, owen). married(paula, paul). + married(susan, steve). married(terri, terry). married(wendy, walt). + married(alice, art). married(maria, melvin). married(nancy, neil). + married(prissie, peter). married(jane, jack). married(christy, carlos). + married(regina, ray). + + + + +/* Here's the family shown graphically: + + Steve |--- m7 + Martha | | |--- m6 + | |------ Susan |--- m5 + /-- Mark | |--- m4 + / + / /-- Rachel + / / + / / + Callie | | + | |----- Lorrie | + Carl | | |------- Paul | + \ Leon | | |--- m3 + | | Paula | + | \ + | \ + | \----- Oma |--- f2 + | | | + | Owen |--- m1 + | + | /----- Ray | + | / | |--- m29 + | / Regina | + | Nonnie | + | | | + | /---- Nero |----- Angela + | / + | / + \---- Karl | Carlos |--- f28 + | | | |--- m27 + Kari | /- Christy |--- f26 + \ / + \ / + \--- Janet | + | |----- Calvin + James | + \ + \ + \---- Jack |--- f25 + | |--- m24 + /---- Jane |--- f23 + / + / + Helen | + | |-- Frederick + /-- Harry | + / \ + | \ + | \- Prissie |--- f22 + | | | + | Peter |--- f21 + | + | George + | | + / /-- Gail + | / Neil |--- f20 + Bob |-/ | |--- f19 + | | /--- Nancy |--- m18 + Beatrice |-\ / + | \ / + \ \- Fannie | + | | |-- Cornelia + | Fred | + | \ + | \ + | \-- Melvin |--- m17 + | | | + | Maria |--- m16 + | + | Alice |--- m15 + | | |--- f14 + | /----- Art |--- m13 + | / + \ / + \--- Eric | + | |------- Umo + /-- Elisa | + / \ + / \ + Ann | \--- Wendy |--- f12 + | | | | + Alfred | Walt |--- m11 + \ + \ + \-- David | ----- Jonas + | | + Deanna | + \ + \ + \--- Terry |--- m10 + | |--- m9 + Terri |--- f8 +*/ \ No newline at end of file Copied: trunk/examples/forte/forte_family.owl (from rev 551, trunk/examples/forte/forte.owl) =================================================================== --- trunk/examples/forte/forte_family.owl (rev 0) +++ trunk/examples/forte/forte_family.owl 2008-02-13 10:24:51 UTC (rev 553) @@ -0,0 +1,547 @@ +<?xml version="1.0" encoding="ISO-8859-1"?> +<!DOCTYPE rdf:RDF [ + <!ENTITY owl 'http://www.w3.org/2002/07/owl#'> +]> + +<rdf:RDF + xml:base="http://localhost/foo" + xmlns:a="http://localhost/foo#" + xmlns:owl="http://www.w3.org/2002/07/owl#" + xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" + xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"> + +<owl:Ontology rdf:about=""/> + +<owl:Class rdf:about="&owl;Nothing"> + <owl:equivalentClass> + <owl:Class> + <owl:intersectionOf rdf:parseType="Collection"> + <owl:Class rdf:about="#male"/> + <owl:Class rdf:about="#female"/> + </owl:intersectionOf> + </owl:Class> + </owl:equivalentClass> +</owl:Class> + +<owl:ObjectProperty rdf:ID="married"> + <rdf:type rdf:resource="&owl;SymmetricProperty"/> + <rdf:type rdf:resource="&owl;FunctionalProperty"/> +</owl:ObjectProperty> + +<owl:ObjectProperty rdf:ID="sibling"> + <rdf:type rdf:resource="&owl;SymmetricProperty"/> +</owl:ObjectProperty> + +<a:male rdf:ID="alfred"> + <a:parent rdf:resource="#david"/> + <a:parent rdf:resource="#elisa"/> +</a:male> + +<a:female rdf:ID="alice"> + <a:married rdf:resource="#art"/> + <a:parent rdf:resource="#f14"/> + <a:parent rdf:resource="#m13"/> + <a:parent rdf:resource="#m15"/> +</a:female> + +<a:female rdf:ID="angela"> + <a:sibling rdf:resource="#ray"/> +</a:female> + +<a:female rdf:ID="ann"> + <a:married rdf:resource="#alfred"/> + <a:parent rdf:resource="#david"/> + <a:parent rdf:resource="#elisa"/> +</a:female> + +<a:male rdf:ID="art"> + <a:parent rdf:resource="#f14"/> + <a:parent rdf:resource="#m13"/> + <a:parent rdf:resource="#m15"/> + <a:sibling rdf:resource="#umo"/> + <a:sibling rdf:resource="#wendy"/> +</a:male> + +<a:female rdf:ID="beatrice"> + <a:married rdf:resource="#bob"/> + <a:parent rdf:resource="#eric"/> + <a:parent rdf:resource="#fannie"/> + <a:parent rdf:resource="#gail"/> + <a:parent rdf:resource="#harry"/> +</a:female> + +<a:male rdf:ID="bob"> + <a:parent rdf:resource="#eric"/> + <a:parent rdf:resource="#fannie"/> + <a:parent rdf:resource="#gail"/> + <a:parent rdf:resource="#harry"/> +</a:male> + +<a:female rdf:ID="callie"> + <a:married rdf:resource="#carl"/> + <a:parent rdf:resource="#karl"/> + <a:parent rdf:resource="#lorrie"/> + <a:parent rdf:resource="#mark"/> +</a:female> + +<a:male rdf:ID="calvin"> + <a:sibling rdf:resource="#christy"/> + <a:sibling rdf:resource="#jack"/> +</a:male> + +<a:male rdf:ID="carl"> + <a:parent rdf:resource="#karl"/> + <a:parent rdf:resource="#lorrie"/> + <a:parent rdf:resource="#mark"/> +</a:male> + +<a:male rdf:ID="carlos"> + <a:parent rdf:resource="#f26"/> + <a:parent rdf:resource="#f28"/> + <a:parent rdf:resource="#m27"/> +</a:male> + +<a:female rdf:ID="christy"> + <a:married rdf:resource="#carlos"/> + <a:parent rdf:resource="#f26"/> + <a:parent rdf:resource="#f28"/> + <a:parent rdf:resource="#m27"/> + <a:sibling rdf:resource="#calvin"/> + <a:sibling rdf:resource="#jack"/> +</a:female> + +<a:female rdf:ID="cornelia"> + <a:sibling rdf:resource="#melvin"/> + <a:sibling rdf:resource="#nancy"/> +</a:female> + +<a:male rdf:ID="david"> + <a:parent rdf:resource="#jonas"/> + <a:parent rdf:resource="#terry"/> + <a:sibling rdf:resource="#elisa"/> +</a:male> + +<a:female rdf:ID="deanna"> + <a:married rdf:resource="#david"/> + <a:parent rdf:resource="#jonas"/> + <a:parent rdf:resource="#terry"/> +</a:female> + +<a:female rdf:ID="elisa"> + <a:married rdf:resource="#eric"/> + <a:parent rdf:resource="#art"/> + <a:parent rdf:resource="#umo"/> + <a:parent rdf:resource="#wendy"/> + <a:sibling rdf:resource="#david"/> +</a:female> + +<a:male rdf:ID="eric"> + <a:parent rdf:resource="#art"/> + <a:parent rdf:resource="#umo"/> + <a:parent rdf:resource="#wendy"/> + <a:sibling rdf:resource="#fannie"/> + <a:sibling rdf:resource="#gail"/> + <a:sibling rdf:resource="#harry"/> +</a:male> + +<a:female rdf:ID="f12"> + <a:sibling rdf:resource="#m11"/> +</a:female> + +<a:female rdf:ID="f14"> + <a:sibling rdf:resource="#m13"/> + <a:sibling rdf:resource="#m15"/> +</a:female> + +<a:female rdf:ID="f19"> + <a:sibling rdf:resource="#f20"/> + <a:sibling rdf:resource="#m18"/> +</a:female> + +<a:female rdf:ID="f2"> + <a:sibling rdf:resource="#m1"/> +</a:female> + +<a:female rdf:ID="f20"> + <a:sibling rdf:resource="#f19"/> + <a:sibling rdf:resource="#m18"/> +</a:female> + +<a:female rdf:ID="f21"> + <a:sibling rdf:resource="#f22"/> +</a:female> + +<a:female rdf:ID="f22"> + <a:sibling rdf:resource="#f21"/> +</a:female> + +<a:female rdf:ID="f23"> + <a:sibling rdf:resource="#f25"/> + <a:sibling rdf:resource="#m24"/> +</a:female> + +<a:female rdf:ID="f25"> + <a:sibling rdf:resource="#f23"/> + <a:sibling rdf:resource="#m24"/> +</a:female> + +<a:female rdf:ID="f26"> + <a:sibling rdf:resource="#f28"/> + <a:sibling rdf:resource="#m27"/> +</a:female> + +<a:female rdf:ID="f28"> + <a:sibling rdf:resource="#f26"/> + <a:sibling rdf:resource="#m27"/> +</a:female> + +<a:female rdf:ID="f8"> + <a:sibling rdf:resource="#m10"/> + <a:sibling rdf:resource="#m9"/> +</a:female> + +<a:female rdf:ID="fannie"> + <a:married rdf:resource="#fred"/> + <a:parent rdf:resource="#cornelia"/> + <a:parent rdf:resource="#melvin"/> + <a:parent rdf:resource="#nancy"/> + <a:sibling rdf:resource="#eric"/> + <a:sibling rdf:resource="#gail"/> + <a:sibling rdf:resource="#harry"/> +</a:female> + +<a:male rdf:ID="fred"> + <a:parent rdf:resource="#cornelia"/> + <a:parent rdf:resource="#melvin"/> + <a:parent rdf:resource="#nancy"/> +</a:male> + +<a:male rdf:ID="frederick"> + <a:sibling rdf:resource="#jane"/> + <a:sibling rdf:resource="#prissie"/> +</a:male> + +<a:female rdf:ID="gail"> + <a:married rdf:resource="#george"/> + <a:sibling rdf:resource="#eric"/> + <a:sibling rdf:resource="#fannie"/> + <a:sibling rdf:resource="#harry"/> +</a:female> + +<a:male rdf:ID="george"/> + +<a:male rdf:ID="harry"> + <a:parent rdf:resource="#frederick"/> + <a:parent rdf:resource="#jane"/> + <a:parent rdf:resource="#prissie"/> + <a:sibling rdf:resource="#eric"/> + <a:sibling rdf:resource="#fannie"/> + <a:sibling rdf:resource="#gail"/> +</a:male> + +<a:female rdf:ID="helen"> + <a:married rdf:resource="#harry"/> + <a:parent rdf:resource="#frederick"/> + <a:parent rdf:resource="#jane"/> + <a:parent rdf:resource="#prissie"/> +</a:female> + +<a:male rdf:ID="jack"> + <a:parent rdf:resource="#f23"/> + <a:parent rdf:resource="#f25"/> + <a:parent rdf:resource="#m24"/> + <a:sibling rdf:resource="#calvin"/> + <a:sibling rdf:resource="#christy"/> +</a:male> + +<a:male rdf:ID="james"> + <a:parent rdf:resource="#calvin"/> + <a:parent rdf:resource="#christy"/> + <a:parent rdf:resource="#jack"/> +</a:male> + +<a:female rdf:ID="jane"> + <a:married rdf:resource="#jack"/> + <a:parent rdf:resource="#f23"/> + <a:parent rdf:resource="#f25"/> + <a:parent rdf:resource="#m24"/> + <a:sibling rdf:resource="#frederick"/> + <a:sibling rdf:resource="#prissie"/> +</a:female> + +<a:female rdf:ID="janet"> + <a:married rdf:resource="#james"/> + <a:parent rdf:resource="#calvin"/> + <a:parent rdf:resource="#christy"/> + <a:parent rdf:resource="#jack"/> + <a:sibling rdf:resource="#nero"/> +</a:female> + +<a:male rdf:ID="jonas"> + <a:sibling rdf:resource="#terry"/> +</a:male> + +<a:female rdf:ID="kari"> + <a:married rdf:resource="#karl"/> + <a:parent rdf:resource="#janet"/> + <a:parent rdf:resource="#nero"/> +</a:female> + +<a:male rdf:ID="karl"> + <a:parent rdf:resource="#janet"/> + <a:parent rdf:resource="#nero"/> + <a:sibling rdf:resource="#lorrie"/> + <a:sibling rdf:resource="#mark"/> +</a:male> + +<a:male rdf:ID="leon"> + <a:parent rdf:resource="#oma"/> + <a:parent rdf:resource="#paul"/> + <a:parent rdf:resource="#rachel"/> +</a:male> + +<a:female rdf:ID="lorrie"> + <a:married rdf:resource="#leon"/> + <a:parent rdf:resource="#oma"/> + <a:parent rdf:resource="#paul"/> + <a:parent rdf:resource="#rachel"/> + <a:sibling rdf:resource="#karl"/> + <a:sibling rdf:resource="#mark"/> +</a:female> + +<a:male rdf:ID="m1"> + <a:sibling rdf:resource="#f2"/> +</a:male> + +<a:male rdf:ID="m10"> + <a:sibling rdf:resource="#f8"/> + <a:sibling rdf:resource="#m9"/> +</a:male> + +<a:male rdf:ID="m11"> + <a:sibling rdf:resource="#f12"/> +</a:male> + +<a:male rdf:ID="m13"> + <a:sibling rdf:resource="#f14"/> + <a:sibling rdf:resource="#m15"/> +</a:male> + +<a:male rdf:ID="m15"> + <a:sibling rdf:resource="#f14"/> + <a:sibling rdf:resource="#m13"/> +</a:male> + +<a:male rdf:ID="m16"> + <a:sibling rdf:resource="#m17"/> +</a:male> + +<a:male rdf:ID="m17"> + <a:sibling rdf:resource="#m16"/> +</a:male> + +<a:male rdf:ID="m18"> + <a:sibling rdf:resource="#f19"/> + <a:sibling rdf:resource="#f20"/> +</a:male> + +<a:male rdf:ID="m24"> + <a:sibling rdf:resource="#f23"/> + <a:sibling rdf:resource="#f25"/> +</a:male> + +<a:male rdf:ID="m27"> + <a:sibling rdf:resource="#f26"/> + <a:sibling rdf:resource="#f28"/> +</a:male> + +<a:male rdf:ID="m29"/> + +<a:male rdf:ID="m3"/> + +<a:male rdf:ID="m4"> + <a:sibling rdf:resource="#m5"/> + <a:sibling rdf:resource="#m6"/> + <a:sibling rdf:resource="#m7"/> +</a:male> + +<a:male rdf:ID="m5"> + <a:sibling rdf:resource="#m4"/> + <a:sibling rdf:resource="#m6"/> + <a:sibling rdf:resource="#m7"/> +</a:male> + +<a:male rdf:ID="m6"> + <a:sibling rdf:resource="#m4"/> + <a:sibling rdf:resource="#m5"/> + <a:sibling rdf:resource="#m7"/> +</a:male> + +<a:male rdf:ID="m7"> + <a:sibling rdf:resource="#m4"/> + <a:sibling rdf:resource="#m5"/> + <a:sibling rdf:resource="#m6"/> +</a:male> + +<a:male rdf:ID="m9"> + <a:sibling rdf:resource="#f8"/> + <a:sibling rdf:resource="#m10"/> +</a:male> + +<a:female rdf:ID="maria"> + <a:married rdf:resource="#melvin"/> + <a:parent rdf:resource="#m16"/> + <a:parent rdf:resource="#m17"/> +</a:female> + +<a:male rdf:ID="mark"> + <a:parent rdf:resource="#susan"/> + <a:sibling rdf:resource="#karl"/> + <a:sibling rdf:resource="#lorrie"/> +</a:male> + +<a:female rdf:ID="martha"> + <a:married rdf:resource="#mark"/> + <a:parent rdf:resource="#susan"/> +</a:female> + +<a:male rdf:ID="melvin"> + <a:parent rdf:resource="#m16"/> + <a:parent rdf:resource="#m17"/> + <a:sibling rdf:resource="#cornelia"/> + <a:sibling rdf:resource="#nancy"/> +</a:male> + +<a:female rdf:ID="nancy"> + <a:married rdf:resource="#neil"/> + <a:parent rdf:resource="#f19"/> + <a:parent rdf:resource="#f20"/> + <a:parent rdf:resource="#m18"/> + <a:sibling rdf:resource="#cornelia"/> + <a:sibling rdf:resource="#melvin"/> +</a:female> + +<a:male rdf:ID="neil"> + <a:parent rdf:resource="#f19"/> + <a:parent rdf:resource="#f20"/> + <a:parent rdf:resource="#m18"/> +</a:male> + +<a:male rdf:ID="nero"> + <a:parent rdf:resource="#angela"/> + <a:parent rdf:resource="#ray"/> + <a:sibling rdf:resource="#janet"/> +</a:male> + +<a:female rdf:ID="nonnie"> + <a:married rdf:resource="#nero"/> + <a:parent rdf:resource="#angela"/> + <a:parent rdf:resource="#ray"/> +</a:female> + +<a:female rdf:ID="oma"> + <a:married rdf:resource="#owen"/> + <a:parent rdf:resource="#f2"/> + <a:parent rdf:resource="#m1"/> + <a:sibling rdf:resource="#paul"/> + <a:sibling rdf:resource="#rachel"/> +</a:female> + +<a:male rdf:ID="owen"> + <a:parent rdf:resource="#f2"/> + <a:parent rdf:resource="#m1"/> +</a:male> + +<a:male rdf:ID="paul"> + <a:parent rdf:resource="#m3"/> + <a:sibling rdf:resource="#oma"/> + <a:sibling rdf:resource="#rachel"/> +</a:male> + +<a:female rdf:ID="paula"> + <a:married rdf:resource="#paul"/> + <a:parent rdf:resource="#m3"/> +</a:female> + +<a:male rdf:ID="peter"> + <a:parent rdf:resource="#f21"/> + <a:parent rdf:resource="#f22"/> +</a:male> + +<a:female rdf:ID="prissie"> + <a:married rdf:resource="#peter"/> + <a:parent rdf:resource="#f21"/> + <a:parent rdf:resource="#f22"/> + <a:sibling rdf:resource="#frederick"/> + <a:sibling rdf:resource="#jane"/> +</a:female> + +<a:female rdf:ID="rachel"> + <a:sibling rdf:resource="#oma"/> + <a:sibling rdf:resource="#paul"/> +</a:female> + +<a:male rdf:ID="ray"> + <a:parent rdf:resource="#m29"/> + <a:sibling rdf:resource="#angela"/> +</a:male> + +<a:female rdf:ID="regina"> + <a:married rdf:resource="#ray"/> + <a:parent rdf:resource="#m29"/> +</a:female> + +<a:male rdf:ID="steve"> + <a:parent rdf:resource="#m4"/> + <a:parent rdf:resource="#m5"/> + <a:parent rdf:resource="#m6"/> + <a:parent rdf:resource="#m7"/> +</a:male> + +<a:female rdf:ID="susan"> + <a:married rdf:resource="#steve"/> + <a:parent rdf:resource="#m4"/> + <a:parent rdf:resource="#m5"/> + <a:parent rdf:resource="#m6"/> + <a:parent rdf:resource="#m7"/> +</a:female> + +<a:female rdf:ID="terri"> + <a:married rdf:resource="#terry"/> + <a:parent rdf:resource="#f8"/> + <a:parent rdf:resource="#m10"/> + <a:parent rdf:resource="#m9"/> +</a:female> + +<a:male rdf:ID="terry"> + <a:parent rdf:resource="#f8"/> + <a:parent rdf:resource="#m10"/> + <a:parent rdf:resource="#m9"/> + <a:sibling rdf:resource="#jonas"/> +</a:male> + +<a:male rdf:ID="umo"> + <a:sibling rdf:resource="#art"/> + <a:sibling rdf:resource="#wendy"/> +</a:male> + +<a:male rdf:ID="walt"> + <a:parent rdf:resource="#f12"/> + <a:parent rdf:resource="#m11"/> +</a:male> + +<a:female rdf:ID="wendy"> + <a:married rdf:resource="#walt"/> + <a:parent rdf:resource="#f12"/> + <a:parent rdf:resource="#m11"/> + <a:sibling rdf:resource="#art"/> + <a:sibling rdf:resource="#umo"/> +</a:female> + +<owl:Class rdf:ID="female"/> + +<owl:Class rdf:ID="male"/> + +<owl:ObjectProperty rdf:ID="parent"/> + +</rdf:RDF> Deleted: trunk/examples/forte/forte_uncle.conf =================================================================== --- trunk/examples/forte/forte_uncle.conf 2008-02-13 10:09:50 UTC (rev 552) +++ trunk/examples/forte/forte_uncle.conf 2008-02-13 10:24:51 UTC (rev 553) @@ -1,492 +0,0 @@ -/** - * Extracted from the FORTE (First Order Revision of Theories from Examples) - * data set: - * - * http://www.cs.utexas.edu/users/ml/forte.html - * - * The goal of this learning problem is to learn the concept of an uncle. - * - * At the bottom of this file, you can find a graphical representation of the - * family tree corresponding to the facts in this file. - * - * possible solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP - * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP)) - * - * Copyright (C) 2007, Jens Lehmann - */ - -// control output -showIndividuals = true; -showConcepts = true; -showRoles = true; -showInternalKB = true; -showSubsumptionHierarchy = true; - -/** background knowledge **/ -BOTTOM = (male AND female). - -Symmetric(sibling). -Symmetric(married). -Functional(married). - -male(alfred). -female(alice). -female(angela). -female(ann). -male(art). -female(beatrice). -male(bob). -female(callie). -male(calvin). -male(carl). -male(carlos). -female(christy). -female(cornelia). -male(david). -female(deanna). -female(elisa). -male(eric). -female(f12). -female(f14). -female(f19). -female(f2). -female(f20). -female(f21). -female(f22). -female(f23). -female(f25). -female(f26). -female(f28). -female(f8). -female(fannie). -male(fred). -male(frederick). -female(gail). -male(george). -male(harry). -female(helen). -male(jack). -male(james). -female(jane). -female(janet). -male(jonas). -female(kari). -male(karl). -male(leon). -female(lorrie). -male(m1). -male(m10). -male(m11). -male(m13). -male(m15). -male(m16). -male(m17). -male(m18). -male(m24). -male(m27). -male(m29). -male(m3). -male(m4). -male(m5). -male(m6). -male(m7). -male(m9). -female(maria). -male(mark). -female(martha). -male(melvin). -female(nancy). -male(neil). -male(nero). -female(nonnie). -female(oma). -male(owen). -male(paul). -female(paula). -male(peter). -female(prissie). -female(rachel). -male(ray). -female(regina). -male(steve). -female(susan). -female(terri). -male(terry). -male(umo). -male(walt). -female(wendy). - -sibling(angela,ray). -sibling(art,umo). -sibling(art,wendy). -sibling(calvin,christy). -sibling(calvin,jack). -sibling(christy,calvin). -sibling(christy,jack). -sibling(cornelia,melvin). -sibling(cornelia,nancy). -sibling(david,elisa). -sibling(elisa,david). -sibling(eric,fannie). -sibling(eric,gail). -sibling(eric,harry). -sibling(f12,m11). -sibling(f14,m13). -sibling(f14,m15). -sibling(f19,f20). -sibling(f19,m18). -sibling(f2,m1). -sibling(f20,f19). -sibling(f20,m18). -sibling(f21,f22). -sibling(f22,f21). -sibling(f23,f25). -sibling(f23,m24). -sibling(f25,f23). -sibling(f25,m24). -sibling(f26,f28). -sibling(f26,m27). -sibling(f28,f26). -sibling(f28,m27). -sibling(f8,m10). -sibling(f8,m9). -sibling(fannie,eric). -sibling(fannie,gail). -sibling(fannie,harry). -sibling(frederick,jane). -sibling(frederick,prissie). -sibling(gail,eric). -sibling(gail,fannie). -sibling(gail,harry). -sibling(harry,eric). -sibling(harry,fannie). -sibling(harry,gail). -sibling(jack,calvin). -sibling(jack,christy). -sibling(jane,frederick). -sibling(jane,prissie). -sibling(janet,nero). -sibling(jonas,terry). -sibling(karl,lorrie). -sibling(karl,mark). -sibling(lorrie,karl). -sibling(lorrie,mark). -sibling(m1,f2). -sibling(m10,f8). -sibling(m10,m9). -sibling(m11,f12). -sibling(m13,f14). -sibling(m13,m15). -sibling(m15,f14). -sibling(m15,m13). -sibling(m16,m17). -sibling(m17,m16). -sibling(m18,f19). -sibling(m18,f20). -sibling(m24,f23). -sibling(m24,f25). -sibling(m27,f26). -sibling(m27,f28). -sibling(m4,m5). -sibling(m4,m6). -sibling(m4,m7). -sibling(m5,m4). -sibling(m5,m6). -sibling(m5,m7). -sibling(m6,m4). -sibling(m6,m5). -sibling(m6,m7). -sibling(m7,m4). -sibling(m7,m5). -sibling(m7,m6). -sibling(m9,f8). -sibling(m9,m10). -sibling(mark,karl). -sibling(mark,lorrie). -sibling(melvin,cornelia). -sibling(melvin,nancy). -sibling(nancy,cornelia). -sibling(nancy,melvin). -sibling(nero,janet). -sibling(oma,paul). -sibling(oma,rachel). -sibling(paul,oma). -sibling(paul,rachel). -sibling(prissie,frederick). -sibling(prissie,jane). -sibling(rachel,oma). -sibling(rachel,paul). -sibling(ray,angela). -sibling(terry,jonas). -sibling(umo,art). -sibling(umo,wendy). -sibling(wendy,art). -sibling(wendy,umo). - -parent(ann, david). -parent(ann, elisa). -parent(beatrice, eric). -parent(beatrice, fannie). -parent(beatrice, gail). -parent(beatrice, harry). -parent(callie, karl). -parent(callie, lorrie). -parent(callie, mark). -parent(kari, janet). -parent(kari, nero). -parent(lorrie, oma). -parent(lorrie, paul). -parent(lorrie, rachel). -parent(martha, susan). -parent(deanna, jonas). parent(deanna, terry). parent(elisa, umo). -parent(elisa, wendy). parent(elisa, art). parent(fannie, cornelia). -parent(fannie, melvin). parent(fannie, nancy). parent(helen, prissie). -parent(helen, jane). parent(janet, jack). parent(janet, calvin). -parent(janet, christy). parent(nonnie, angela). parent(nonnie, ray). -parent(terri, f8). parent(terri, m9). parent(terri, m10). -parent(wendy, m11). parent(wendy, f12). parent(alice, m13). -parent(alice, f14). parent(alice, m15). parent(maria, m16). -parent(maria, m17). parent(nancy, m18). parent(nancy, f19). -parent(nancy, f20). parent(prissie, f21). parent(prissie, f22). -parent(jane, f23). parent(jane, m24). parent(jane, f25). -parent(christy, f26). parent(christy, m27). parent(christy, f28). -parent(regina, m29). parent(oma, m1). parent(oma, f2). -parent(paula, m3). parent(susan, m4). parent(susan, m5). -parent(susan, m6). parent(susan, m7). parent(helen, frederick). - -parent(alfred, david). parent(alfred, elisa). parent(bob, eric). -parent(bob, fannie). parent(bob, gail). parent(bob, harry). -parent(carl, karl). parent(carl, lorrie). parent(carl, mark). -parent(karl, janet). parent(karl, nero). parent(leon, oma). -parent(leon, paul). parent(leon, rachel). parent(mark, susan). -parent(david, jonas). parent(david, terry). parent(eric, umo). -parent(eric, wendy). parent(eric, art). parent(fred, cornelia). -parent(fred, melvin). parent(fred, nancy). parent(harry, prissie). -parent(harry, jane). parent(james, jack). parent(james, calvin). -parent(james, christy). parent(nero, angela). parent(nero, ray). -parent(terry, f8). parent(terry, m9). parent(terry, m10). -parent(walt, m11). parent(walt, f12). parent(art, m13). -parent(art, f14). parent(art, m15). parent(melvin, m16). -parent(melvin, m17). parent(neil, m18). parent(neil, f19). -parent(neil, f20). parent(peter, f21). parent(peter, f22). -parent(jack, f23). parent(jack, m24). parent(jack, f25). -parent(carlos, f26). parent(carlos, m27). parent(carlos, f28). -parent(ray, m29). parent(owen, m1). parent(owen, f2). -parent(paul, m3). parent(steve, m4). parent(steve, m5). -parent(steve, m6). parent(steve, m7). parent(harry, frederick). - - married(ann, alfred). married(beatrice, bob). married(callie, carl). - married(deanna, david). married(elisa, eric). married(fannie, fred). - married(gail, george). married(helen, harry). married(janet, james). - married(kari, karl). married(lorrie, leon). married(martha, mark). - married(nonnie, nero). married(oma, owen). married(paula, paul). - married(susan, steve). married(terri, terry). married(wendy, walt). - married(alice, art). married(maria, melvin). married(nancy, neil). - married(prissie, peter). married(jane, jack). married(christy, carlos). - married(regina, ray). - - -/** examples **/ - -/* small example set -+isUncle(art). -+isUncle(calvin). -+isUncle(carlos). -+isUncle(david). -+isUncle(eric). -+isUncle(fred). -+isUncle(frederick). -+isUncle(george). - --isUncle(alfred). --isUncle(alice). --isUncle(angela). --isUncle(bob). --isUncle(carl). --isUncle(christy). --isUncle(karl). -*/ - -// complete example set -+isUncle(art). -+isUncle(calvin). -+isUncle(carlos). -+isUncle(david). -+isUncle(eric). -+isUncle(fred). -+isUncle(frederick). -+isUncle(george). -+isUncle(harry). -+isUncle(jack). -+isUncle(james). -+isUncle(jonas). -+isUncle(karl). -+isUncle(leon). -+isUncle(mark). -+isUncle(melvin). -+isUncle(neil). -+isUncle(nero). -+isUncle(owen). -+isUncle(paul). -+isUncle(peter). -+isUncle(umo). -+isUncle(walt). - --isUncle(alfred). --isUncle(alice). --isUncle(angela). --isUncle(ann). --isUncle(beatrice). --isUncle(bob). --isUncle(callie). --isUncle(carl). --isUncle(christy). --isUncle(cornelia). --isUncle(deanna). --isUncle(elisa). --isUncle(f12). --isUncle(f14). --isUncle(f19). --isUncle(f2). --isUncle(f20). --isUncle(f21). --isUncle(f22). --isUncle(f23). --isUncle(f25). --isUncle(f26). --isUncle(f28). --isUncle(f8). --isUncle(fannie). --isUncle(gail). --isUncle(helen). --isUncle(jane). --isUncle(janet). --isUncle(kari). --isUncle(lorrie). --isUncle(m1). --isUncle(m10). --isUncle(m11). --isUncle(m13). --isUncle(m15). --isUncle(m16). --isUncle(m17). --isUncle(m18). --isUncle(m24). --isUncle(m27). --isUncle(m29). --isUncle(m3). --isUncle(m4). --isUncle(m5). --isUncle(m6). --isUncle(m7). --isUncle(m9). --isUncle(maria). --isUncle(martha). --isUncle(nancy). --isUncle(nonnie). --isUncle(oma). --isUncle(paula). --isUncle(prissie). --isUncle(rachel). --isUncle(ray). --isUncle(regina). --isUncle(steve). --isUncle(susan). --isUncle(terri). --isUncle(terry). --isUncle(wendy). - -/* Here's the family shown graphically: - - Steve |--- m7 - Martha | | |--- m6 - | |------ Susan |--- m5 - /-- Mark | |--- m4 - / - / /-- Rachel - / / - / / - Callie | | - | |----- Lorrie | - Carl | | |------- Paul | - \ Leon | | |--- m3 - | | Paula | - | \ - | \ - | \----- Oma |--- f2 - | | | - | Owen |--- m1 - | - | /----- Ray | - | / | |--- m29 - | / Regina | - | Nonnie | - | | | - | /---- Nero |----- Angela - | / - | / - \---- Karl | Carlos |--- f28 - | | | |--- m27 - Kari | /- Christy |--- f26 - \ / - \ / - \--- Janet | - | |----- Calvin - James | - \ - \ - \---- Jack |--- f25 - | |--- m24 - /---- Jane |--- f23 - / - / - Helen | - | |-- Frederick - /-- Harry | - / \ - | \ - | \- Prissie |--- f22 - | | | - | Peter |--- f21 - | - | George - | | - / /-- Gail - | / Neil |--- f20 - Bob |-/ | |--- f19 - | | /--- Nancy |--- m18 - Beatrice |-\ / - | \ / - \ \- Fannie | - | | |-- Cornelia - | Fred | - | \ - | \ - | \-- Melvin |--- m17 - | | | - | Maria |--- m16 - | - | Alice |--- m15 - | | |--- f14 - | /----- Art |--- m13 - | / - \ / - \--- Eric | - | |------- Umo - /-- Elisa | - / \ - / \ - Ann | \--- Wendy |--- f12 - | | | | - Alfred | Walt |--- m11 - \ - \ - \-- David | ----- Jonas - | | - Deanna | - \ - \ - \--- Terry |--- m10 - | |--- m9 - Terri |--- f8 -*/ \ No newline at end of file Deleted: trunk/examples/forte/forte_uncle_owl.conf =================================================================== --- trunk/examples/forte/forte_uncle_owl.conf 2008-02-13 10:09:50 UTC (rev 552) +++ trunk/examples/forte/forte_uncle_owl.conf 2008-02-13 10:24:51 UTC (rev 553) @@ -1,120 +0,0 @@ -/** - * See forte_uncle.conf. This is the same learning problem, but loading background - * knowledge from an OWL file instead. - * - * Copyright (C) 2007, Jens Lehmann - */ - -/** background knowledge **/ - -import("forte.owl"); - -/** examples **/ - -/* small example set -+isUncle(art). -+isUncle(calvin). -+isUncle(carlos). -+isUncle(david). -+isUncle(eric). -+isUncle(fred). -+isUncle(frederick). -+isUncle(george). - --isUncle(alfred). --isUncle(alice). --isUncle(angela). --isUncle(bob). --isUncle(carl). --isUncle(christy). --isUncle(karl). -*/ - - // complete example set -+isUncle(art). -+isUncle(calvin). -+isUncle(carlos). -+isUncle(david). -+isUncle(eric). -+isUncle(fred). -+isUncle(frederick). -+isUncle(george). -+isUncle(harry). -+isUncle(jack). -+isUncle(james). -+isUncle(jonas). -+isUncle(karl). -+isUncle(leon). -+isUncle(mark). -+isUncle(melvin). -+isUncle(neil). -+isUncle(nero). -+isUncle(owen). -+isUncle(paul). -+isUncle(peter). -+isUncle(umo). -+isUncle(walt). - --isUncle(alfred). --isUncle(alice). --isUncle(angela). --isUncle(ann). --isUncle(beatrice). --isUncle(bob). --isUncle(callie). --isUncle(carl). --isUncle(christy). --isUncle(cornelia). --isUncle(deanna). --isUncle(elisa). --isUncle(f12). --isUncle(f14). --isUncle(f19). --isUncle(f2). --isUncle(f20). --isUncle(f21). --isUncle(f22). --isUncle(f23). --isUncle(f25). --isUncle(f26). --isUncle(f28). --isUncle(f8). --isUncle(fannie). --isUncle(gail). --isUncle(helen). --isUncle(jane). --isUncle(janet). --isUncle(kari). --isUncle(lorrie). --isUncle(m1). --isUncle(m10). --isUncle(m11). --isUncle(m13). --isUncle(m15). --isUncle(m16). --isUncle(m17). --isUncle(m18). --isUncle(m24). --isUncle(m27). --isUncle(m29). --isUncle(m3). --isUncle(m4). --isUncle(m5). --isUncle(m6). --isUncle(m7). --isUncle(m9). --isUncle(maria). --isUncle(martha). --isUncle(nancy). --isUncle(nonnie). --isUncle(oma). --isUncle(paula). --isUncle(prissie). --isUncle(rachel). --isUncle(ray). --isUncle(regina). --isUncle(steve). --isUncle(susan). --isUncle(terri). --isUncle(terry). --isUncle(wendy). Added: trunk/examples/forte/uncle_large.conf =================================================================== --- trunk/examples/forte/uncle_large.conf (rev 0) +++ trunk/examples/forte/uncle_large.conf 2008-02-13 10:24:51 UTC (rev 553) @@ -0,0 +1,113 @@ +/** + * Extracted from the FORTE (First Order Revision of Theories from Examples) + * data set: + * + * http://www.cs.utexas.edu/users/ml/forte.html + * + * The goal of this learning problem is to learn the concept of an uncle. + * + * In the file forte_family.kb, you can find a graphical representation of the + * family tree corresponding to the facts in this file. + * + * possible solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP + * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP)) + * + * Copyright (C) 2007, Jens Lehmann + */ + + + +import("forte_family.kb"); + +/** examples **/ + + +// complete example set ++art ++calvin ++carlos ++david ++eric ++fred ++frederick ++george ++harry ++jack ++james ++jonas ++karl ++leon ++mark ++melvin ++neil ++nero ++owen ++paul ++peter ++umo ++walt + +-alfred +-alice +-angela +-ann +-beatrice +-bob +-callie +-carl +-christy +-cornelia +-deanna +-elisa +-f12 +-f14 +-f19 +-f2 +-f20 +-f21 +-f22 +-f23 +-f25 +-f26 +-f28 +-f8 +-fannie +-gail +-helen +-jane +-janet +-kari +-lorrie +-m1 +-m10 +-m11 +-m13 +-m15 +-m16 +-m17 +-m18 +-m24 +-m27 +-m29 +-m3 +-m4 +-m5 +-m6 +-m7 +-m9 +-maria +-martha +-nancy +-nonnie +-oma +-paula +-prissie +-rachel +-ray +-regina +-steve +-susan +-terri +-terry +-wendy + Added: trunk/examples/forte/uncle_owl_large.conf =================================================================== --- trunk/examples/forte/uncle_owl_large.conf (rev 0) +++ trunk/examples/forte/uncle_owl_large.conf 2008-02-13 10:24:51 UTC (rev 553) @@ -0,0 +1,101 @@ +/** + * See uncle.conf. This is the same learning problem, but loading background + * knowledge from an OWL file instead. + * + * Copyright (C) 2007, Jens Lehmann + */ + +/** background knowledge **/ + +import("forte_family.owl"); + +/** examples **/ + + // complete example set ++art ++calvin ++carlos ++david ++eric ++fred ++frederick ++george ++harry ++jack ++james ++jonas ++karl ++leon ++mark ++melvin ++neil ++... [truncated message content] |