Download SR-meta-procedure - Tallinn University

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

page
1
page
2
page
3
page
4
page
5
page
6
Document related concepts
no text concepts found
Transcript 
SR-meta-procedure
prof. Peeter Lorents
Cooperative Cyber Defence
Centre of Excellence
Associate prof. Erika Matsak
Institute of Informatics,
Tallinn University, Estonia
From: System mining inference rules from
natural language texts, Orlando, USA, 2010



,
,

,

,



,


,

,

,



,

,

,

,

,
,
etc

,


Let us view the set Cart(H) = H(1)  H(2) Orlando
 H(3)2010
 H(4)  … .
24.05.2017

,
,
,

2 of 22
4
0
1
3
2

5


,
,

,


,

13


,

,

,


,
,
7
8

,
9

,

12

,

,
14

6

,
,

,

11

,
,
 10
Since according to Zermelo’s theorem (see Kuratowski, Mostowski 1967, chapter VII, §8;
Potter 2004, chapter 14, 14.4.3) it is possible to order any set, then we can also order the set
Cart(H) and index its elements with suitable ordinal numbers, which are smaller than some .
Let us agree that the symbol h is used to represent the element in Cart(H) which is
indexed as . The procedure in question consists of steps based on the indexes so
that each for index  there is a step: step , which, in turn, is divided into substeps where each index  corresponds with a sub-step: sub-step .
0
1
2
Similar?
Step 0: Forming predicate P0.
We take the element h0Cart
(H) and such a natural number
m0, where .
Begin sub-step 00.
Sub-step 0.
RelH(h0) ?
P00 = {h00}
If the requirement is met, then the
step 0 “Forming predicate P0“
continues and we take
h0 = h
P0  [ P0 ] {h 0 }
 
24.05.2017
Orlando 2010
4 of 22
Comment. P0 is the intersection of the totality area of the meta-predicate SH and the
meta-predicate RH. Let us begin the new sub-step of step 0.
If the requirement is not met, then the step 0 “Forming predicate P0“ ends with the
result
P0   P0
 
We begin the next step.
Step : Forming predicate P.
Let us take the element hCart (H) and such a natural number m, where .
Begin sub-step 0.
Step : Forming predicate P. Sub-step 0.
Check the requirement RelH(h).
If the requirement is met, then the “Step : Forming predicate P“ continues and we
take
h0 = h
P0 = {h0}.
24.05.2017
Orlando 2010
5 of 22
predicate P0
predicate P4
predicate P1



,

,
,

,





,
,

,
,
,
,
,


,
predicate P2


predicate P5



,
,
,
,


predicate P6


24.05.2017
,
,



predicate P3

Orlando 2010
,

,
,
,
,
,



6 of 22
Related documents