Prof. RNDr. M. Demlová, CSc.

• ontology grammar → formalism grammar

• more results

  • memory is not important (linearly dependent on source size)
  • gate implementations dependent on used library
  • only interesting point is the mapping engine (from GOF graph to FSO)
    • non-polynomial due to ambiguity in rules (e.g. instanceOf for class/instance and property/assignment)
    • small isolated cases
    • used for its simplicity and ability to find best mapping, can be replaced

Notes: