Semantic Annotation for Process Models: - Department of Computer ...
Semantic Annotation for Process Models: - Department of Computer ... Semantic Annotation for Process Models: - Department of Computer ...
194 APPENDIX D. ALGORITHM FOR GOAL ANNOTATION Algorithm 5 Goal Annotation Algorithm for Case C Require: weight parameters ε, ζ initialize value of weight f oractoronto, weight f oractorname as 0 Arrayar[] is a set of actor-roles associated with av through has_Actor-role for each ar in ar[] do onto = OD(ar) {OD(ar) gets the domain ontological concept annotated to ar} for each target role ar ′ of a g in goal ontology do r = SR(ar, onto) {SR(ar, onto) gets the semantic relationship between ar and onto} initialize σ, τ as 0 if onto equals ar ′ then if r is "same_as" then σ = 1 else if r is "kind_of" then σ = 0.8 else if r is "phase_of" then σ = 0.5 end if end if weight f oractoronto = weight f oractoronto+σ if ar.name equals ar ′ .name by string match then τ = 1 else if ar.name partly equals ar ′ .name by string match then τ = 0.5 end if weight f oractorname = weight f orartorname+τ end for end for return ε ∗ weight f orarti f actonto+ζ ∗ weight f orarti f actname
195 Algorithm 6 Goal Annotation Algorithm for Case D Require: weight parameters ε, ζ initialize value of weight f orprecondition, weight f orpostcondition, weight f orexception as 0 Arraypre[] is a set of preconditions associated with av through has_Precondition initialize σ, τ as 0 for each precon in pre[] do for each target constraint c ′ of a g in goal ontology do if precon.name equals c ′ .name by string match then τ = 1 else if precon.name partly equals c ′ .name by string match then τ = 0.5 end if weight f orprecondition = weight f orprecondition+τ end for end for Arraypost[] is a set of postconditions associated with av through has_Postcondition initialize σ, τ as 0 for each postcon in post[] do for each target constraint c ′ of a g in goal ontology do if postcon.name equals c ′ .name by string match then τ = 1 else if postcon.name partly equals c ′ .name by string match then τ = 0.5 end if weight f orpostcondition = weight f orpostcondition+τ end for end for Arrayexc[] is a set of exceptions associated with av through has_Exception initialize σ, τ as 0 for each exception in exc[] do for each target constraint c ′ of a g in goal ontology do if exception.name equals c ′ .name by string match then τ = 1 else if exception.name partly equals c ′ .name by string match then τ = 0.5 end if weight f orexception = weight f orexception+ τ end for end for return η ∗ (weight f orprecondition + weight f orpostcondition + weight f orexception)
- Page 163 and 164: Chapter 9 Validation of Applicabili
- Page 165 and 166: 9.1. VALIDATION DESIGN 145 - RE3.3
- Page 167 and 168: 9.2. SWRL FORMULATION 147 Table 9.1
- Page 169 and 170: 9.2. SWRL FORMULATION 149 RE3.2 RE3
- Page 171 and 172: 9.3. APPLICABILITY VALIDATION IN AN
- Page 173 and 174: 9.3. APPLICABILITY VALIDATION IN AN
- Page 175 and 176: 9.3. APPLICABILITY VALIDATION IN AN
- Page 177 and 178: 9.3. APPLICABILITY VALIDATION IN AN
- Page 179 and 180: 9.4. DISCUSSION ON RESULTS OF THE V
- Page 181 and 182: 9.4. DISCUSSION ON RESULTS OF THE V
- Page 183: Part IV Synopsis 163
- Page 186 and 187: 166 CHAPTER 10. CONCLUSIONS AND FUT
- Page 188 and 189: 168 CHAPTER 10. CONCLUSIONS AND FUT
- Page 190 and 191: 170 CHAPTER 10. CONCLUSIONS AND FUT
- Page 193 and 194: Appendix A BPMN This chapter presen
- Page 195 and 196: A.3. CONNECTING OBJECTS 175 Figure
- Page 197 and 198: A.6. BPMN META-MODEL TREE IN METIS
- Page 199 and 200: Appendix B EEML 2005 The language v
- Page 201 and 202: B.2. RECOURSES MODELING DOMAIN 181
- Page 203 and 204: Appendix C SCOR SCOR — Supply Cha
- Page 205 and 206: C.2. LEVEL 2 TOOLKIT 185 Level 1 Me
- Page 207 and 208: C.3. LEVEL 3 PROCESS ELEMENTS 187 F
- Page 209 and 210: Appendix D Algorithm for Semi-Autom
- Page 211 and 212: 191 Algorithm 1 Goal Annotation Alg
- Page 213: Algorithm 4 Goal Annotation Algorit
- Page 217 and 218: Appendix E GUI of Pro-SEAT The prop
- Page 219 and 220: 199 Figure E.3: Mapping meta-model
- Page 221 and 222: 201 Figure E.5: Goal annotation UI
- Page 223 and 224: Appendix F Analysis of the Annotati
- Page 225 and 226: F.2. INTEGRATION APPLICATION BASED
- Page 227 and 228: F.2. INTEGRATION APPLICATION BASED
- Page 229 and 230: Appendix G Schema of PSAM and SWRL
- Page 231 and 232: G.1. PSAM IN OWL 211
- Page 233 and 234: G.2. RULE DEFINITIONS IN SWRL 213
- Page 235 and 236: G.2. RULE DEFINITIONS IN SWRL 215
- Page 237 and 238: Appendix H Annotation Results in Ex
- Page 239 and 240: H.2. ANNOTATION OF PM B1 219 xmlns:
- Page 241 and 242: H.3. ANNOTATION OF PM B2 221 Av
- Page 243 and 244: Bibliography [1] ALTOVA. What is th
- Page 245 and 246: BIBLIOGRAPHY 225 [26] Dov Dori. Why
- Page 247 and 248: BIBLIOGRAPHY 227 [52] Ian Horrocks.
- Page 249 and 250: BIBLIOGRAPHY 229 [78] John Krogstie
- Page 251 and 252: BIBLIOGRAPHY 231 [102] Diana Maynar
- Page 253 and 254: BIBLIOGRAPHY 233 [129] OASIS Cover
- Page 255 and 256: BIBLIOGRAPHY 235 [157] Colette Roll
- Page 257 and 258: BIBLIOGRAPHY 237 [185] Systems Thin
- Page 259: BIBLIOGRAPHY 239 [214] John.A. Zach
195<br />
Algorithm 6 Goal <strong>Annotation</strong> Algorithm <strong>for</strong> Case D<br />
Require: weight parameters ε, ζ<br />
initialize value <strong>of</strong> weight f orprecondition, weight f orpostcondition,<br />
weight f orexception as 0<br />
Arraypre[] is a set <strong>of</strong> preconditions associated with av through has_Precondition<br />
initialize σ, τ as 0<br />
<strong>for</strong> each precon in pre[] do<br />
<strong>for</strong> each target constraint c ′ <strong>of</strong> a g in goal ontology do<br />
if precon.name equals c ′ .name by string match then<br />
τ = 1<br />
else if precon.name partly equals c ′ .name by string match then<br />
τ = 0.5<br />
end if<br />
weight f orprecondition = weight f orprecondition+τ<br />
end <strong>for</strong><br />
end <strong>for</strong><br />
Arraypost[] is a set <strong>of</strong> postconditions associated with av through has_Postcondition<br />
initialize σ, τ as 0<br />
<strong>for</strong> each postcon in post[] do<br />
<strong>for</strong> each target constraint c ′ <strong>of</strong> a g in goal ontology do<br />
if postcon.name equals c ′ .name by string match then<br />
τ = 1<br />
else if postcon.name partly equals c ′ .name by string match then<br />
τ = 0.5<br />
end if<br />
weight f orpostcondition = weight f orpostcondition+τ<br />
end <strong>for</strong><br />
end <strong>for</strong><br />
Arrayexc[] is a set <strong>of</strong> exceptions associated with av through has_Exception<br />
initialize σ, τ as 0<br />
<strong>for</strong> each exception in exc[] do<br />
<strong>for</strong> each target constraint c ′ <strong>of</strong> a g in goal ontology do<br />
if exception.name equals c ′ .name by string match then<br />
τ = 1<br />
else if exception.name partly equals c ′ .name by string match then<br />
τ = 0.5<br />
end if<br />
weight f orexception = weight f orexception+ τ<br />
end <strong>for</strong><br />
end <strong>for</strong><br />
return η ∗ (weight f orprecondition + weight f orpostcondition + weight f orexception)