-
Notifications
You must be signed in to change notification settings - Fork 0
/
randombuilder.go
196 lines (184 loc) · 6.43 KB
/
randombuilder.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
// The MIT License (MIT)
//
// Copyright (c) 2016, 2017, 2018 Fabian Wenzelmann
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
package goel
import (
"fmt"
"math/rand"
)
type RandomELBuilder struct {
NumIndividuals uint
NumConceptNames uint
NumRoles uint
NumConcreteDomains uint
MaxCDSize uint
MaxNumPredicates uint
MaxNumFeatures uint
}
func (builder *RandomELBuilder) GenerateRandomTBox(numCDExtensions, numConjunctions,
numExistentialRestrictions, maxtRILHS, numGCI, numRI uint) ([]Concept, *TBox) {
baseComponents := NewELBaseComponents(builder.NumIndividuals, numCDExtensions, builder.NumConceptNames, builder.NumRoles)
concepts := make([]Concept, 0)
// first build all nominal concepts
var i uint
for ; i < builder.NumIndividuals; i++ {
next := NewNominalConcept(i)
concepts = append(concepts, next)
}
// next build all named concepts
i = 0
for ; i < builder.NumConceptNames; i++ {
next := NewNamedConcept(i)
concepts = append(concepts, next)
}
// create all CDExtensions
i = 0
for ; i < numCDExtensions; i++ {
next := NewConcreteDomainExtension(i)
concepts = append(concepts, next)
}
// we create conjunctions and existenstial restrictions in one loop, s.t.
// they get mixed up a bit
var currentConjunctions uint = 0
var currentExistentials uint = 0
for currentConjunctions < numConjunctions || currentExistentials < numExistentialRestrictions {
// first decide whether to use a conjunction or an existential
isNextConjunction := (rand.Intn(2) == 0)
if isNextConjunction {
// first check if we're still allowed to add another
// conjunction, otherwise we must use an existential
if currentConjunctions >= numConjunctions {
isNextConjunction = false
}
} else {
// we're to create an existensial, again check if we're allowed to do this
if currentExistentials >= numExistentialRestrictions {
isNextConjunction = true
}
}
// now finally we can create the next concept dependend on isNextConjunction
if isNextConjunction {
// randomly select to concepts
var c1 Concept
c1 = concepts[rand.Intn(len(concepts))]
var c2 Concept
c2 = concepts[rand.Intn(len(concepts))]
next := NewConjunction(c1, c2)
concepts = append(concepts, next)
currentConjunctions++
} else {
// choose role
// TODO not so nice, but ok
r := NewRole(uint(rand.Intn(int(builder.NumRoles))))
// chose a concept
c := concepts[rand.Intn(len(concepts))]
next := NewExistentialConcept(r, c)
concepts = append(concepts, next)
currentExistentials++
}
}
// build all ris
ris := make([]*RoleInclusion, 0, numRI)
i = 0
for ; i < numRI; i++ {
rhs := NewRole(uint(rand.Intn(int(builder.NumRoles))))
lhsSize := rand.Intn(int(maxtRILHS))
if lhsSize == 0 {
lhsSize = 1
}
lhs := make([]Role, 0, lhsSize)
for j := 0; j < lhsSize; j++ {
// add random role
nextRole := NewRole(uint(rand.Intn(int(builder.NumRoles))))
lhs = append(lhs, nextRole)
}
ris = append(ris, NewRoleInclusion(lhs, rhs))
}
gcis := make([]*GCIConstraint, 0, numGCI)
i = 0
for ; i < numGCI; i++ {
lhs := concepts[rand.Intn(len(concepts))]
rhs := concepts[rand.Intn(len(concepts))]
gcis = append(gcis, NewGCIConstraint(lhs, rhs))
}
return concepts, NewTBox(baseComponents, gcis, ris)
}
type NormalizedRandomELBuilder struct {
NumIndividuals uint
NumConceptNames uint
NumRoles uint
}
func (builder *NormalizedRandomELBuilder) chooseConcept() uint {
n := builder.NumIndividuals + builder.NumConceptNames
return uint(rand.Intn(int(n)) + 2)
}
func (builder *NormalizedRandomELBuilder) chooseRole() uint {
return uint(rand.Intn(int(builder.NumRoles)))
}
func (builder *NormalizedRandomELBuilder) GenerateRandomTBox(numNormalizedCI,
numExistentialRestrictions, numRI int) *NormalizedTBox {
fmt.Println("WHAT?!")
c := NewELBaseComponents(builder.NumIndividuals, 0, builder.NumConceptNames, builder.NumRoles)
cis := make([]*NormalizedCI, numNormalizedCI)
for i := 0; i < int(numNormalizedCI); i++ {
if rand.Intn(2) == 0 {
// C2 is nil
c1, d := builder.chooseConcept(), builder.chooseConcept()
cis[i] = NewNormalizedCISingle(c.GetConcept(c1), c.GetConcept(d))
} else {
// not nil
c1, c2, d := builder.chooseConcept(), builder.chooseConcept(), builder.chooseConcept()
cis[i] = NewNormalizedCI(c.GetConcept(c1), c.GetConcept(c2), c.GetConcept(d))
}
}
ciLeft := make([]*NormalizedCILeftEx, 0)
ciRight := make([]*NormalizedCIRightEx, 0)
for i := 0; i < int(numExistentialRestrictions); i++ {
if rand.Intn(2) == 0 {
// left
c1, d, r := builder.chooseConcept(), builder.chooseConcept(), builder.chooseRole()
ciLeft = append(ciLeft, NewNormalizedCILeftEx(NewRole(r), c.GetConcept(c1), c.GetConcept(d)))
} else {
// right
c1, r, c2 := builder.chooseConcept(), builder.chooseRole(), builder.chooseConcept()
ciRight = append(ciRight, NewNormalizedCIRightEx(c.GetConcept(c1), NewRole(r), c.GetConcept(c2)))
}
}
ris := make([]*NormalizedRI, numRI)
for i := 0; i < int(numRI); i++ {
if rand.Intn(2) == 0 {
// r2 is NoRole
r1, s := builder.chooseRole(), builder.chooseRole()
ris[i] = NewNormalizedRISingle(NewRole(r1), NewRole(s))
} else {
// r2 is some role
r1, r2, s := builder.chooseRole(), builder.chooseRole(), builder.chooseRole()
ris[i] = NewNormalizedRI(NewRole(r1), NewRole(r2), NewRole(s))
}
}
return &NormalizedTBox{
Components: c,
CIs: cis,
CILeft: ciLeft,
CIRight: ciRight,
RIs: ris,
}
}