Menu
▾
▴
[DL-Learner SVN] SF.net SVN: dl-learner: [143] trunk/examples
|
From: <jen...@us...> - 2007-09-19 12:37:49
|
Revision: 143
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=143&view=rev
Author: jenslehmann
Date: 2007-09-19 05:37:45 -0700 (Wed, 19 Sep 2007)
Log Message:
-----------
example cleanup continued
Modified Paths:
--------------
trunk/examples/forte/forte_uncle.conf
trunk/examples/forte/forte_uncle_owl.conf
trunk/examples/poker/pair_owl.conf
trunk/examples/poker/poker_pair.conf
trunk/examples/poker/poker_straight.conf
trunk/examples/poker/straight_owl.conf
trunk/examples/trains/trains.conf
trunk/examples/trains/trains_owl.conf
trunk/examples/yinyang_files/readme.txt
Modified: trunk/examples/forte/forte_uncle.conf
===================================================================
--- trunk/examples/forte/forte_uncle.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/forte/forte_uncle.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,24 +1,27 @@
/**
* Extracted from the FORTE (First Order Revision of Theories from Examples)
- * data set
+ * data set:
*
* http://www.cs.utexas.edu/users/ml/forte.html
*
- * solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP
+ * 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;
+showInternalKB = true;
+showSubsumptionHierarchy = true;
-algorithm = refinement;
-
-
-
/** background knowledge **/
BOTTOM = (male AND female).
@@ -393,18 +396,6 @@
-isUncle(terry).
-isUncle(wendy).
-
-
-// temporär:
-/*
-married(art,alice).
-married(david,deanna).
-married(harry,helen).
-married(melvin,maria).
-married(ray,regina).
-married(terry,terri).
-*/
-
/* Here's the family shown graphically:
Steve |--- m7
Modified: trunk/examples/forte/forte_uncle_owl.conf
===================================================================
--- trunk/examples/forte/forte_uncle_owl.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/forte/forte_uncle_owl.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,14 +1,10 @@
/**
- * Extracted from the FORTE (First Order Revision of Theories from Examples)
- * data set
+ * See forte_uncle.conf. This is the same learning problem, but loading background
+ * knowledge from an OWL file instead.
*
- * http://www.cs.utexas.edu/users/ml/forte.html
- *
- * solution: (male AND (EXISTS hasSibling.EXISTS hasChild.TOP
- * OR EXISTS married.EXISTS hasSibling.EXISTS hasChild.TOP))
+ * Copyright (C) 2007, Jens Lehmann
*/
-
/** background knowledge **/
import("forte.owl");
Modified: trunk/examples/poker/pair_owl.conf
===================================================================
--- trunk/examples/poker/pair_owl.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/poker/pair_owl.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,3 +1,10 @@
+/**
+ * See poker_pair.conf. This is the same learning problem, but loading background
+ * knowledge from an OWL file instead.
+ *
+ * Copyright (C) 2007, Jens Lehmann
+ */
+
showConcepts = true;
showRoles = true;
showIndividuals = true;
Modified: trunk/examples/poker/poker_pair.conf
===================================================================
--- trunk/examples/poker/poker_pair.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/poker/poker_pair.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,3 +1,14 @@
+/**
+ * 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).
Modified: trunk/examples/poker/poker_straight.conf
===================================================================
--- trunk/examples/poker/poker_straight.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/poker/poker_straight.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,3 +1,18 @@
+/**
+ * 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
+ * straight (5 cards with increasing rank). Note, that for Ace and 2 in one deck,
+ * nextRank is set between these two cards only if there is no king in the deck.
+ * Otherwise the special case that a straight can start with Ace cannot be
+ * handled using ALC as target language.
+ *
+ * possible solution:
+ * EXISTS hasCard.EXISTS nextRank.EXISTS nextRank.EXISTS nextRank.
+ * EXISTS nextRank.TOP
+ *
+ * Copyright (C) 2007, Jens Lehmann
+ */
+
deck(hand0).
card(card0).
hasCard(hand0,card0).
Modified: trunk/examples/poker/straight_owl.conf
===================================================================
--- trunk/examples/poker/straight_owl.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/poker/straight_owl.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,3 +1,10 @@
+/**
+ * See poker_straight.conf. This is the same learning problem, but loading
+ * background knowledge from an OWL file instead.
+ *
+ * Copyright (C) 2007, Jens Lehmann
+ */
+
import("straight.owl");
refinement.quiet = false;
Modified: trunk/examples/trains/trains.conf
===================================================================
--- trunk/examples/trains/trains.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/trains/trains.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -26,13 +26,15 @@
* Intelligence, Vol. PAMI-2, No. 4, pp. 349-361, July 1980.
*
* http://www.mli.gmu.edu/papers/79-80/80-05.pdf (page 11)
+ *
+ * Copyright (C) 2007, Jens Lehmann
*/
useRetrievalForClassification = false;
refinement.useDIGMultiInstanceChecks = twoChecks;
/** background knowledge **/
-// TODO: more knowledge can be added here, e.g. that all classes are disjunct;
+// TODO: more knowledge could be added here, e.g. that all classes are disjoint;
// shape can be described using nominals i.e. a fixed set of values; etc.
car(car_11). car(car_12). car(car_13). car(car_14).
Modified: trunk/examples/trains/trains_owl.conf
===================================================================
--- trunk/examples/trains/trains_owl.conf 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/trains/trains_owl.conf 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,3 +1,10 @@
+/**
+ * See arch.conf. This is the same learning problem, but loading background
+ * knowledge from an OWL file instead.
+ *
+ * Copyright (C) 2007, Jens Lehmann
+ */
+
import("trains.owl");
algorithm = refinement;
Modified: trunk/examples/yinyang_files/readme.txt
===================================================================
--- trunk/examples/yinyang_files/readme.txt 2007-09-18 11:52:14 UTC (rev 142)
+++ trunk/examples/yinyang_files/readme.txt 2007-09-19 12:37:45 UTC (rev 143)
@@ -1,2 +1,3 @@
This directory contains additional files, which are needed in order to test the
-DL-Learner examples with YinYang.
+DL-Learner examples with YinYang. Use run.bat (Windows) or run (other systems)
+to run the examples. You have to adapt the path to YinYang in these files first.
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
