Prof. Demlová (cont.)

• more practical results

  • implementation is straightforward (e.g. usually linear both time and space complexity)

• only interesting point is mapping from GOF to FSO (decides types of concepts)

  • FSO provides a set of valid relations (e.g. Class sublassOf Class, Instance instanceOf Class)
  • used NP algorithm, problematic are small groups of nodes
  • From OWL to
  • SUMO, 1.434 concepts, 32 secs
  • OpenCyc, 71.939 concepts, 1.2 sec

Notes: