test program
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">
|
||||
<!-- html -->
|
||||
<meta name="src" content="manual.tex">
|
||||
<meta name="date" content="2013-09-04 21:32:00">
|
||||
<meta name="date" content="2013-09-17 13:02:00">
|
||||
<link rel="stylesheet" type="text/css" href="manual.css">
|
||||
</head><body
|
||||
>
|
||||
@@ -21,7 +21,7 @@ class="cmr-12">Fabrizio Riguzzi</span>
|
||||
<br /><span
|
||||
class="cmr-12">fabrizio.riguzzi@unife.it</span></div><br />
|
||||
<div class="date" ><span
|
||||
class="cmr-12">September 4, 2013</span></div>
|
||||
class="cmr-12">September 17, 2013</span></div>
|
||||
</div>
|
||||
<h3 class="sectionHead"><span class="titlemark">1 </span> <a
|
||||
id="x1-10001"></a>Introduction</h3>
|
||||
@@ -1339,69 +1339,121 @@ class="cmtt-10">background_clauses</span></span></span> (values: integer, d
|
||||
<li class="itemize"><span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">maxdepth_var</span></span></span> (values: integer, default value: 2, valid for SLIPCOVER):
|
||||
maximum depth of variables in clauses (as defined in <span class="cite">[<a
|
||||
href="#XDBLP:journals/ai/Cohen95">10</a>]</span>).</li></ul>
|
||||
<!--l. 633--><p class="noindent" >
|
||||
href="#XDBLP:journals/ai/Cohen95">10</a>]</span>).
|
||||
</li>
|
||||
<li class="itemize"><span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">score</span></span></span> (values: <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ll</span></span></span>, <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">aucpr</span></span></span>, default value <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ll</span></span></span>, valid for SLIPCOVER):
|
||||
determines the score function for refinement: if set to <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ll</span></span></span>, log likelihood is
|
||||
used, if set to <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">aucpr</span></span></span>, the area under the precision-recall curve is used.</li></ul>
|
||||
|
||||
<!--l. 635--><p class="noindent" >
|
||||
<h4 class="subsectionHead"><span class="titlemark">5.3 </span> <a
|
||||
id="x1-130005.3"></a>Commands</h4>
|
||||
<!--l. 634--><p class="noindent" >To execute CEM, load <span
|
||||
<!--l. 636--><p class="noindent" >To execute CEM, load <span
|
||||
class="cmtt-10">em.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-54">
|
||||
?:- use_module(library(’cplint/em’)).
|
||||
</div>
|
||||
<!--l. 637--><p class="nopar" > and call:
|
||||
<!--l. 639--><p class="nopar" > and call:
|
||||
|
||||
<div class="verbatim" id="verbatim-55">
|
||||
?:- em(stem).
|
||||
</div>
|
||||
<!--l. 641--><p class="nopar" > To execute RIB, load <span
|
||||
<!--l. 643--><p class="nopar" > To execute RIB, load <span
|
||||
class="cmtt-10">rib.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-56">
|
||||
?:- use_module(library(’cplint/rib’)).
|
||||
</div>
|
||||
<!--l. 645--><p class="nopar" > and call:
|
||||
<!--l. 647--><p class="nopar" > and call:
|
||||
|
||||
<div class="verbatim" id="verbatim-57">
|
||||
?:- ib_par(stem).
|
||||
</div>
|
||||
<!--l. 649--><p class="nopar" > To execute EMBLEM, load <span
|
||||
<!--l. 651--><p class="nopar" > To execute EMBLEM, load <span
|
||||
class="cmtt-10">slipcase.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-58">
|
||||
?:- use_module(library(’cplint/slipcase’)).
|
||||
</div>
|
||||
<!--l. 653--><p class="nopar" > and call
|
||||
<!--l. 655--><p class="nopar" > and call
|
||||
|
||||
<div class="verbatim" id="verbatim-59">
|
||||
?:- em(stem).
|
||||
</div>
|
||||
<!--l. 657--><p class="nopar" > To execute SLIPCASE, load <span
|
||||
<!--l. 659--><p class="nopar" > To execute SLIPCASE, load <span
|
||||
class="cmtt-10">slipcase.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-60">
|
||||
?:- use_module(library(’cplint/slipcase’)).
|
||||
</div>
|
||||
<!--l. 661--><p class="nopar" > and call
|
||||
<!--l. 663--><p class="nopar" > and call
|
||||
|
||||
<div class="verbatim" id="verbatim-61">
|
||||
?:- sl(stem).
|
||||
</div>
|
||||
<!--l. 665--><p class="nopar" > To execute SLIPCOVER, load <span
|
||||
<!--l. 667--><p class="nopar" > To execute SLIPCOVER, load <span
|
||||
class="cmtt-10">slipcover.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-62">
|
||||
?:- use_module(library(’cplint/slipcover’)).
|
||||
</div>
|
||||
<!--l. 669--><p class="nopar" > and call
|
||||
<!--l. 671--><p class="nopar" > and call
|
||||
|
||||
<div class="verbatim" id="verbatim-63">
|
||||
?:- sl(stem).
|
||||
</div>
|
||||
<!--l. 673--><p class="nopar" >
|
||||
<!--l. 675--><p class="nopar" >
|
||||
<h4 class="subsectionHead"><span class="titlemark">5.4 </span> <a
|
||||
id="x1-140005.4"></a>Learning Examples</h4>
|
||||
<!--l. 675--><p class="noindent" >The subfolders <span class="obeylines-h"><span class="verb"><span
|
||||
id="x1-140005.4"></a>Testing</h4>
|
||||
<!--l. 677--><p class="noindent" >To test the theories learned, load <span
|
||||
class="cmtt-10">test.pl </span>with
|
||||
|
||||
<div class="verbatim" id="verbatim-64">
|
||||
?:- use_module(library(’cplint/test’)).
|
||||
</div>
|
||||
<!--l. 680--><p class="nopar" > and call
|
||||
|
||||
<div class="verbatim" id="verbatim-65">
|
||||
?:- main([<stem_fold1>,...,<stem_foldn>],[<testing_set_fold1>,...,
|
||||
 <br />  <testing_set_foldn>]).
|
||||
</div>
|
||||
<!--l. 685--><p class="nopar" > For example, if you want to test the theory in <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ai_train.rules</span></span></span> on the set <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ai.kb</span></span></span>,
|
||||
you can call
|
||||
|
||||
<div class="verbatim" id="verbatim-66">
|
||||
?:- main([ai_train],[ai]).
|
||||
</div>
|
||||
<!--l. 689--><p class="nopar" > The testing program has the following parameter:
|
||||
<ul class="itemize1">
|
||||
<li class="itemize"><span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">neg_ex</span></span></span> (values: <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">given</span></span></span>, <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">cw</span></span></span>, default value: <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">cw</span></span></span>): if set to <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">given</span></span></span>, the negative
|
||||
examples are taken from <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10"><testing_set_foldi>.kb</span></span></span>, i.e., those example
|
||||
<span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">ex</span></span></span> stored as <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">neg(ex)</span></span></span>; if set to <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">cw</span></span></span>, the negative examples are generated
|
||||
according to the closed world assumption, i.e., all atoms for target
|
||||
predicates that are not positive examples. The set of all atoms is obtained
|
||||
by collecting the set of constants for each type of the arguments of the
|
||||
target predicate.</li></ul>
|
||||
<!--l. 696--><p class="noindent" >
|
||||
<h4 class="subsectionHead"><span class="titlemark">5.5 </span> <a
|
||||
id="x1-150005.5"></a>Learning Examples</h4>
|
||||
<!--l. 697--><p class="noindent" >The subfolders <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">em</span></span></span>, <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">rib</span></span></span>, <span class="obeylines-h"><span class="verb"><span
|
||||
class="cmtt-10">slipcase</span></span></span> and <span class="obeylines-h"><span class="verb"><span
|
||||
@@ -1409,26 +1461,27 @@ class="cmtt-10">slipcover</span></span></span> of the <span class="obeylines-h">
|
||||
class="cmtt-10">packages/cplint</span></span></span> folder in
|
||||
Yap git distribution contain examples of input and output files for the learning
|
||||
algorithms.
|
||||
<!--l. 678--><p class="noindent" >
|
||||
<!--l. 700--><p class="noindent" >
|
||||
<h3 class="sectionHead"><span class="titlemark">6 </span> <a
|
||||
id="x1-150006"></a>License</h3>
|
||||
<!--l. 683--><p class="noindent" ><span
|
||||
id="x1-160006"></a>License</h3>
|
||||
<!--l. 705--><p class="noindent" ><span
|
||||
class="cmtt-10">cplint</span>, as Yap, follows the Artistic License 2.0 that you can find in Yap CVS root
|
||||
dir. The copyright is by Fabrizio Riguzzi.
|
||||
<!--l. 686--><p class="indent" > The modules in the approx subdirectory use SimplecuddLPADs, a modification of
|
||||
<!--l. 708--><p class="indent" > The modules in the approx subdirectory use SimplecuddLPADs, a modification of
|
||||
the <a
|
||||
href="http://dtai.cs.kuleuven.be/problog/download.html" > Simplecudd </a> library whose copyright is by Katholieke Universiteit Leuven and
|
||||
that follows the Artistic License 2.0.
|
||||
<!--l. 689--><p class="indent" > Some modules use the library <a
|
||||
<!--l. 711--><p class="indent" > Some modules use the library <a
|
||||
href="http://vlsi.colorado.edu/~fabio/" > CUDD </a> for manipulating BDDs that is included in
|
||||
glu. For the use of CUDD, the following license must be accepted:
|
||||
<!--l. 694--><p class="indent" > Copyright (c) 1995-2004, Regents of the University of Colorado
|
||||
<!--l. 696--><p class="indent" > All rights reserved.
|
||||
<!--l. 698--><p class="indent" > Redistribution and use in source and binary forms, with or without modification,
|
||||
<!--l. 716--><p class="indent" > Copyright (c) 1995-2004, Regents of the University of Colorado
|
||||
<!--l. 718--><p class="indent" > All rights reserved.
|
||||
<!--l. 720--><p class="indent" > Redistribution and use in source and binary forms, with or without modification,
|
||||
are permitted provided that the following conditions are met:
|
||||
<ul class="itemize1">
|
||||
<li class="itemize">Redistributions of source code must retain the above copyright notice, this
|
||||
list of conditions and the following disclaimer.
|
||||
|
||||
</li>
|
||||
<li class="itemize">Redistributions in binary form must reproduce the above copyright notice,
|
||||
this list of conditions and the following disclaimer in the documentation
|
||||
@@ -1437,8 +1490,7 @@ are permitted provided that the following conditions are met:
|
||||
<li class="itemize">Neither the name of the University of Colorado nor the names of its
|
||||
contributors may be used to endorse or promote products derived from
|
||||
this software without specific prior written permission.</li></ul>
|
||||
|
||||
<!--l. 715--><p class="noindent" >THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS <br
|
||||
<!--l. 737--><p class="noindent" >THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS <br
|
||||
class="newline" />AND CONTRIBUTORS ”AS IS” AND ANY EXPRESS OR IMPLIED
|
||||
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
@@ -1452,7 +1504,7 @@ class="newline" />AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
||||
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
<!--l. 729--><p class="indent" > <span
|
||||
<!--l. 751--><p class="indent" > <span
|
||||
class="cmtt-10">lpad.pl</span>, <span
|
||||
class="cmtt-10">semlpad.pl </span>and <span
|
||||
class="cmtt-10">cpl.pl </span>are based on the SLG system by Weidong
|
||||
@@ -1462,7 +1514,7 @@ href="http://www.cs.sunysb.edu/~warren/" > David Scott Warren </a>, Copyright (C
|
||||
on this copyright.
|
||||
<!--l. 1--><p class="noindent" >
|
||||
<h3 class="likesectionHead"><a
|
||||
id="x1-160006"></a>References</h3>
|
||||
id="x1-170006"></a>References</h3>
|
||||
<!--l. 1--><p class="noindent" >
|
||||
<div class="thebibliography">
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
@@ -1480,6 +1532,7 @@ class="cmti-10">Proceedings of the 26th Italian</span>
|
||||
class="cmti-10">Conference on Computational Logic (CILC2011), Pescara, Italy, 31 August</span>
|
||||
<span
|
||||
class="cmti-10">31-2 September, 2011</span>, 2011.
|
||||
|
||||
</p>
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[3]<span class="bibsp">   </span></span><a
|
||||
@@ -1490,7 +1543,6 @@ class="cmti-10">31-2 September, 2011</span>, 2011.
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[4]<span class="bibsp">   </span></span><a
|
||||
id="XBelRig11-ILP11-IC"></a>Elena Bellodi and Fabrizio Riguzzi. Learning the structure of
|
||||
|
||||
probabilistic logic programs. In <span
|
||||
class="cmti-10">Inductive Logic Programming, 21th</span>
|
||||
<span
|
||||
@@ -1537,6 +1589,7 @@ class="cmti-10">LNCS</span>, pages 30–37. Springer, 2011.
|
||||
delaying for general logic programs. <span
|
||||
class="cmti-10">Journal of the ACM</span>, 43(1):20–74, 1996.
|
||||
</p>
|
||||
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[10]<span class="bibsp">   </span></span><a
|
||||
id="XDBLP:journals/ai/Cohen95"></a>William W. Cohen. Pac-learning non-recursive prolog clauses. <span
|
||||
@@ -1551,7 +1604,6 @@ class="cmti-10">Intell.</span>, 79(1):1–38, 1995.
|
||||
class="cmti-10">International Joint</span>
|
||||
<span
|
||||
class="cmti-10">Conference on Artificial Intelligence</span>, pages 2462–2467, 2007.
|
||||
|
||||
</p>
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[12]<span class="bibsp">   </span></span><a
|
||||
@@ -1596,6 +1648,7 @@ class="cmti-10">LNAI</span>, pages 109–120. Springer, 2007.
|
||||
class="cmti-10">Proceedings of the 14th RCRA workshop Experimental Evaluation of</span>
|
||||
<span
|
||||
class="cmti-10">Algorithms for Solving Problems with Combinatorial Explosion</span>, 2007.
|
||||
|
||||
</p>
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[18]<span class="bibsp">   </span></span><a
|
||||
@@ -1612,7 +1665,6 @@ class="cmti-10">Proceedings of the 26th Italian</span>
|
||||
class="cmti-10">Conference on Computational Logic (CILC2011), Pescara, Italy, 31</span>
|
||||
<span
|
||||
class="cmti-10">August-2 September, 2011</span>, 2011.
|
||||
|
||||
</p>
|
||||
<p class="bibitem" ><span class="biblabel">
|
||||
[20]<span class="bibsp">   </span></span><a
|
||||
@@ -1661,6 +1713,7 @@ class="cmti-10">International Conference on Logic</span>
|
||||
<span
|
||||
class="cmti-10">Programming</span>, volume 3131 of <span
|
||||
class="cmti-10">LNCS</span>, pages 195–209. Springer, 2004.
|
||||
|
||||
</p>
|
||||
</div>
|
||||
|
||||
|
Reference in New Issue
Block a user